/* $NetBSD: swabcheck.c,v 1.3 2002/07/20 08:36:25 grant Exp $ */ /*- * Copyright (c) 2001 The NetBSD Foundation, Inc. * All rights reserved. * * This code was contributed to The NetBSD Foundation by Christos Zoulas. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the NetBSD * Foundation, Inc. and its contributors. * 4. Neither the name of The NetBSD Foundation nor the names of its * contributors may be used to endorse or promote products derived * from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. */ #include #include #include #include #include #define MAXCHK 100 static void build(char *a, char *b, size_t n) { size_t i; n >>= 1; for (i = 0; i < n; i += 2) { b[i+1] = a[i] = (char)i; b[i] = a[i+1] = (char)(i+1); } for (n <<= 1; n < MAXCHK; n++) a[n] = b[n] = (char)~0; } static void dump(f, b, l) const char *f; char *b; size_t l; { printf("%s ", f); while (l--) printf("%.2x ", (unsigned char)*b++); printf("\n"); } int main(int argc, char *argv[]) { char a[MAXCHK], b[MAXCHK], r[MAXCHK]; size_t i; for (i = 0; i < MAXCHK; i += 2) { build(a, b, i); (void)memset(r, ~0, MAXCHK); swab(a, r, i); if (memcmp(b, r, MAXCHK) != 0) { warnx("pattern mismatch at %lu bytes", (unsigned long)i); dump("expect:", b, MAXCHK); dump("result:", r, MAXCHK); return 1; } } return 0; }