lkml.org 
[lkml]   [2008]   [Jul]   [10]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
From
Date
SubjectRe: [RFC 00/15] x86_64: Optimize percpu accesses
Christoph Lameter <cl@linux-foundation.org> writes:

> 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.

First off right now reserving more than about 64KB is ridiculous. We rightly
don't have that many per cpu variables.

> 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().

???? Optimizing per_cpu seems to be the wrong path. If you want to go fast you
access the data on the cpu you start out on.
> 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.
>
> Maybe there is another way of arranging things that would allow for this?

Yes. Start with a patch that doesn't have freaky failures that can't be understood
or bisected because the patch is too big. The only reason we are having a conversation
about alternative implementations is because the current implementation has weird
random incomprehensible failures. The most likely culprit is playing with
the linker. It could be something else.

So please REFACTOR the patch that changes things to DO ONE THING PER PATCH.

Eric



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