lkml.org 
[lkml]   [2018]   [Nov]   [28]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [RFC PATCH 0/5] x86: dynamic indirect call promotion
On Wed, Oct 17, 2018 at 05:54:15PM -0700, Nadav Amit wrote:
> This RFC introduces indirect call promotion in runtime, which for the
> matter of simplification (and branding) will be called here "relpolines"
> (relative call + trampoline). Relpolines are mainly intended as a way
> of reducing retpoline overheads due to Spectre v2.
>
> Unlike indirect call promotion through profile guided optimization, the
> proposed approach does not require a profiling stage, works well with
> modules whose address is unknown and can adapt to changing workloads.
>
> The main idea is simple: for every indirect call, we inject a piece of
> code with fast- and slow-path calls. The fast path is used if the target
> matches the expected (hot) target. The slow-path uses a retpoline.
> During training, the slow-path is set to call a function that saves the
> call source and target in a hash-table and keep count for call
> frequency. The most common target is then patched into the hot path.
>
> The patching is done on-the-fly by patching the conditional branch
> (opcode and offset) that is used to compare the target to the hot
> target. This allows to direct all cores to the fast-path, while patching
> the slow-path and vice-versa. Patching follows 2 more rules: (1) Only
> patch a single byte when the code might be executed by any core. (2)
> When patching more than one byte, ensure that all cores do not run the
> to-be-patched-code by preventing this code from being preempted, and
> using synchronize_sched() after patching the branch that jumps over this
> code.
>
> Changing all the indirect calls to use relpolines is done using assembly
> macro magic. There are alternative solutions, but this one is
> relatively simple and transparent. There is also logic to retrain the
> software predictor, but the policy it uses may need to be refined.
>
> Eventually the results are not bad (2 VCPU VM, throughput reported):
>
> base relpoline
> ---- ---------
> nginx 22898 25178 (+10%)
> redis-ycsb 24523 25486 (+4%)
> dbench 2144 2103 (+2%)
>
> When retpolines are disabled, and if retraining is off, performance
> benefits are up to 2% (nginx), but are much less impressive.

Hi Nadav,

Peter pointed me to these patches during a discussion about retpoline
profiling. Personally, I think this is brilliant. This could help
networking and filesystem intensive workloads a lot.

Some high-level comments:

- "Relpoline" looks confusingly a lot like "retpoline". How about
"optpoline"? To avoid confusing myself I will hereafter refer to it
as such :-)

- Instead of patching one byte at a time, is there a reason why
text_poke_bp() can't be used? That would greatly simplify the
patching process, as everything could be patched in a single step.

- In many cases, a single direct call may not be sufficient, as there
could be for example multiple tasks using different network protocols
which need different callbacks for the same call site.

- I'm not sure about the periodic retraining logic, it seems a bit
nondeterministic and bursty.

So I'd propose the following changes:

- In the optpoline, reserve space for multiple (5 or so) comparisons and
direct calls. Maybe the number of reserved cmp/jne/call slots can be
tweaked by the caller somehow. Or maybe it could grow as needed.
Starting out, they would just be NOPs.

- Instead of the temporary learning mode, add permanent tracking to
detect a direct call "miss" -- i.e., when none of the existing direct
calls are applicable and the retpoline will be used.

- In the case of a miss (or N misses), it could trigger a direct call
patching operation to be run later (workqueue or syscall exit). If
all the direct call slots are full, it could patch the least recently
modified one. If this causes thrashing (>x changes over y time), it
could increase the number of direct call slots using a trampoline.
Even if there were several slots, CPU branch prediction would
presumably help make it much faster than a basic retpoline.

Thoughts?

--
Josh

\
 
 \ /
  Last update: 2018-11-28 17:09    [W:0.124 / U:6.012 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site