memcpy記憶體拷貝的改進與最佳化

來源:互聯網
上載者:User

代碼一:

void *memcpy( void *dest, const void *src, size_t count ){ASSERT((dest != NULL)&&(src != NULL));char *temp_dest = (char *)dest;char *temp_src = (char *)src;while(count--)                                  // 不對是否存在重疊地區進行判斷{*temp_dest++ = *temp_src++;}return dest;}

代碼二:

void* memcpy(void* dest, void* source, size_t count) {       void* ret = dest;      if (dest <= source || dest >= (source + count))       {          //Non-Overlapping Buffers         //copy from lower addresses to higher addresses         while (count --)               *dest++ = *source++;     }     else     {        //Overlapping Buffers       //copy from higher addresses to lower addresses       dest += count - 1;       source += count - 1;       while (count--)                *dest-- = *source--;l     }     return ret;   }

代碼三:

void memcpy(void* dest, const void* src, size_t n){    assert((((uintptr_t) dest | (uintptr_t) src | n) & 0x03) == 0);    uint32_t* d = (uint32_t*) dest;    const uint32_t* s = (uint32_t*) src;    n /= sizeof(uint32_t);   if (d < s) {       /* copy forward */        while (n--) {            *d++ = *s++;        }    } else {        /* copy backward */        d += n;        s += n;        while (n--) {            *--d = *--s;        }    }}

ref:http://snake-hand.iteye.com/blog/1522972

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.