{"comment":{"url":"https://api.github.com/repos/mixxxdj/mixxx/comments/9637639","html_url":"https://github.com/mixxxdj/mixxx/commit/9a15ab76350e8c5affa57b03a4fae113253b75ea#commitcomment-9637639","id":9637639,"user":{"login":"daschuer","id":1777442,"avatar_url":"https://avatars.githubusercontent.com/u/1777442?v=3","gravatar_id":"","url":"https://api.github.com/users/daschuer","html_url":"https://github.com/daschuer","followers_url":"https://api.github.com/users/daschuer/followers","following_url":"https://api.github.com/users/daschuer/following{/other_user}","gists_url":"https://api.github.com/users/daschuer/gists{/gist_id}","starred_url":"https://api.github.com/users/daschuer/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/daschuer/subscriptions","organizations_url":"https://api.github.com/users/daschuer/orgs","repos_url":"https://api.github.com/users/daschuer/repos","events_url":"https://api.github.com/users/daschuer/events{/privacy}","received_events_url":"https://api.github.com/users/daschuer/received_events","type":"User","site_admin":false},"position":null,"line":null,"path":"","commit_id":"9a15ab76350e8c5affa57b03a4fae113253b75ea","created_at":"2015-02-07T18:26:11Z","updated_at":"2015-02-07T18:26:11Z","body":"Probably it suffers the same issue memcpy does. On 32 bit Debian systems it is compiled without SSE2 support. __memcpy_sse2() is a highly optimized asm code but the vectorized for loop is nearly as fast.\r\nSo I think gcc does a good job when using the SSE2 command set. \r\nI wonder if we can vectorized functions with BLAS where gcc fails.  \r\nAn other reason that can make pure c++ code faster is inlining. If gcc can predict the size of the loop and the memory alignment it is much faster.  This is not possible if there is a jump to an external library."}}