|
|
1.1 root 1: /*-
2: * Copyright (c) 1990 The Regents of the University of California.
3: * All rights reserved.
4: *
5: * This code is derived from software contributed to Berkeley by
6: * Chris Torek.
7: *
8: * Redistribution and use in source and binary forms are permitted
9: * provided that: (1) source distributions retain this entire copyright
10: * notice and comment, and (2) distributions including binaries display
11: * the following acknowledgement: ``This product includes software
12: * developed by the University of California, Berkeley and its contributors''
13: * in the documentation or other materials provided with the distribution
14: * and in all advertising materials mentioning features or use of this
15: * software. Neither the name of the University nor the names of its
16: * contributors may be used to endorse or promote products derived
17: * from this software without specific prior written permission.
18: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
19: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
20: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
21: */
22:
23: #if defined(LIBC_SCCS) && !defined(lint)
24: static char sccsid[] = "@(#)memcmp.c 5.5 (Berkeley) 5/15/90";
25: #endif /* LIBC_SCCS and not lint */
26:
27: #include <string.h>
28: #include <sys/stdc.h>
29:
30: /*
31: * Compare memory regions.
32: */
33: int
34: memcmp(s1, s2, n)
35: const void *s1, *s2;
36: size_t n;
37: {
38: if (n != 0) {
39: register const unsigned char *p1 = s1, *p2 = s2;
40:
41: do {
42: if (*p1++ != *p2++)
43: return (*--p1 - *--p2);
44: } while (--n != 0);
45: }
46: return (0);
47: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.