lkml.org 
[lkml]   [2019]   [Apr]   [15]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH V5 4/7] jump_label: Sort entries of the same key by the code
On Mon, Apr 01, 2019 at 10:58:16AM +0200, Daniel Bristot de Oliveira wrote:
> In the batching mode, entries with the same key should also be sorted by the
> code, enabling a bsearch() of a code/addr when updating a key.

Might be good to explain *why*.

We can see what the code does, explaining why we do things is what we
have Changelogs for.

> Signed-off-by: Daniel Bristot de Oliveira <bristot@redhat.com>
> Cc: Thomas Gleixner <tglx@linutronix.de>
> Cc: Ingo Molnar <mingo@redhat.com>
> Cc: Borislav Petkov <bp@alien8.de>
> Cc: "H. Peter Anvin" <hpa@zytor.com>
> Cc: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
> Cc: Masami Hiramatsu <mhiramat@kernel.org>
> Cc: "Steven Rostedt (VMware)" <rostedt@goodmis.org>
> Cc: Jiri Kosina <jkosina@suse.cz>
> Cc: Josh Poimboeuf <jpoimboe@redhat.com>
> Cc: "Peter Zijlstra (Intel)" <peterz@infradead.org>
> Cc: Chris von Recklinghausen <crecklin@redhat.com>
> Cc: Jason Baron <jbaron@akamai.com>
> Cc: Scott Wood <swood@redhat.com>
> Cc: Marcelo Tosatti <mtosatti@redhat.com>
> Cc: Clark Williams <williams@redhat.com>
> Cc: x86@kernel.org
> Cc: linux-kernel@vger.kernel.org
> ---
> kernel/jump_label.c | 16 ++++++++++++++++
> 1 file changed, 16 insertions(+)
>
> diff --git a/kernel/jump_label.c b/kernel/jump_label.c
> index e666a4d6642a..8b7bfbba4cef 100644
> --- a/kernel/jump_label.c
> +++ b/kernel/jump_label.c
> @@ -36,12 +36,28 @@ static int jump_label_cmp(const void *a, const void *b)
> const struct jump_entry *jea = a;
> const struct jump_entry *jeb = b;
>
> + /*
> + * Entrires are sorted by key.
> + */
> if (jump_entry_key(jea) < jump_entry_key(jeb))
> return -1;
>
> if (jump_entry_key(jea) > jump_entry_key(jeb))
> return 1;
>
> +#ifdef HAVE_JUMP_LABEL_BATCH
> + /*
> + * In the batching mode, entries should also be sorted by the code
> + * inside the already sorted list of entries, enabling a bsearch in
> + * the vector.
> + */
> + if (jump_entry_code(jea) < jump_entry_code(jeb))
> + return -1;
> +
> + if (jump_entry_code(jea) > jump_entry_code(jeb))
> + return 1;
> +#endif
> +
> return 0;
> }

The secondary sort order doesn't hurt, so we could leave the #ifdef out,
not sure.

\
 
 \ /
  Last update: 2019-04-15 12:57    [W:0.056 / U:4.496 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site