lkml.org 
[lkml]   [2015]   [Apr]   [13]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH v5 10/10] module: Rework module_addr_{min,max}

* Peter Zijlstra <peterz@infradead.org> wrote:

> __module_address() does an initial bound check before doing the
> {list/tree} iteration to find the actual module. The bound variables
> are nowhere near the mod_tree cacheline, in fact they're nowhere
> near one another.
>
> module_addr_min lives in .data while module_addr_max lives in .bss
> (smarty pants GCC thinks the explicit 0 assignment is a mistake).
>
> Rectify this by moving the two variables into a structure together
> with the latch_tree_root to guarantee they all share the same
> cacheline and avoid hitting two extra cachelines for the lookup.
>
> While reworking the bounds code, move the bound update from
> allocation to insertion time, this avoids updating the bounds for a
> few error paths.

> +static struct mod_tree_root {
> + struct latch_tree_root root;
> + unsigned long addr_min;
> + unsigned long addr_max;
> +} mod_tree __cacheline_aligned = {
> + .addr_min = -1UL,
> +};
> +
> +#define module_addr_min mod_tree.addr_min
> +#define module_addr_max mod_tree.addr_max

> #else /* !(PERF_EVENTS || TRACING) */
>
> +/*
> + * Bounds of module allocation, for speeding up __module_address.
> + * Protected by module_mutex.
> + */
> +static unsigned long module_addr_min = -1UL, module_addr_max = 0;

I suspect the same .data vs. .bss problem affects the #else branch as
well?

If so then it would make sense IMHO to put the structure definition
into generic code so that both variants benefit from the shared
cacheline?

Thanks,

Ingo


\
 
 \ /
  Last update: 2015-04-13 19:21    [W:0.270 / U:3.500 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site