Wed, 15 Apr 2020 11:49:55 +0800
Merge
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * Copyright 2012, 2013 SAP AG. All rights reserved. |
aoqi@0 | 4 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 5 | * |
aoqi@0 | 6 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 7 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 8 | * published by the Free Software Foundation. |
aoqi@0 | 9 | * |
aoqi@0 | 10 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 11 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 12 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 13 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 14 | * accompanied this code). |
aoqi@0 | 15 | * |
aoqi@0 | 16 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 17 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 18 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 19 | * |
aoqi@0 | 20 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 21 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 22 | * questions. |
aoqi@0 | 23 | * |
aoqi@0 | 24 | */ |
aoqi@0 | 25 | |
aoqi@0 | 26 | #ifndef CPU_PPC_VM_COPY_PPC_HPP |
aoqi@0 | 27 | #define CPU_PPC_VM_COPY_PPC_HPP |
aoqi@0 | 28 | |
aoqi@0 | 29 | #ifndef PPC64 |
aoqi@0 | 30 | #error "copy currently only implemented for PPC64" |
aoqi@0 | 31 | #endif |
aoqi@0 | 32 | |
aoqi@0 | 33 | // Inline functions for memory copy and fill. |
aoqi@0 | 34 | |
aoqi@0 | 35 | static void pd_conjoint_words(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 36 | (void)memmove(to, from, count * HeapWordSize); |
aoqi@0 | 37 | } |
aoqi@0 | 38 | |
aoqi@0 | 39 | static void pd_disjoint_words(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 40 | switch (count) { |
aoqi@0 | 41 | case 8: to[7] = from[7]; |
aoqi@0 | 42 | case 7: to[6] = from[6]; |
aoqi@0 | 43 | case 6: to[5] = from[5]; |
aoqi@0 | 44 | case 5: to[4] = from[4]; |
aoqi@0 | 45 | case 4: to[3] = from[3]; |
aoqi@0 | 46 | case 3: to[2] = from[2]; |
aoqi@0 | 47 | case 2: to[1] = from[1]; |
aoqi@0 | 48 | case 1: to[0] = from[0]; |
aoqi@0 | 49 | case 0: break; |
aoqi@0 | 50 | default: (void)memcpy(to, from, count * HeapWordSize); |
aoqi@0 | 51 | break; |
aoqi@0 | 52 | } |
aoqi@0 | 53 | } |
aoqi@0 | 54 | |
aoqi@0 | 55 | static void pd_disjoint_words_atomic(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 56 | switch (count) { |
aoqi@0 | 57 | case 8: to[7] = from[7]; |
aoqi@0 | 58 | case 7: to[6] = from[6]; |
aoqi@0 | 59 | case 6: to[5] = from[5]; |
aoqi@0 | 60 | case 5: to[4] = from[4]; |
aoqi@0 | 61 | case 4: to[3] = from[3]; |
aoqi@0 | 62 | case 3: to[2] = from[2]; |
aoqi@0 | 63 | case 2: to[1] = from[1]; |
aoqi@0 | 64 | case 1: to[0] = from[0]; |
aoqi@0 | 65 | case 0: break; |
aoqi@0 | 66 | default: while (count-- > 0) { |
aoqi@0 | 67 | *to++ = *from++; |
aoqi@0 | 68 | } |
aoqi@0 | 69 | break; |
aoqi@0 | 70 | } |
aoqi@0 | 71 | } |
aoqi@0 | 72 | |
aoqi@0 | 73 | static void pd_aligned_conjoint_words(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 74 | (void)memmove(to, from, count * HeapWordSize); |
aoqi@0 | 75 | } |
aoqi@0 | 76 | |
aoqi@0 | 77 | static void pd_aligned_disjoint_words(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 78 | pd_disjoint_words(from, to, count); |
aoqi@0 | 79 | } |
aoqi@0 | 80 | |
aoqi@0 | 81 | static void pd_conjoint_bytes(void* from, void* to, size_t count) { |
aoqi@0 | 82 | (void)memmove(to, from, count); |
aoqi@0 | 83 | } |
aoqi@0 | 84 | |
aoqi@0 | 85 | static void pd_conjoint_bytes_atomic(void* from, void* to, size_t count) { |
aoqi@0 | 86 | (void)memmove(to, from, count); |
aoqi@0 | 87 | } |
aoqi@0 | 88 | |
aoqi@0 | 89 | // Template for atomic, element-wise copy. |
aoqi@0 | 90 | template <class T> |
aoqi@0 | 91 | static void copy_conjoint_atomic(T* from, T* to, size_t count) { |
aoqi@0 | 92 | if (from > to) { |
aoqi@0 | 93 | while (count-- > 0) { |
aoqi@0 | 94 | // Copy forwards |
aoqi@0 | 95 | *to++ = *from++; |
aoqi@0 | 96 | } |
aoqi@0 | 97 | } else { |
aoqi@0 | 98 | from += count - 1; |
aoqi@0 | 99 | to += count - 1; |
aoqi@0 | 100 | while (count-- > 0) { |
aoqi@0 | 101 | // Copy backwards |
aoqi@0 | 102 | *to-- = *from--; |
aoqi@0 | 103 | } |
aoqi@0 | 104 | } |
aoqi@0 | 105 | } |
aoqi@0 | 106 | |
aoqi@0 | 107 | static void pd_conjoint_jshorts_atomic(jshort* from, jshort* to, size_t count) { |
aoqi@0 | 108 | // TODO: contribute optimized version. |
aoqi@0 | 109 | copy_conjoint_atomic<jshort>(from, to, count); |
aoqi@0 | 110 | } |
aoqi@0 | 111 | |
aoqi@0 | 112 | static void pd_conjoint_jints_atomic(jint* from, jint* to, size_t count) { |
aoqi@0 | 113 | // TODO: contribute optimized version. |
aoqi@0 | 114 | copy_conjoint_atomic<jint>(from, to, count); |
aoqi@0 | 115 | } |
aoqi@0 | 116 | |
aoqi@0 | 117 | static void pd_conjoint_jlongs_atomic(jlong* from, jlong* to, size_t count) { |
aoqi@0 | 118 | copy_conjoint_atomic<jlong>(from, to, count); |
aoqi@0 | 119 | } |
aoqi@0 | 120 | |
aoqi@0 | 121 | static void pd_conjoint_oops_atomic(oop* from, oop* to, size_t count) { |
aoqi@0 | 122 | copy_conjoint_atomic<oop>(from, to, count); |
aoqi@0 | 123 | } |
aoqi@0 | 124 | |
aoqi@0 | 125 | static void pd_arrayof_conjoint_bytes(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 126 | pd_conjoint_bytes_atomic(from, to, count); |
aoqi@0 | 127 | } |
aoqi@0 | 128 | |
aoqi@0 | 129 | static void pd_arrayof_conjoint_jshorts(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 130 | // TODO: contribute optimized version. |
aoqi@0 | 131 | pd_conjoint_jshorts_atomic((jshort*)from, (jshort*)to, count); |
aoqi@0 | 132 | } |
aoqi@0 | 133 | |
aoqi@0 | 134 | static void pd_arrayof_conjoint_jints(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 135 | // TODO: contribute optimized version. |
aoqi@0 | 136 | pd_conjoint_jints_atomic((jint*)from, (jint*)to, count); |
aoqi@0 | 137 | } |
aoqi@0 | 138 | |
aoqi@0 | 139 | static void pd_arrayof_conjoint_jlongs(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 140 | pd_conjoint_jlongs_atomic((jlong*)from, (jlong*)to, count); |
aoqi@0 | 141 | } |
aoqi@0 | 142 | |
aoqi@0 | 143 | static void pd_arrayof_conjoint_oops(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 144 | pd_conjoint_oops_atomic((oop*)from, (oop*)to, count); |
aoqi@0 | 145 | } |
aoqi@0 | 146 | |
aoqi@0 | 147 | static void pd_fill_to_words(HeapWord* tohw, size_t count, juint value) { |
aoqi@0 | 148 | julong* to = (julong*)tohw; |
aoqi@0 | 149 | julong v = ((julong)value << 32) | value; |
aoqi@0 | 150 | while (count-- > 0) { |
aoqi@0 | 151 | *to++ = v; |
aoqi@0 | 152 | } |
aoqi@0 | 153 | } |
aoqi@0 | 154 | |
aoqi@0 | 155 | static void pd_fill_to_aligned_words(HeapWord* tohw, size_t count, juint value) { |
aoqi@0 | 156 | pd_fill_to_words(tohw, count, value); |
aoqi@0 | 157 | } |
aoqi@0 | 158 | |
aoqi@0 | 159 | static void pd_fill_to_bytes(void* to, size_t count, jubyte value) { |
aoqi@0 | 160 | (void)memset(to, value, count); |
aoqi@0 | 161 | } |
aoqi@0 | 162 | |
aoqi@0 | 163 | static void pd_zero_to_words(HeapWord* tohw, size_t count) { |
aoqi@0 | 164 | pd_fill_to_words(tohw, count, 0); |
aoqi@0 | 165 | } |
aoqi@0 | 166 | |
aoqi@0 | 167 | static void pd_zero_to_bytes(void* to, size_t count) { |
aoqi@0 | 168 | (void)memset(to, 0, count); |
aoqi@0 | 169 | } |
aoqi@0 | 170 | |
aoqi@0 | 171 | #endif // CPU_PPC_VM_COPY_PPC_HPP |