linux-kernel - Re: Proposal: make RAID6 code optional

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Date:	Wed, 22 Apr 2009 11:39:19 -0700
From:	"H. Peter Anvin" <hpa@...or.com>
To:	Andre Noll <maan@...temlinux.org>
CC:	Bill Davidsen <davidsen@....com>,
	Matti Aarnio <matti.aarnio@...iler.org>,
	Jesper Juhl <jj@...osbits.net>,
	Prakash Punnoor <prakash@...noor.de>,
	Michael Tokarev <mjt@....msk.ru>, linux-kernel@...r.kernel.org,
	linux-raid@...r.kernel.org, neilb@...e.de
Subject: Re: Proposal: make RAID6 code optional

Andre Noll wrote:
> On 10:23, H. Peter Anvin wrote:
> 
>> We could use vmalloc() and generate the tables at initialization time.
>> However, having a separate module which exports the raid6 declaration
>> and uses the raid5 module as a subroutine library seems easier.
> 
> Really? Easier than keeping only two 256-byte arrays for exp() and
> log() and use these at runtime to populate the (dynamically allocated)
> 64K GF multiplication table? That seems to be really simple and would
> still shave off 64K of kernel memory for raid5-only users.
> 

Yes, I believe it would be easier than having dynamically allocated 
arrays.  Dynamically generated arrays using static memory allocations 
(bss) is one thing, but that would only reduce size of the module on 
disk, which I don't think anyone considers a problem.

	-hpa

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