Tue, 24 Jul 2018 13:22:11 +0800
#7048 added Loongson release info to hs_err crash files
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 2003, 2011, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 4 | * |
aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 7 | * published by the Free Software Foundation. |
aoqi@0 | 8 | * |
aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 13 | * accompanied this code). |
aoqi@0 | 14 | * |
aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 18 | * |
aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 21 | * questions. |
aoqi@0 | 22 | * |
aoqi@0 | 23 | */ |
aoqi@0 | 24 | |
aoqi@1 | 25 | /* |
aoqi@1 | 26 | * This file has been modified by Loongson Technology in 2015. These |
aoqi@1 | 27 | * modifications are Copyright (c) 2015 Loongson Technology, and are made |
aoqi@1 | 28 | * available on the same license terms set forth above. |
aoqi@1 | 29 | */ |
aoqi@1 | 30 | |
aoqi@0 | 31 | #ifndef SHARE_VM_UTILITIES_COPY_HPP |
aoqi@0 | 32 | #define SHARE_VM_UTILITIES_COPY_HPP |
aoqi@0 | 33 | |
aoqi@0 | 34 | #include "runtime/stubRoutines.hpp" |
aoqi@0 | 35 | |
aoqi@0 | 36 | // Assembly code for platforms that need it. |
aoqi@0 | 37 | extern "C" { |
aoqi@0 | 38 | void _Copy_conjoint_words(HeapWord* from, HeapWord* to, size_t count); |
aoqi@0 | 39 | void _Copy_disjoint_words(HeapWord* from, HeapWord* to, size_t count); |
aoqi@0 | 40 | |
aoqi@0 | 41 | void _Copy_conjoint_words_atomic(HeapWord* from, HeapWord* to, size_t count); |
aoqi@0 | 42 | void _Copy_disjoint_words_atomic(HeapWord* from, HeapWord* to, size_t count); |
aoqi@0 | 43 | |
aoqi@0 | 44 | void _Copy_aligned_conjoint_words(HeapWord* from, HeapWord* to, size_t count); |
aoqi@0 | 45 | void _Copy_aligned_disjoint_words(HeapWord* from, HeapWord* to, size_t count); |
aoqi@0 | 46 | |
aoqi@0 | 47 | void _Copy_conjoint_bytes(void* from, void* to, size_t count); |
aoqi@0 | 48 | |
aoqi@0 | 49 | void _Copy_conjoint_bytes_atomic (void* from, void* to, size_t count); |
aoqi@0 | 50 | void _Copy_conjoint_jshorts_atomic(jshort* from, jshort* to, size_t count); |
aoqi@0 | 51 | void _Copy_conjoint_jints_atomic (jint* from, jint* to, size_t count); |
aoqi@0 | 52 | void _Copy_conjoint_jlongs_atomic (jlong* from, jlong* to, size_t count); |
aoqi@0 | 53 | void _Copy_conjoint_oops_atomic (oop* from, oop* to, size_t count); |
aoqi@0 | 54 | |
aoqi@0 | 55 | void _Copy_arrayof_conjoint_bytes (HeapWord* from, HeapWord* to, size_t count); |
aoqi@0 | 56 | void _Copy_arrayof_conjoint_jshorts(HeapWord* from, HeapWord* to, size_t count); |
aoqi@0 | 57 | void _Copy_arrayof_conjoint_jints (HeapWord* from, HeapWord* to, size_t count); |
aoqi@0 | 58 | void _Copy_arrayof_conjoint_jlongs (HeapWord* from, HeapWord* to, size_t count); |
aoqi@0 | 59 | void _Copy_arrayof_conjoint_oops (HeapWord* from, HeapWord* to, size_t count); |
aoqi@0 | 60 | } |
aoqi@0 | 61 | |
aoqi@0 | 62 | class Copy : AllStatic { |
aoqi@0 | 63 | public: |
aoqi@0 | 64 | // Block copy methods have four attributes. We don't define all possibilities. |
aoqi@0 | 65 | // alignment: aligned to BytesPerLong |
aoqi@0 | 66 | // arrayof: arraycopy operation with both operands aligned on the same |
aoqi@0 | 67 | // boundary as the first element of an array of the copy unit. |
aoqi@0 | 68 | // This is currently a HeapWord boundary on all platforms, except |
aoqi@0 | 69 | // for long and double arrays, which are aligned on an 8-byte |
aoqi@0 | 70 | // boundary on all platforms. |
aoqi@0 | 71 | // arraycopy operations are implicitly atomic on each array element. |
aoqi@0 | 72 | // overlap: disjoint or conjoint. |
aoqi@0 | 73 | // copy unit: bytes or words (i.e., HeapWords) or oops (i.e., pointers). |
aoqi@0 | 74 | // atomicity: atomic or non-atomic on the copy unit. |
aoqi@0 | 75 | // |
aoqi@0 | 76 | // Names are constructed thusly: |
aoqi@0 | 77 | // |
aoqi@0 | 78 | // [ 'aligned_' | 'arrayof_' ] |
aoqi@0 | 79 | // ('conjoint_' | 'disjoint_') |
aoqi@0 | 80 | // ('words' | 'bytes' | 'jshorts' | 'jints' | 'jlongs' | 'oops') |
aoqi@0 | 81 | // [ '_atomic' ] |
aoqi@0 | 82 | // |
aoqi@0 | 83 | // Except in the arrayof case, whatever the alignment is, we assume we can copy |
aoqi@0 | 84 | // whole alignment units. E.g., if BytesPerLong is 2x word alignment, an odd |
aoqi@0 | 85 | // count may copy an extra word. In the arrayof case, we are allowed to copy |
aoqi@0 | 86 | // only the number of copy units specified. |
aoqi@0 | 87 | // |
aoqi@0 | 88 | // All callees check count for 0. |
aoqi@0 | 89 | // |
aoqi@0 | 90 | |
aoqi@0 | 91 | // HeapWords |
aoqi@0 | 92 | |
aoqi@0 | 93 | // Word-aligned words, conjoint, not atomic on each word |
aoqi@0 | 94 | static void conjoint_words(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 95 | assert_params_ok(from, to, LogHeapWordSize); |
aoqi@0 | 96 | pd_conjoint_words(from, to, count); |
aoqi@0 | 97 | } |
aoqi@0 | 98 | |
aoqi@0 | 99 | // Word-aligned words, disjoint, not atomic on each word |
aoqi@0 | 100 | static void disjoint_words(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 101 | assert_params_ok(from, to, LogHeapWordSize); |
aoqi@0 | 102 | assert_disjoint(from, to, count); |
aoqi@0 | 103 | pd_disjoint_words(from, to, count); |
aoqi@0 | 104 | } |
aoqi@0 | 105 | |
aoqi@0 | 106 | // Word-aligned words, disjoint, atomic on each word |
aoqi@0 | 107 | static void disjoint_words_atomic(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 108 | assert_params_ok(from, to, LogHeapWordSize); |
aoqi@0 | 109 | assert_disjoint(from, to, count); |
aoqi@0 | 110 | pd_disjoint_words_atomic(from, to, count); |
aoqi@0 | 111 | } |
aoqi@0 | 112 | |
aoqi@0 | 113 | // Object-aligned words, conjoint, not atomic on each word |
aoqi@0 | 114 | static void aligned_conjoint_words(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 115 | assert_params_aligned(from, to); |
aoqi@0 | 116 | pd_aligned_conjoint_words(from, to, count); |
aoqi@0 | 117 | } |
aoqi@0 | 118 | |
aoqi@0 | 119 | // Object-aligned words, disjoint, not atomic on each word |
aoqi@0 | 120 | static void aligned_disjoint_words(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 121 | assert_params_aligned(from, to); |
aoqi@0 | 122 | assert_disjoint(from, to, count); |
aoqi@0 | 123 | pd_aligned_disjoint_words(from, to, count); |
aoqi@0 | 124 | } |
aoqi@0 | 125 | |
aoqi@0 | 126 | // bytes, jshorts, jints, jlongs, oops |
aoqi@0 | 127 | |
aoqi@0 | 128 | // bytes, conjoint, not atomic on each byte (not that it matters) |
aoqi@0 | 129 | static void conjoint_jbytes(void* from, void* to, size_t count) { |
aoqi@0 | 130 | pd_conjoint_bytes(from, to, count); |
aoqi@0 | 131 | } |
aoqi@0 | 132 | |
aoqi@0 | 133 | // bytes, conjoint, atomic on each byte (not that it matters) |
aoqi@0 | 134 | static void conjoint_jbytes_atomic(void* from, void* to, size_t count) { |
aoqi@0 | 135 | pd_conjoint_bytes(from, to, count); |
aoqi@0 | 136 | } |
aoqi@0 | 137 | |
aoqi@0 | 138 | // jshorts, conjoint, atomic on each jshort |
aoqi@0 | 139 | static void conjoint_jshorts_atomic(jshort* from, jshort* to, size_t count) { |
aoqi@0 | 140 | assert_params_ok(from, to, LogBytesPerShort); |
aoqi@0 | 141 | pd_conjoint_jshorts_atomic(from, to, count); |
aoqi@0 | 142 | } |
aoqi@0 | 143 | |
aoqi@0 | 144 | // jints, conjoint, atomic on each jint |
aoqi@0 | 145 | static void conjoint_jints_atomic(jint* from, jint* to, size_t count) { |
aoqi@0 | 146 | assert_params_ok(from, to, LogBytesPerInt); |
aoqi@0 | 147 | pd_conjoint_jints_atomic(from, to, count); |
aoqi@0 | 148 | } |
aoqi@0 | 149 | |
aoqi@0 | 150 | // jlongs, conjoint, atomic on each jlong |
aoqi@0 | 151 | static void conjoint_jlongs_atomic(jlong* from, jlong* to, size_t count) { |
aoqi@0 | 152 | assert_params_ok(from, to, LogBytesPerLong); |
aoqi@0 | 153 | pd_conjoint_jlongs_atomic(from, to, count); |
aoqi@0 | 154 | } |
aoqi@0 | 155 | |
aoqi@0 | 156 | // oops, conjoint, atomic on each oop |
aoqi@0 | 157 | static void conjoint_oops_atomic(oop* from, oop* to, size_t count) { |
aoqi@0 | 158 | assert_params_ok(from, to, LogBytesPerHeapOop); |
aoqi@0 | 159 | pd_conjoint_oops_atomic(from, to, count); |
aoqi@0 | 160 | } |
aoqi@0 | 161 | |
aoqi@0 | 162 | // overloaded for UseCompressedOops |
aoqi@0 | 163 | static void conjoint_oops_atomic(narrowOop* from, narrowOop* to, size_t count) { |
aoqi@0 | 164 | assert(sizeof(narrowOop) == sizeof(jint), "this cast is wrong"); |
aoqi@0 | 165 | assert_params_ok(from, to, LogBytesPerInt); |
aoqi@0 | 166 | pd_conjoint_jints_atomic((jint*)from, (jint*)to, count); |
aoqi@0 | 167 | } |
aoqi@0 | 168 | |
aoqi@0 | 169 | // Copy a span of memory. If the span is an integral number of aligned |
aoqi@0 | 170 | // longs, words, or ints, copy those units atomically. |
aoqi@0 | 171 | // The largest atomic transfer unit is 8 bytes, or the largest power |
aoqi@0 | 172 | // of two which divides all of from, to, and size, whichever is smaller. |
aoqi@0 | 173 | static void conjoint_memory_atomic(void* from, void* to, size_t size); |
aoqi@0 | 174 | |
aoqi@0 | 175 | // bytes, conjoint array, atomic on each byte (not that it matters) |
aoqi@0 | 176 | static void arrayof_conjoint_jbytes(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 177 | pd_arrayof_conjoint_bytes(from, to, count); |
aoqi@0 | 178 | } |
aoqi@0 | 179 | |
aoqi@0 | 180 | // jshorts, conjoint array, atomic on each jshort |
aoqi@0 | 181 | static void arrayof_conjoint_jshorts(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 182 | assert_params_ok(from, to, LogBytesPerShort); |
aoqi@0 | 183 | pd_arrayof_conjoint_jshorts(from, to, count); |
aoqi@0 | 184 | } |
aoqi@0 | 185 | |
aoqi@0 | 186 | // jints, conjoint array, atomic on each jint |
aoqi@0 | 187 | static void arrayof_conjoint_jints(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 188 | assert_params_ok(from, to, LogBytesPerInt); |
aoqi@0 | 189 | pd_arrayof_conjoint_jints(from, to, count); |
aoqi@0 | 190 | } |
aoqi@0 | 191 | |
aoqi@0 | 192 | // jlongs, conjoint array, atomic on each jlong |
aoqi@0 | 193 | static void arrayof_conjoint_jlongs(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 194 | assert_params_ok(from, to, LogBytesPerLong); |
aoqi@0 | 195 | pd_arrayof_conjoint_jlongs(from, to, count); |
aoqi@0 | 196 | } |
aoqi@0 | 197 | |
aoqi@0 | 198 | // oops, conjoint array, atomic on each oop |
aoqi@0 | 199 | static void arrayof_conjoint_oops(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 200 | assert_params_ok(from, to, LogBytesPerHeapOop); |
aoqi@0 | 201 | pd_arrayof_conjoint_oops(from, to, count); |
aoqi@0 | 202 | } |
aoqi@0 | 203 | |
aoqi@0 | 204 | // Known overlap methods |
aoqi@0 | 205 | |
aoqi@0 | 206 | // Copy word-aligned words from higher to lower addresses, not atomic on each word |
aoqi@0 | 207 | inline static void conjoint_words_to_lower(HeapWord* from, HeapWord* to, size_t byte_count) { |
aoqi@0 | 208 | // byte_count is in bytes to check its alignment |
aoqi@0 | 209 | assert_params_ok(from, to, LogHeapWordSize); |
aoqi@0 | 210 | assert_byte_count_ok(byte_count, HeapWordSize); |
aoqi@0 | 211 | |
aoqi@0 | 212 | size_t count = (size_t)round_to(byte_count, HeapWordSize) >> LogHeapWordSize; |
aoqi@0 | 213 | assert(to <= from || from + count <= to, "do not overwrite source data"); |
aoqi@0 | 214 | |
aoqi@0 | 215 | while (count-- > 0) { |
aoqi@0 | 216 | *to++ = *from++; |
aoqi@0 | 217 | } |
aoqi@0 | 218 | } |
aoqi@0 | 219 | |
aoqi@0 | 220 | // Copy word-aligned words from lower to higher addresses, not atomic on each word |
aoqi@0 | 221 | inline static void conjoint_words_to_higher(HeapWord* from, HeapWord* to, size_t byte_count) { |
aoqi@0 | 222 | // byte_count is in bytes to check its alignment |
aoqi@0 | 223 | assert_params_ok(from, to, LogHeapWordSize); |
aoqi@0 | 224 | assert_byte_count_ok(byte_count, HeapWordSize); |
aoqi@0 | 225 | |
aoqi@0 | 226 | size_t count = (size_t)round_to(byte_count, HeapWordSize) >> LogHeapWordSize; |
aoqi@0 | 227 | assert(from <= to || to + count <= from, "do not overwrite source data"); |
aoqi@0 | 228 | |
aoqi@0 | 229 | from += count - 1; |
aoqi@0 | 230 | to += count - 1; |
aoqi@0 | 231 | while (count-- > 0) { |
aoqi@0 | 232 | *to-- = *from--; |
aoqi@0 | 233 | } |
aoqi@0 | 234 | } |
aoqi@0 | 235 | |
aoqi@0 | 236 | // Fill methods |
aoqi@0 | 237 | |
aoqi@0 | 238 | // Fill word-aligned words, not atomic on each word |
aoqi@0 | 239 | // set_words |
aoqi@0 | 240 | static void fill_to_words(HeapWord* to, size_t count, juint value = 0) { |
aoqi@0 | 241 | assert_params_ok(to, LogHeapWordSize); |
aoqi@0 | 242 | pd_fill_to_words(to, count, value); |
aoqi@0 | 243 | } |
aoqi@0 | 244 | |
aoqi@0 | 245 | static void fill_to_aligned_words(HeapWord* to, size_t count, juint value = 0) { |
aoqi@0 | 246 | assert_params_aligned(to); |
aoqi@0 | 247 | pd_fill_to_aligned_words(to, count, value); |
aoqi@0 | 248 | } |
aoqi@0 | 249 | |
aoqi@0 | 250 | // Fill bytes |
aoqi@0 | 251 | static void fill_to_bytes(void* to, size_t count, jubyte value = 0) { |
aoqi@0 | 252 | pd_fill_to_bytes(to, count, value); |
aoqi@0 | 253 | } |
aoqi@0 | 254 | |
aoqi@0 | 255 | // Fill a span of memory. If the span is an integral number of aligned |
aoqi@0 | 256 | // longs, words, or ints, store to those units atomically. |
aoqi@0 | 257 | // The largest atomic transfer unit is 8 bytes, or the largest power |
aoqi@0 | 258 | // of two which divides both to and size, whichever is smaller. |
aoqi@0 | 259 | static void fill_to_memory_atomic(void* to, size_t size, jubyte value = 0); |
aoqi@0 | 260 | |
aoqi@0 | 261 | // Zero-fill methods |
aoqi@0 | 262 | |
aoqi@0 | 263 | // Zero word-aligned words, not atomic on each word |
aoqi@0 | 264 | static void zero_to_words(HeapWord* to, size_t count) { |
aoqi@0 | 265 | assert_params_ok(to, LogHeapWordSize); |
aoqi@0 | 266 | pd_zero_to_words(to, count); |
aoqi@0 | 267 | } |
aoqi@0 | 268 | |
aoqi@0 | 269 | // Zero bytes |
aoqi@0 | 270 | static void zero_to_bytes(void* to, size_t count) { |
aoqi@0 | 271 | pd_zero_to_bytes(to, count); |
aoqi@0 | 272 | } |
aoqi@0 | 273 | |
aoqi@0 | 274 | private: |
aoqi@0 | 275 | static bool params_disjoint(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 276 | if (from < to) { |
aoqi@0 | 277 | return pointer_delta(to, from) >= count; |
aoqi@0 | 278 | } |
aoqi@0 | 279 | return pointer_delta(from, to) >= count; |
aoqi@0 | 280 | } |
aoqi@0 | 281 | |
aoqi@0 | 282 | // These methods raise a fatal if they detect a problem. |
aoqi@0 | 283 | |
aoqi@0 | 284 | static void assert_disjoint(HeapWord* from, HeapWord* to, size_t count) { |
aoqi@0 | 285 | #ifdef ASSERT |
aoqi@0 | 286 | if (!params_disjoint(from, to, count)) |
aoqi@0 | 287 | basic_fatal("source and dest overlap"); |
aoqi@0 | 288 | #endif |
aoqi@0 | 289 | } |
aoqi@0 | 290 | |
aoqi@0 | 291 | static void assert_params_ok(void* from, void* to, intptr_t log_align) { |
aoqi@0 | 292 | #ifdef ASSERT |
aoqi@0 | 293 | if (mask_bits((uintptr_t)from, right_n_bits(log_align)) != 0) |
aoqi@0 | 294 | basic_fatal("not aligned"); |
aoqi@0 | 295 | if (mask_bits((uintptr_t)to, right_n_bits(log_align)) != 0) |
aoqi@0 | 296 | basic_fatal("not aligned"); |
aoqi@0 | 297 | #endif |
aoqi@0 | 298 | } |
aoqi@0 | 299 | |
aoqi@0 | 300 | static void assert_params_ok(HeapWord* to, intptr_t log_align) { |
aoqi@0 | 301 | #ifdef ASSERT |
aoqi@0 | 302 | if (mask_bits((uintptr_t)to, right_n_bits(log_align)) != 0) |
aoqi@0 | 303 | basic_fatal("not word aligned"); |
aoqi@0 | 304 | #endif |
aoqi@0 | 305 | } |
aoqi@0 | 306 | static void assert_params_aligned(HeapWord* from, HeapWord* to) { |
aoqi@0 | 307 | #ifdef ASSERT |
aoqi@0 | 308 | if (mask_bits((uintptr_t)from, BytesPerLong-1) != 0) |
aoqi@0 | 309 | basic_fatal("not long aligned"); |
aoqi@0 | 310 | if (mask_bits((uintptr_t)to, BytesPerLong-1) != 0) |
aoqi@0 | 311 | basic_fatal("not long aligned"); |
aoqi@0 | 312 | #endif |
aoqi@0 | 313 | } |
aoqi@0 | 314 | |
aoqi@0 | 315 | static void assert_params_aligned(HeapWord* to) { |
aoqi@0 | 316 | #ifdef ASSERT |
aoqi@0 | 317 | if (mask_bits((uintptr_t)to, BytesPerLong-1) != 0) |
aoqi@0 | 318 | basic_fatal("not long aligned"); |
aoqi@0 | 319 | #endif |
aoqi@0 | 320 | } |
aoqi@0 | 321 | |
aoqi@0 | 322 | static void assert_byte_count_ok(size_t byte_count, size_t unit_size) { |
aoqi@0 | 323 | #ifdef ASSERT |
aoqi@0 | 324 | if ((size_t)round_to(byte_count, unit_size) != byte_count) { |
aoqi@0 | 325 | basic_fatal("byte count must be aligned"); |
aoqi@0 | 326 | } |
aoqi@0 | 327 | #endif |
aoqi@0 | 328 | } |
aoqi@0 | 329 | |
aoqi@1 | 330 | |
aoqi@1 | 331 | // SAPJVM AS 2011-09-20. Template for atomic copy. |
aoqi@1 | 332 | template <class T> static void copy_conjoint_atomic(T* from, T* to, size_t count) |
aoqi@1 | 333 | { |
aoqi@1 | 334 | if (from > to) { |
aoqi@1 | 335 | while (count-- > 0) { |
aoqi@1 | 336 | // Copy forwards |
aoqi@1 | 337 | *to++ = *from++; |
aoqi@1 | 338 | } |
aoqi@1 | 339 | } else { |
aoqi@1 | 340 | from += count - 1; |
aoqi@1 | 341 | to += count - 1; |
aoqi@1 | 342 | while (count-- > 0) { |
aoqi@1 | 343 | // Copy backwards |
aoqi@1 | 344 | *to-- = *from--; |
aoqi@1 | 345 | } |
aoqi@1 | 346 | } |
aoqi@1 | 347 | } |
aoqi@1 | 348 | |
aoqi@1 | 349 | |
aoqi@1 | 350 | |
aoqi@0 | 351 | // Platform dependent implementations of the above methods. |
aoqi@0 | 352 | #ifdef TARGET_ARCH_x86 |
aoqi@0 | 353 | # include "copy_x86.hpp" |
aoqi@0 | 354 | #endif |
aoqi@0 | 355 | #ifdef TARGET_ARCH_sparc |
aoqi@0 | 356 | # include "copy_sparc.hpp" |
aoqi@0 | 357 | #endif |
aoqi@0 | 358 | #ifdef TARGET_ARCH_zero |
aoqi@0 | 359 | # include "copy_zero.hpp" |
aoqi@0 | 360 | #endif |
aoqi@0 | 361 | #ifdef TARGET_ARCH_arm |
aoqi@0 | 362 | # include "copy_arm.hpp" |
aoqi@0 | 363 | #endif |
aoqi@0 | 364 | #ifdef TARGET_ARCH_ppc |
aoqi@0 | 365 | # include "copy_ppc.hpp" |
aoqi@0 | 366 | #endif |
aoqi@1 | 367 | #ifdef TARGET_ARCH_mips |
aoqi@1 | 368 | # include "copy_mips.hpp" |
aoqi@1 | 369 | #endif |
aoqi@1 | 370 | |
aoqi@0 | 371 | |
aoqi@0 | 372 | }; |
aoqi@0 | 373 | |
aoqi@0 | 374 | #endif // SHARE_VM_UTILITIES_COPY_HPP |