Messages in this thread | | | Date | Thu, 3 Jun 2004 22:02:24 -0700 | From | Paul Jackson <> | Subject | Re: [PATCH] cpumask 5/10 rewrite cpumask.h - single bitmap based implementation |
| |
Dave wrote: > Is it really that hard?
Well ...
Currently we have two implementations of cpumasks. One (in the main kernel presently) provides a flexible mechanism for arch-specific optimizations and the use of alternative data types to represent cpumasks.
The other (using the patch set I just submitted to Andrew) is one size fits all generic only (except for arch specific bitmap implementations).
The generic only is quite a bit simpler - it has some 26 fewer kernel source files, and it saves sparc64 some 1144 bytes of kernel text space, as measured by Andrew.
I really don't want to go 'back' to the fancy version. If a particular architecture has specific additional needs, I'm certainly open to hearing the justifications, tradeoffs and suggestions for ways to meet those needs.
-- I won't rest till it's the best ... Programmer, Linux Scalability Paul Jackson <pj@sgi.com> 1.650.933.1373 - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |