Hey Luke, Thanks for the excellent questions!
The following script will launch the memcpy test in DPDK: echo -e 'memcpy_autotest\nmemcpy_perf_autotest\nquit\n' | ./x86_64-native-linuxapp-gcc/app/test -c 4 -n 4 -- -i Thanks for sharing the object code, I think it?s the Sandy Bridge version though. The rte_memcpy for Haswell is quite simple too, this is a decision based on arch difference: Haswell has significant improvements in memory hierarchy. The Sandy Bridge unaligned memcpy is large in size but it has better performance because converting unaligned loads into aligned ones is crucial for in cache memcpy on Sandy Bridge. The rep instruction is still not fast enough yet, but I can?t say much about it since I haven?t investigated it thoroughly. To my understanding memcpy optimization is all about trade-offs according to use cases and this one is for DPDK scenario (Small size, in cache: you may find quite a few with only 6 bytes or so), you can refer to the rfc for this patch. It?s not likely that one could make one that?re optimal for all scenarios. But I agree with the author of glibc memcpy on this: A program with too many memcpys is a program with design flaw. Thanks Zhihong (John) From: lukego at gmail.com [mailto:luk...@gmail.com] On Behalf Of Luke Gorrie Sent: Monday, January 26, 2015 4:03 PM To: Wang, Zhihong Cc: dev at dpdk.org; snabb-devel at googlegroups.com Subject: Re: [dpdk-dev] [PATCH 0/4] DPDK memcpy optimization On 26 January 2015 at 02:30, Wang, Zhihong <zhihong.wang at intel.com<mailto:zhihong.wang at intel.com>> wrote: Hi Luke, I?m very glad that you?re interested in this work. ? Great :). I never published any performance data, and haven?t run cachebench. We use test_memcpy_perf.c in DPDK to do the test mainly, because it?s the environment that DPDK runs. You can also find the performance comparison there with glibc. It can be launched in <target>/app/test: memcpy_perf_autotest. Could you give me a command-line example to run this please? (Sorry if this should be obvious.) Finally, inline can bring benefits based on practice, constant value unrolling for example, and for DPDK we need all possible optimization. Do we need to think about code size and potential instruction cache thrashing? For me one call to rte_memcpy compiles to 3520 instructions<https://gist.github.com/lukego/8b17a07246d999331b04> in 20KB of object code. That's more than half the size of the Haswell instruction cache (32KB) per call. glibc 2.20's memcpy_avx_unaligned<https://sourceware.org/git/?p=glibc.git;a=blob;f=sysdeps/x86_64/multiarch/memcpy-avx-unaligned.S;h=9f033f54568c3e5b6d9de9b3ba75f5be41070b92;hb=HEAD> is only 909 bytes shared/total and also seems to have basically excellent performance on Haswell. So I am concerned about the code size of rte_memcpy, especially when inlined, and meta-concerned about the nonlinear impact of nested inlined functions on both compile time and object code size. There is another issue that I am concerned about: The Intel Optimization Guide suggests that rep movs is very efficient starting in Ivy Bridge. In practice though it seems to be much slower than using vector instructions, even though it is faster than it used to be in Sandy Bridge. Is that true? This could have a substantial impact on off-the-shelf memcpy. glibc 2.20's memcpy uses movs for sizes >= 2048 and that is where performance takes a dive for me (in microbenchmarks). GCC will also emit inline string move instructions for certain constant-size memcpy calls at certain optimization levels. So I feel like I haven't yet found the right memcpy for me. and we haven't even started to look at the interesting parts like cache-coherence behaviour when sharing data between cores (vhost) and whether streaming load/store can be used to defend the state of cache lines between cores. Do I make any sense? What do I miss? Cheers, -Luke
