duke@435: /* trims@1907: * Copyright (c) 2003, 2004, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: duke@435: static void pd_conjoint_words(HeapWord* from, HeapWord* to, size_t count) { duke@435: (void)memmove(to, from, count * HeapWordSize); duke@435: } duke@435: duke@435: static void pd_disjoint_words(HeapWord* from, HeapWord* to, size_t count) { duke@435: #ifdef AMD64 duke@435: switch (count) { duke@435: case 8: to[7] = from[7]; duke@435: case 7: to[6] = from[6]; duke@435: case 6: to[5] = from[5]; duke@435: case 5: to[4] = from[4]; duke@435: case 4: to[3] = from[3]; duke@435: case 3: to[2] = from[2]; duke@435: case 2: to[1] = from[1]; duke@435: case 1: to[0] = from[0]; duke@435: case 0: break; duke@435: default: duke@435: (void)memcpy(to, from, count * HeapWordSize); duke@435: break; duke@435: } duke@435: #else duke@435: (void)memcpy(to, from, count * HeapWordSize); duke@435: #endif // AMD64 duke@435: } duke@435: duke@435: static void pd_disjoint_words_atomic(HeapWord* from, HeapWord* to, size_t count) { duke@435: switch (count) { duke@435: case 8: to[7] = from[7]; duke@435: case 7: to[6] = from[6]; duke@435: case 6: to[5] = from[5]; duke@435: case 5: to[4] = from[4]; duke@435: case 4: to[3] = from[3]; duke@435: case 3: to[2] = from[2]; duke@435: case 2: to[1] = from[1]; duke@435: case 1: to[0] = from[0]; duke@435: case 0: break; duke@435: default: while (count-- > 0) { duke@435: *to++ = *from++; duke@435: } duke@435: break; duke@435: } duke@435: } duke@435: duke@435: static void pd_aligned_conjoint_words(HeapWord* from, HeapWord* to, size_t count) { duke@435: (void)memmove(to, from, count * HeapWordSize); duke@435: } duke@435: duke@435: static void pd_aligned_disjoint_words(HeapWord* from, HeapWord* to, size_t count) { duke@435: pd_disjoint_words(from, to, count); duke@435: } duke@435: duke@435: static void pd_conjoint_bytes(void* from, void* to, size_t count) { duke@435: (void)memmove(to, from, count); duke@435: } duke@435: duke@435: static void pd_conjoint_bytes_atomic(void* from, void* to, size_t count) { duke@435: pd_conjoint_bytes(from, to, count); duke@435: } duke@435: duke@435: static void pd_conjoint_jshorts_atomic(jshort* from, jshort* to, size_t count) { duke@435: // FIXME duke@435: (void)memmove(to, from, count << LogBytesPerShort); duke@435: } duke@435: duke@435: static void pd_conjoint_jints_atomic(jint* from, jint* to, size_t count) { duke@435: // FIXME duke@435: (void)memmove(to, from, count << LogBytesPerInt); duke@435: } duke@435: duke@435: static void pd_conjoint_jlongs_atomic(jlong* from, jlong* to, size_t count) { duke@435: #ifdef AMD64 duke@435: assert(BytesPerLong == BytesPerOop, "jlongs and oops must be the same size"); duke@435: pd_conjoint_oops_atomic((oop*)from, (oop*)to, count); duke@435: #else duke@435: // Guarantee use of fild/fistp or xmm regs via some asm code, because compilers won't. duke@435: __asm { duke@435: mov eax, from; duke@435: mov edx, to; duke@435: mov ecx, count; duke@435: cmp eax, edx; duke@435: jbe downtest; duke@435: jmp uptest; duke@435: up: duke@435: fild qword ptr [eax]; duke@435: fistp qword ptr [edx]; duke@435: add eax, 8; duke@435: add edx, 8; duke@435: uptest: duke@435: sub ecx, 1; duke@435: jge up; duke@435: jmp done; duke@435: down: duke@435: fild qword ptr [eax][ecx*8]; duke@435: fistp qword ptr [edx][ecx*8]; duke@435: downtest: duke@435: sub ecx, 1; duke@435: jge down; duke@435: done:; duke@435: } duke@435: #endif // AMD64 duke@435: } duke@435: duke@435: static void pd_conjoint_oops_atomic(oop* from, oop* to, size_t count) { duke@435: // Do better than this: inline memmove body NEEDS CLEANUP duke@435: if (from > to) { duke@435: while (count-- > 0) { duke@435: // Copy forwards duke@435: *to++ = *from++; duke@435: } duke@435: } else { duke@435: from += count - 1; duke@435: to += count - 1; duke@435: while (count-- > 0) { duke@435: // Copy backwards duke@435: *to-- = *from--; duke@435: } duke@435: } duke@435: } duke@435: duke@435: static void pd_arrayof_conjoint_bytes(HeapWord* from, HeapWord* to, size_t count) { duke@435: #ifdef AMD64 duke@435: pd_conjoint_bytes_atomic(from, to, count); duke@435: #else duke@435: pd_conjoint_bytes(from, to, count); duke@435: #endif // AMD64 duke@435: } duke@435: duke@435: static void pd_arrayof_conjoint_jshorts(HeapWord* from, HeapWord* to, size_t count) { duke@435: pd_conjoint_jshorts_atomic((jshort*)from, (jshort*)to, count); duke@435: } duke@435: duke@435: static void pd_arrayof_conjoint_jints(HeapWord* from, HeapWord* to, size_t count) { duke@435: pd_conjoint_jints_atomic((jint*)from, (jint*)to, count); duke@435: } duke@435: duke@435: static void pd_arrayof_conjoint_jlongs(HeapWord* from, HeapWord* to, size_t count) { duke@435: pd_conjoint_jlongs_atomic((jlong*)from, (jlong*)to, count); duke@435: } duke@435: duke@435: static void pd_arrayof_conjoint_oops(HeapWord* from, HeapWord* to, size_t count) { duke@435: pd_conjoint_oops_atomic((oop*)from, (oop*)to, count); duke@435: }