55 lines
1.2 KiB
C
55 lines
1.2 KiB
C
|
/*
|
||
|
|
*memcmp.c - compare two blocks of memory
|
||
|
|
|
||
|
|
* Copyright (c) 1985-1993, Microsoft Corporation. All rights reserved.
|
||
|
|
|
||
|
|
*Purpose:
|
||
|
|
* defines memcmp() - compare two memory blocks lexically and
|
||
|
|
* find their order.
|
||
|
|
|
||
|
|
*/
|
||
|
|
|
||
|
|
//#include "cruntime.h"
|
||
|
|
#include <string.h>
|
||
|
|
|
||
|
|
#ifdef _MSC_VER
|
||
|
|
#pragma function(memcmp)
|
||
|
|
#endif /* _MSC_VER */
|
||
|
|
|
||
|
|
/*
|
||
|
|
*int memcmp(buf1, buf2, count) - compare memory for lexical order
|
||
|
|
|
||
|
|
*Purpose:
|
||
|
|
* Compares count bytes of memory starting at buf1 and buf2
|
||
|
|
* and find if equal or which one is first in lexical order.
|
||
|
|
|
||
|
|
*Entry:
|
||
|
|
* void *buf1, *buf2 - pointers to memory sections to compare
|
||
|
|
* size_t count - length of sections to compare
|
||
|
|
|
||
|
|
*Exit:
|
||
|
|
* returns < 0 if buf1 < buf2
|
||
|
|
* returns 0 if buf1 == buf2
|
||
|
|
* returns > 0 if buf1 > buf2
|
||
|
|
|
||
|
|
*Exceptions:
|
||
|
|
|
||
|
|
*/
|
||
|
|
|
||
|
|
int __cdecl memcmp (
|
||
|
|
const void * buf1,
|
||
|
|
const void * buf2,
|
||
|
|
size_t count
|
||
|
|
)
|
||
|
|
{
|
||
|
|
if (!count)
|
||
|
|
return(0);
|
||
|
|
|
||
|
|
while ( --count && *(char *)buf1 == *(char *)buf2 ) {
|
||
|
|
buf1 = (char *)buf1 + 1;
|
||
|
|
buf2 = (char *)buf2 + 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
return( *((unsigned char *)buf1) - *((unsigned char *)buf2) );
|
||
|
|
}
|