linux-mips
[Top] [All Lists]

Re: [PATCH] scripts: Make sortextable handle relocations.

To: David Daney <ddaney.cavm@gmail.com>
Subject: Re: [PATCH] scripts: Make sortextable handle relocations.
From: "H. Peter Anvin" <hpa@kernel.org>
Date: Fri, 20 Apr 2012 18:38:52 -0700
Cc: Ralf Baechle <ralf@linux-mips.org>, Thomas Gleixner <tglx@linutronix.de>, Ingo Molnar <mingo@redhat.com>, x86@kernel.org, Linus Torvalds <torvalds@linux-foundation.org>, Michal Marek <mmarek@suse.cz>, linux-kernel@vger.kernel.org, linux-mips@linux-mips.org, Andrew Morton <akpm@linux-foundation.org>
In-reply-to: <4F91EEA2.8020502@zytor.com>
Organization: Linux Kernel Organization, Inc.
References: <1334961679-14562-1-git-send-email-ddaney.cavm@gmail.com> <4F91EA5B.4000803@zytor.com> <4F91EDBD.4030700@gmail.com> <4F91EEA2.8020502@zytor.com>
Sender: linux-mips-bounce@linux-mips.org
User-agent: Mozilla/5.0 (X11; Linux x86_64; rv:11.0) Gecko/20120329 Thunderbird/11.0.1
On 04/20/2012 04:17 PM, H. Peter Anvin wrote:
> On 04/20/2012 04:14 PM, David Daney wrote:
>>>
>>> I think Linus is right and the right thing to do is to switch to using
>>> relative entries in the exception table; I am currently testing a
>>> patchset to do exactly that (on x86).  It also has the benefit of making
>>> the table half the size on x86-64.  Then we can just zero out the
>>> .rel[a]__ex_table section and be done with it.
>>
>> That's fine.
>>
>> In any event we want to do build time sorting, this patch improves the
>> original sortextable, so may be worthwhile as purely a cleanup.  I
>> wanted to fix the relocation breakage, even if the eventual solution
>> needs to be somewhat different.
>>
> 
> Yes... let me finish the patchset and then you can look at what is needed.
> 
>       -hpa
> 

The patchset is finished and is in the x86/extable branch of the -tip
tree.  Any way I can convinc you to produce a patch(set) on top of that
branch?

        -hpa


<Prev in Thread] Current Thread [Next in Thread>