lkml.org 
[lkml]   [2005]   [Feb]   [2]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
From
SubjectRe: [PATCH 1/8] lib/sort: Heapsort implementation of sort()
Date
Andreas Gruenbacher <agruen@suse.de> wrote:
>
> static inline void swap(void *a, void *b, int size)
> {
> if (size % sizeof(long)) {
> char t;
> do {
> t = *(char *)a;
> *(char *)a++ = *(char *)b;
> *(char *)b++ = t;
> } while (--size > 0);
> } else {
> long t;
> do {
> t = *(long *)a;
> *(long *)a = *(long *)b;
> *(long *)b = t;
> size -= sizeof(long);
> } while (size > sizeof(long));
> }
> }

What if a/b aren't aligned?
--
Visit Openswan at http://www.openswan.org/
Email: Herbert Xu ~{PmV>HI~} <herbert@gondor.apana.org.au>
Home Page: http://gondor.apana.org.au/~herbert/
PGP Key: http://gondor.apana.org.au/~herbert/pubkey.txt
-
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/

\
 
 \ /
  Last update: 2005-03-22 14:10    [W:0.134 / U:0.032 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site