Re: A question sort_main_extable()

[Peter Teoh]

Thanks Arjan.

On Fri, Nov 21, 2008 at 1:47 PM, Arjan van de Ven <arjan@xxxxxxxxxxxxx> wrote:
> On Fri, 21 Nov 2008 13:42:56 +0800
> "Peter Teoh" <htmldeveloper@xxxxxxxxx> wrote:
>
>> Inside start_kernel() there is a call to sort_main_extable().
>>
>> void sort_extable(struct exception_table_entry *start,
>>                  struct exception_table_entry *finish)
>> {
>>        sort(start, finish - start, sizeof(struct
>> exception_table_entry), cmp_ex, NULL);
>> }
>>

Sorting is one problem, possibly it is partially pre-ordered.

Another problem is memory usage.   Do you or anyone know the amount of
memory used?   In MS windows, there is an article dedicated to
explaining why bootup is quick - one of the contributing factor is
saving memory for only the necessary stuff.   Exception strings, being
rarely needed to be used, will not be loaded into memory until it is
really necessary.   At kernel compilation time, compiler will
intelligently collate all the strings together, and pushed it right to
the end of the kernel binary, avoiding unnecessary loading.   But then
it is a different architecture - as Windows allow swap-in of kernel
image during kernel runtime, unlike that of Linux Kernel - no swap-in
of kernel image at kernel runtime is allowed.

So I guessed there is no way to avoid loading in these exception
strings, even though it is really not needed......unless these can be
pushed out to a specialized kernel module, and used udevd to
dynamically load the module when needed?   Unless the size of memory
saved is substantial enough (how do you calculate that?), I don't
think it is justifiable to take these heavier path whenever strings
are needed.

-- 
Regards,
Peter Teoh
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/