lkml.org 
[lkml]   [2008]   [Jul]   [10]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [RFC 00/15] x86_64: Optimize percpu accesses
Christoph Lameter wrote:
> H. Peter Anvin wrote:
>
>> but there is a distinct lack of wiggle room, which can be resolved
>> either by using negative offsets, or by moving the kernel text area up a
>> bit from -2 GB.
>
> Lets say we reserve 256MB of cpu alloc space per processor.
>
> On a system with 4k processors this will result in the need for 1TB virtual address space for per cpu areas (note that there may be more processors in the future). Preferably we would calculate the address of the per cpu area by
>
> PERCPU_START_ADDRESS + PERCPU_SIZE * smp_processor_id()
>
> instead of looking it up in a table because that will save a memory access on per_cpu().

It will, but it might still be a net loss due to higher load on the TLB
(you're effectively using the TLB to do the table lookup for you.) On
the other hand, Mike points out that once we move away from fixed-sized
segments we pretty much have to use virtual addresses anyway(*).

> The first percpu area would ideally be the per cpu segment generated by the linker.
>
> How would that fit into the address map? In particular the 2G distance between code and the first per cpu area must not be violated unless we go to a zero based approach.

If with "zero-based" you mean "nonzero gs_base for the boot CPU" then
yes, you're right.

Note again that that is completely orthogonal to RIP-based versus absolute.

-hpa



\
 
 \ /
  Last update: 2008-07-10 18:43    [from the cache]
©2003-2011 Jasper Spaans