(dest, src, num)
| 397821 | return ret|0; |
| 397822 | } |
| 397823 | function _memmove(dest, src, num) { |
| 397824 | dest = dest|0; src = src|0; num = num|0; |
| 397825 | var ret = 0; |
| 397826 | if (((src|0) < (dest|0)) & ((dest|0) < ((src + num)|0))) { |
| 397827 | // Unlikely case: Copy backwards in a safe manner |
| 397828 | ret = dest; |
| 397829 | src = (src + num)|0; |
| 397830 | dest = (dest + num)|0; |
| 397831 | while ((num|0) > 0) { |
| 397832 | dest = (dest - 1)|0; |
| 397833 | src = (src - 1)|0; |
| 397834 | num = (num - 1)|0; |
| 397835 | HEAP8[((dest)>>0)]=((HEAP8[((src)>>0)])|0); |
| 397836 | } |
| 397837 | dest = ret; |
| 397838 | } else { |
| 397839 | _memcpy(dest, src, num) | 0; |
| 397840 | } |
| 397841 | return dest | 0; |
| 397842 | } |
| 397843 | function _memset(ptr, value, num) { |
| 397844 | ptr = ptr|0; value = value|0; num = num|0; |
| 397845 | var end = 0, aligned_end = 0, block_aligned_end = 0, value4 = 0; |
no test coverage detected
searching dependent graphs…