一天一个CRT函数 memcmp

最新推荐文章于 2022-11-03 17:30:20 发布

chenyu2202863

最新推荐文章于 2022-11-03 17:30:20 发布

阅读量1.3k

点赞数

分类专栏：阶段性系列文章标签： buffer timer 汇编测试算法

本文链接：https://blog.csdn.net/chenyu2202863/article/details/5032070

版权

阶段性系列专栏收录该内容

28 篇文章 0 订阅

订阅专栏

今天接着Buffer Manipulation函数的介绍，刚开始的几个函数算法都相当简单，没有什么可比性。权当练习打字吧~咳咳~

3.memcmp/wmemcmp

实现

/****
Purpose:
       比较内存区域buf1和buf2的前uCnt个字节

Entry:
       T *buf1 - buffer1 
       T *buf2 - buffer2
       unsigned cnt - max number of bytes to search

Exit:
        < 0        buf1 小于 buf2 
        = 0        buf1 等于 buf2 
        > 0        buf1 大于 buf2 

Uses:

Exceptions:

***/
template<typename T>
inline int tMemCmp(T *pBuf1, T *pBuf2, unsigned int uCnt)
{
    while( uCnt )
    {
        if( *pBuf1++ != *pBuf2++ )
            // pBuf1[-1]、pBuf2[-1]是退回到不相等的字符处再进行比较
            return pBuf1[-1] < pBuf2[-1] ? -1 : 1;

        --uCnt;
    }

    return 0;
}

测试

volatile tChar first[]  = _T("123456789012345678901234567890123456789012345678901234567890");
volatile tChar second[] = _T("123456789012345678901234567890123456789012345678901234567890");

volatile int nArr1[] = {1, 2, 3, 5, 4, 1, 2, 3, 5, 4, 1, 2, 3, 5, 4, 1, 2, 3, 5, 4, 1, 2, 3, 5, 4, 1, 2, 3, 5, 4, 1, 2, 3, 5, 4, 1, 2, 3, 5, 4};
volatile int nArr2[] = {1, 2, 3, 5, 4, 1, 2, 3, 5, 4, 1, 2, 3, 5, 4, 1, 2, 3, 5, 4, 1, 2, 3, 5, 4, 1, 2, 3, 5, 4, 1, 2, 3, 5, 4, 1, 2, 3, 5, 3};


int result;
volatile const DWORD dwCount = 10000000;


DWORD dwLast = 0;
{
    CCYPerformance timer(dwLast);
    for(DWORD i = 0; i < dwCount; ++i)
    {
        result = memcmp((const void *)first, (const void *)second, sizeof(first) / sizeof(first[0]) );
        --result;
    }
} 
std::cout << dwLast << std::endl;


dwLast = 0;
{
    CCYPerformance timer(dwLast);
    for(DWORD i = 0; i < dwCount; ++i)
    {
        result = CY_CRT::tMemCmp( first, second, sizeof(first) / sizeof(first[0]) );
        ++result;
    }
} 
std::cout << dwLast << std::endl;