1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340
|
/*
* Copyright (c) 2006-2012. QLogic Corporation. All rights reserved.
* Copyright (c) 2003-2006, PathScale, Inc. All rights reserved.
*
* This software is available to you under a choice of one of two
* licenses. You may choose to be licensed under the terms of the GNU
* General Public License (GPL) Version 2, available from the file
* COPYING in the main directory of this source tree, or the
* OpenIB.org BSD license below:
*
* Redistribution and use in source and binary forms, with or
* without modification, are permitted provided that the following
* conditions are met:
*
* - Redistributions of source code must retain the above
* copyright notice, this list of conditions and the following
* disclaimer.
*
* - Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials
* provided with the distribution.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include <assert.h>
#include <stdlib.h>
#include <stdint.h>
#include <string.h>
/* Bug in 2.4 compiler that prevents this file from compiling.
* Hardcode memcpyo to psmi_mq_mtucpy (uses ipath_dwordcpy).
*/
#if (WORDSIZE != 64) || defined(__powerpc__) || \
(defined(__PATHCC__) && __PATHCC__ == 2 && __PATHCC_MINOR__ == 4)
extern void psmi_mq_mtucpy(void *vdest, const void *vsrc, uint32_t nchars);
void *psmi_memcpyo(void *dst, const void *src, size_t n)
{
psmi_mq_mtucpy(dst,src,n);
return dst;
}
#else
#error "psmi_memcpyo() does not use psmi_mq_mtucpy()"
#include <emmintrin.h>
#define OPTERON_L1_CACHE_BYTES 65536
#define OPTERON_L2_CACHE_BYTES 1048576
static inline size_t __memcpy_pathscale_opteron_sse2
(uint8_t *d, const uint8_t *s, size_t n) __attribute__ ((always_inline));
static inline size_t __memcpy_pathscale_opteron_sse2
(uint8_t *d, const uint8_t *s, size_t n)
{
assert(n >= 16);
/* align destination up to 16 bytes */
size_t i;
size_t align = (16 - (((uintptr_t) d) & 0xf)) & 0xf;
if (align != 0) {
for (i = 0; i < align; i++) {
d[i] = s[i];
}
d += align;
s += align;
n -= align;
}
__m128i *dp = (__m128i *) d;
__m128i const *sp = (__m128i const *) s;
if ((((uintptr_t) sp) & 0xf) == 0x0) {
/* source and destination are both 16 byte aligned */
if (n < (OPTERON_L2_CACHE_BYTES >> 2)) {
size_t count = n >> 7;
for (i = 0; i < count; i++) {
_mm_prefetch(((const char *) sp) + 512, _MM_HINT_NTA);
_mm_prefetch(((const char *) sp) + 576, _MM_HINT_NTA);
__m128i tmp0 = _mm_load_si128(sp);
__m128i tmp1 = _mm_load_si128(sp + 1);
__m128i tmp2 = _mm_load_si128(sp + 2);
__m128i tmp3 = _mm_load_si128(sp + 3);
__m128i tmp4 = _mm_load_si128(sp + 4);
__m128i tmp5 = _mm_load_si128(sp + 5);
__m128i tmp6 = _mm_load_si128(sp + 6);
__m128i tmp7 = _mm_load_si128(sp + 7);
_mm_store_si128(dp, tmp0);
_mm_store_si128(dp + 1, tmp1);
_mm_store_si128(dp + 2, tmp2);
_mm_store_si128(dp + 3, tmp3);
_mm_store_si128(dp + 4, tmp4);
_mm_store_si128(dp + 5, tmp5);
_mm_store_si128(dp + 6, tmp6);
_mm_store_si128(dp + 7, tmp7);
sp += 8;
dp += 8;
}
return align + (count << 7);
}
else {
size_t count = n >> 7;
for (i = 0; i < count; i++) {
_mm_prefetch(((const char *) sp) + 768, _MM_HINT_NTA);
_mm_prefetch(((const char *) sp) + 832, _MM_HINT_NTA);
__m128i tmp0 = _mm_load_si128(sp);
__m128i tmp1 = _mm_load_si128(sp + 1);
__m128i tmp2 = _mm_load_si128(sp + 2);
__m128i tmp3 = _mm_load_si128(sp + 3);
__m128i tmp4 = _mm_load_si128(sp + 4);
__m128i tmp5 = _mm_load_si128(sp + 5);
__m128i tmp6 = _mm_load_si128(sp + 6);
__m128i tmp7 = _mm_load_si128(sp + 7);
_mm_stream_si128(dp, tmp0);
_mm_stream_si128(dp + 1, tmp1);
_mm_stream_si128(dp + 2, tmp2);
_mm_stream_si128(dp + 3, tmp3);
_mm_stream_si128(dp + 4, tmp4);
_mm_stream_si128(dp + 5, tmp5);
_mm_stream_si128(dp + 6, tmp6);
_mm_stream_si128(dp + 7, tmp7);
sp += 8;
dp += 8;
}
return align + (count << 7);
}
}
else {
/* only destination is 16 byte aligned - use unaligned loads */
if (n < (OPTERON_L2_CACHE_BYTES >> 2)) {
size_t count = n >> 7;
for (i = 0; i < count; i++) {
_mm_prefetch(((const char *) sp) + 512, _MM_HINT_NTA);
_mm_prefetch(((const char *) sp) + 576, _MM_HINT_NTA);
__m128i tmp0 = _mm_loadu_si128(sp);
__m128i tmp1 = _mm_loadu_si128(sp + 1);
__m128i tmp2 = _mm_loadu_si128(sp + 2);
__m128i tmp3 = _mm_loadu_si128(sp + 3);
__m128i tmp4 = _mm_loadu_si128(sp + 4);
__m128i tmp5 = _mm_loadu_si128(sp + 5);
__m128i tmp6 = _mm_loadu_si128(sp + 6);
__m128i tmp7 = _mm_loadu_si128(sp + 7);
_mm_store_si128(dp, tmp0);
_mm_store_si128(dp + 1, tmp1);
_mm_store_si128(dp + 2, tmp2);
_mm_store_si128(dp + 3, tmp3);
_mm_store_si128(dp + 4, tmp4);
_mm_store_si128(dp + 5, tmp5);
_mm_store_si128(dp + 6, tmp6);
_mm_store_si128(dp + 7, tmp7);
sp += 8;
dp += 8;
}
return align + (count << 7);
}
else {
size_t count = n >> 7;
for (i = 0; i < count; i++) {
/* 2 x 64 bytes of prefetch matches 8 x 16 bytes of load/store */
/* The prefetch distance was tuned empirically */
_mm_prefetch(((const char *) sp) + 768, _MM_HINT_NTA);
_mm_prefetch(((const char *) sp) + 832, _MM_HINT_NTA);
__m128i tmp0 = _mm_loadu_si128(sp);
_mm_stream_si128(dp, tmp0);
__m128i tmp1 = _mm_loadu_si128(sp + 1);
__m128i tmp2 = _mm_loadu_si128(sp + 2);
__m128i tmp3 = _mm_loadu_si128(sp + 3);
__m128i tmp4 = _mm_loadu_si128(sp + 4);
__m128i tmp5 = _mm_loadu_si128(sp + 5);
__m128i tmp6 = _mm_loadu_si128(sp + 6);
__m128i tmp7 = _mm_loadu_si128(sp + 7);
_mm_stream_si128(dp + 1, tmp1);
_mm_stream_si128(dp + 2, tmp2);
_mm_stream_si128(dp + 3, tmp3);
_mm_stream_si128(dp + 4, tmp4);
_mm_stream_si128(dp + 5, tmp5);
_mm_stream_si128(dp + 6, tmp6);
_mm_stream_si128(dp + 7, tmp7);
sp += 8;
dp += 8;
}
return align + (count << 7);
}
}
return 0; /* unreachable */
}
void *psmi_memcpyo(void *dst, const void *src, size_t n)
{
uint8_t *d = (uint8_t *) dst;
const uint8_t *s = (uint8_t *) src;
/* Smaller copies are detected and handled first since they are
* the most latency sensitive. Larger copies can have residual
* parts left at the end that are smaller than the unrolled loop.
* I use an outer do-loop to allow these cases to loop around to
* the smaller copy code. */
do {
if (n < 16) {
switch (n) {
case 0: {
return dst;
}
case 1: {
* (uint8_t *) d = * (const uint8_t *) s;
return dst;
}
case 2: {
* (uint16_t *) d = * (const uint16_t *) s;
return dst;
}
case 4: {
* (uint32_t *) d = * (const uint32_t *) s;
return dst;
}
case 8: {
* (uint64_t *) d = * (const uint64_t *) s;
return dst;
}
default: {
if (n & 0x8) {
* (uint64_t *) d = * (const uint64_t *) s;
d += 8;
s += 8;
}
if (n & 0x4) {
* (uint32_t *) d = * (const uint32_t *) s;
d += 4;
s += 4;
}
if (n & 0x2) {
* (uint16_t *) d = * (const uint16_t *) s;
d += 2;
s += 2;
}
if (n & 0x1) {
* (uint8_t *) d = * (const uint8_t *) s;
}
return dst;
}
}
}
else if (n < 64) {
uint64_t *dp = (uint64_t *) d;
const uint64_t *sp = (const uint64_t *) s;
size_t count = n >> 3;
size_t i;
/* ideally would like to tell compiler not to unroll this loop further */
for (i = 0; i < count - 1; i += 2) {
uint64_t tmp0 = sp[i];
uint64_t tmp1 = sp[i + 1];
dp[i] = tmp0;
dp[i + 1] = tmp1;
}
size_t bytes = i << 3;
if (n == bytes) {
return dst; /* short-cut to return */
}
d += bytes;
s += bytes;
n -= bytes;
}
else if (n < OPTERON_L1_CACHE_BYTES) {
/* align destination up to 8 bytes */
size_t i;
size_t a = 8 - (((uintptr_t) d) & 0x7);
if (a != 8) {
for (i = 0; i < a; i++) {
d[i] = s[i];
}
d += a;
s += a;
n -= a;
}
uint64_t *dp = (uint64_t *) d;
const uint64_t *sp = (const uint64_t *) s;
size_t count = n >> 6;
if (count > 0) {
i = count;
do {
uint64_t tmp0 = sp[0];
uint64_t tmp1 = sp[1];
uint64_t tmp2 = sp[2];
uint64_t tmp3 = sp[3];
dp[0] = tmp0;
dp[1] = tmp1;
dp[2] = tmp2;
dp[3] = tmp3;
uint64_t tmp4 = sp[4];
uint64_t tmp5 = sp[5];
uint64_t tmp6 = sp[6];
uint64_t tmp7 = sp[7];
dp[4] = tmp4;
dp[5] = tmp5;
dp[6] = tmp6;
dp[7] = tmp7;
__asm__("lea 64(%0),%0\n" : "+r"(sp)); /* was sp += 64 */
__asm__("lea 64(%0),%0\n" : "+r"(dp)); /* was dp += 64 */
i--;
} while (i > 0);
}
size_t bytes = count << 6;
if (n == bytes) {
return dst; /* short-cut to return */
}
d += bytes;
s += bytes;
n -= bytes;
}
#if 0 /* performance of rep movsq appears to be unpredictable */
else if (n < OPTERON_L1_CACHE_BYTES) {
size_t count = n >> 3;
__asm__ ("rep movsq\n" :
"+D" (d), "+S" (s), "+c" (count) : : "memory");
size_t bytes = count << 3;
d += bytes;
s += bytes;
n -= bytes;
}
#endif
else {
size_t bytes = __memcpy_pathscale_opteron_sse2(d, s, n);
assert(bytes > 0);
d += bytes;
s += bytes;
n -= bytes;
}
} while (n > 0);
return dst;
}
#endif
|