Tue, 17 Oct 2017 12:58:25 +0800
merge
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 1997, 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_BYTES_PPC_HPP |
aoqi@0 | 27 | #define CPU_PPC_VM_BYTES_PPC_HPP |
aoqi@0 | 28 | |
aoqi@0 | 29 | #include "memory/allocation.hpp" |
aoqi@0 | 30 | |
aoqi@0 | 31 | class Bytes: AllStatic { |
aoqi@0 | 32 | public: |
aoqi@0 | 33 | // Efficient reading and writing of unaligned unsigned data in platform-specific byte ordering |
aoqi@0 | 34 | // PowerPC needs to check for alignment. |
aoqi@0 | 35 | |
aoqi@0 | 36 | // Can I count on address always being a pointer to an unsigned char? Yes. |
aoqi@0 | 37 | |
aoqi@0 | 38 | #if defined(VM_LITTLE_ENDIAN) |
aoqi@0 | 39 | |
aoqi@0 | 40 | // Returns true, if the byte ordering used by Java is different from the native byte ordering |
aoqi@0 | 41 | // of the underlying machine. For example, true for Intel x86, False, for Solaris on Sparc. |
aoqi@0 | 42 | static inline bool is_Java_byte_ordering_different() { return true; } |
aoqi@0 | 43 | |
aoqi@0 | 44 | // Forward declarations of the compiler-dependent implementation |
aoqi@0 | 45 | static inline u2 swap_u2(u2 x); |
aoqi@0 | 46 | static inline u4 swap_u4(u4 x); |
aoqi@0 | 47 | static inline u8 swap_u8(u8 x); |
aoqi@0 | 48 | |
aoqi@0 | 49 | static inline u2 get_native_u2(address p) { |
aoqi@0 | 50 | return (intptr_t(p) & 1) == 0 |
aoqi@0 | 51 | ? *(u2*)p |
aoqi@0 | 52 | : ( u2(p[1]) << 8 ) |
aoqi@0 | 53 | | ( u2(p[0]) ); |
aoqi@0 | 54 | } |
aoqi@0 | 55 | |
aoqi@0 | 56 | static inline u4 get_native_u4(address p) { |
aoqi@0 | 57 | switch (intptr_t(p) & 3) { |
aoqi@0 | 58 | case 0: return *(u4*)p; |
aoqi@0 | 59 | |
aoqi@0 | 60 | case 2: return ( u4( ((u2*)p)[1] ) << 16 ) |
aoqi@0 | 61 | | ( u4( ((u2*)p)[0] ) ); |
aoqi@0 | 62 | |
aoqi@0 | 63 | default: return ( u4(p[3]) << 24 ) |
aoqi@0 | 64 | | ( u4(p[2]) << 16 ) |
aoqi@0 | 65 | | ( u4(p[1]) << 8 ) |
aoqi@0 | 66 | | u4(p[0]); |
aoqi@0 | 67 | } |
aoqi@0 | 68 | } |
aoqi@0 | 69 | |
aoqi@0 | 70 | static inline u8 get_native_u8(address p) { |
aoqi@0 | 71 | switch (intptr_t(p) & 7) { |
aoqi@0 | 72 | case 0: return *(u8*)p; |
aoqi@0 | 73 | |
aoqi@0 | 74 | case 4: return ( u8( ((u4*)p)[1] ) << 32 ) |
aoqi@0 | 75 | | ( u8( ((u4*)p)[0] ) ); |
aoqi@0 | 76 | |
aoqi@0 | 77 | case 2: return ( u8( ((u2*)p)[3] ) << 48 ) |
aoqi@0 | 78 | | ( u8( ((u2*)p)[2] ) << 32 ) |
aoqi@0 | 79 | | ( u8( ((u2*)p)[1] ) << 16 ) |
aoqi@0 | 80 | | ( u8( ((u2*)p)[0] ) ); |
aoqi@0 | 81 | |
aoqi@0 | 82 | default: return ( u8(p[7]) << 56 ) |
aoqi@0 | 83 | | ( u8(p[6]) << 48 ) |
aoqi@0 | 84 | | ( u8(p[5]) << 40 ) |
aoqi@0 | 85 | | ( u8(p[4]) << 32 ) |
aoqi@0 | 86 | | ( u8(p[3]) << 24 ) |
aoqi@0 | 87 | | ( u8(p[2]) << 16 ) |
aoqi@0 | 88 | | ( u8(p[1]) << 8 ) |
aoqi@0 | 89 | | u8(p[0]); |
aoqi@0 | 90 | } |
aoqi@0 | 91 | } |
aoqi@0 | 92 | |
aoqi@0 | 93 | |
aoqi@0 | 94 | |
aoqi@0 | 95 | static inline void put_native_u2(address p, u2 x) { |
aoqi@0 | 96 | if ( (intptr_t(p) & 1) == 0 ) *(u2*)p = x; |
aoqi@0 | 97 | else { |
aoqi@0 | 98 | p[1] = x >> 8; |
aoqi@0 | 99 | p[0] = x; |
aoqi@0 | 100 | } |
aoqi@0 | 101 | } |
aoqi@0 | 102 | |
aoqi@0 | 103 | static inline void put_native_u4(address p, u4 x) { |
aoqi@0 | 104 | switch ( intptr_t(p) & 3 ) { |
aoqi@0 | 105 | case 0: *(u4*)p = x; |
aoqi@0 | 106 | break; |
aoqi@0 | 107 | |
aoqi@0 | 108 | case 2: ((u2*)p)[1] = x >> 16; |
aoqi@0 | 109 | ((u2*)p)[0] = x; |
aoqi@0 | 110 | break; |
aoqi@0 | 111 | |
aoqi@0 | 112 | default: ((u1*)p)[3] = x >> 24; |
aoqi@0 | 113 | ((u1*)p)[2] = x >> 16; |
aoqi@0 | 114 | ((u1*)p)[1] = x >> 8; |
aoqi@0 | 115 | ((u1*)p)[0] = x; |
aoqi@0 | 116 | break; |
aoqi@0 | 117 | } |
aoqi@0 | 118 | } |
aoqi@0 | 119 | |
aoqi@0 | 120 | static inline void put_native_u8(address p, u8 x) { |
aoqi@0 | 121 | switch ( intptr_t(p) & 7 ) { |
aoqi@0 | 122 | case 0: *(u8*)p = x; |
aoqi@0 | 123 | break; |
aoqi@0 | 124 | |
aoqi@0 | 125 | case 4: ((u4*)p)[1] = x >> 32; |
aoqi@0 | 126 | ((u4*)p)[0] = x; |
aoqi@0 | 127 | break; |
aoqi@0 | 128 | |
aoqi@0 | 129 | case 2: ((u2*)p)[3] = x >> 48; |
aoqi@0 | 130 | ((u2*)p)[2] = x >> 32; |
aoqi@0 | 131 | ((u2*)p)[1] = x >> 16; |
aoqi@0 | 132 | ((u2*)p)[0] = x; |
aoqi@0 | 133 | break; |
aoqi@0 | 134 | |
aoqi@0 | 135 | default: ((u1*)p)[7] = x >> 56; |
aoqi@0 | 136 | ((u1*)p)[6] = x >> 48; |
aoqi@0 | 137 | ((u1*)p)[5] = x >> 40; |
aoqi@0 | 138 | ((u1*)p)[4] = x >> 32; |
aoqi@0 | 139 | ((u1*)p)[3] = x >> 24; |
aoqi@0 | 140 | ((u1*)p)[2] = x >> 16; |
aoqi@0 | 141 | ((u1*)p)[1] = x >> 8; |
aoqi@0 | 142 | ((u1*)p)[0] = x; |
aoqi@0 | 143 | } |
aoqi@0 | 144 | } |
aoqi@0 | 145 | |
aoqi@0 | 146 | // Efficient reading and writing of unaligned unsigned data in Java byte ordering (i.e. big-endian ordering) |
aoqi@0 | 147 | // (no byte-order reversal is needed since Power CPUs are big-endian oriented). |
aoqi@0 | 148 | static inline u2 get_Java_u2(address p) { return swap_u2(get_native_u2(p)); } |
aoqi@0 | 149 | static inline u4 get_Java_u4(address p) { return swap_u4(get_native_u4(p)); } |
aoqi@0 | 150 | static inline u8 get_Java_u8(address p) { return swap_u8(get_native_u8(p)); } |
aoqi@0 | 151 | |
aoqi@0 | 152 | static inline void put_Java_u2(address p, u2 x) { put_native_u2(p, swap_u2(x)); } |
aoqi@0 | 153 | static inline void put_Java_u4(address p, u4 x) { put_native_u4(p, swap_u4(x)); } |
aoqi@0 | 154 | static inline void put_Java_u8(address p, u8 x) { put_native_u8(p, swap_u8(x)); } |
aoqi@0 | 155 | |
aoqi@0 | 156 | #else // !defined(VM_LITTLE_ENDIAN) |
aoqi@0 | 157 | |
aoqi@0 | 158 | // Returns true, if the byte ordering used by Java is different from the nativ byte ordering |
aoqi@0 | 159 | // of the underlying machine. For example, true for Intel x86, False, for Solaris on Sparc. |
aoqi@0 | 160 | static inline bool is_Java_byte_ordering_different() { return false; } |
aoqi@0 | 161 | |
aoqi@0 | 162 | // Thus, a swap between native and Java ordering is always a no-op: |
aoqi@0 | 163 | static inline u2 swap_u2(u2 x) { return x; } |
aoqi@0 | 164 | static inline u4 swap_u4(u4 x) { return x; } |
aoqi@0 | 165 | static inline u8 swap_u8(u8 x) { return x; } |
aoqi@0 | 166 | |
aoqi@0 | 167 | static inline u2 get_native_u2(address p) { |
aoqi@0 | 168 | return (intptr_t(p) & 1) == 0 |
aoqi@0 | 169 | ? *(u2*)p |
aoqi@0 | 170 | : ( u2(p[0]) << 8 ) |
aoqi@0 | 171 | | ( u2(p[1]) ); |
aoqi@0 | 172 | } |
aoqi@0 | 173 | |
aoqi@0 | 174 | static inline u4 get_native_u4(address p) { |
aoqi@0 | 175 | switch (intptr_t(p) & 3) { |
aoqi@0 | 176 | case 0: return *(u4*)p; |
aoqi@0 | 177 | |
aoqi@0 | 178 | case 2: return ( u4( ((u2*)p)[0] ) << 16 ) |
aoqi@0 | 179 | | ( u4( ((u2*)p)[1] ) ); |
aoqi@0 | 180 | |
aoqi@0 | 181 | default: return ( u4(p[0]) << 24 ) |
aoqi@0 | 182 | | ( u4(p[1]) << 16 ) |
aoqi@0 | 183 | | ( u4(p[2]) << 8 ) |
aoqi@0 | 184 | | u4(p[3]); |
aoqi@0 | 185 | } |
aoqi@0 | 186 | } |
aoqi@0 | 187 | |
aoqi@0 | 188 | static inline u8 get_native_u8(address p) { |
aoqi@0 | 189 | switch (intptr_t(p) & 7) { |
aoqi@0 | 190 | case 0: return *(u8*)p; |
aoqi@0 | 191 | |
aoqi@0 | 192 | case 4: return ( u8( ((u4*)p)[0] ) << 32 ) |
aoqi@0 | 193 | | ( u8( ((u4*)p)[1] ) ); |
aoqi@0 | 194 | |
aoqi@0 | 195 | case 2: return ( u8( ((u2*)p)[0] ) << 48 ) |
aoqi@0 | 196 | | ( u8( ((u2*)p)[1] ) << 32 ) |
aoqi@0 | 197 | | ( u8( ((u2*)p)[2] ) << 16 ) |
aoqi@0 | 198 | | ( u8( ((u2*)p)[3] ) ); |
aoqi@0 | 199 | |
aoqi@0 | 200 | default: return ( u8(p[0]) << 56 ) |
aoqi@0 | 201 | | ( u8(p[1]) << 48 ) |
aoqi@0 | 202 | | ( u8(p[2]) << 40 ) |
aoqi@0 | 203 | | ( u8(p[3]) << 32 ) |
aoqi@0 | 204 | | ( u8(p[4]) << 24 ) |
aoqi@0 | 205 | | ( u8(p[5]) << 16 ) |
aoqi@0 | 206 | | ( u8(p[6]) << 8 ) |
aoqi@0 | 207 | | u8(p[7]); |
aoqi@0 | 208 | } |
aoqi@0 | 209 | } |
aoqi@0 | 210 | |
aoqi@0 | 211 | |
aoqi@0 | 212 | |
aoqi@0 | 213 | static inline void put_native_u2(address p, u2 x) { |
aoqi@0 | 214 | if ( (intptr_t(p) & 1) == 0 ) { *(u2*)p = x; } |
aoqi@0 | 215 | else { |
aoqi@0 | 216 | p[0] = x >> 8; |
aoqi@0 | 217 | p[1] = x; |
aoqi@0 | 218 | } |
aoqi@0 | 219 | } |
aoqi@0 | 220 | |
aoqi@0 | 221 | static inline void put_native_u4(address p, u4 x) { |
aoqi@0 | 222 | switch ( intptr_t(p) & 3 ) { |
aoqi@0 | 223 | case 0: *(u4*)p = x; |
aoqi@0 | 224 | break; |
aoqi@0 | 225 | |
aoqi@0 | 226 | case 2: ((u2*)p)[0] = x >> 16; |
aoqi@0 | 227 | ((u2*)p)[1] = x; |
aoqi@0 | 228 | break; |
aoqi@0 | 229 | |
aoqi@0 | 230 | default: ((u1*)p)[0] = x >> 24; |
aoqi@0 | 231 | ((u1*)p)[1] = x >> 16; |
aoqi@0 | 232 | ((u1*)p)[2] = x >> 8; |
aoqi@0 | 233 | ((u1*)p)[3] = x; |
aoqi@0 | 234 | break; |
aoqi@0 | 235 | } |
aoqi@0 | 236 | } |
aoqi@0 | 237 | |
aoqi@0 | 238 | static inline void put_native_u8(address p, u8 x) { |
aoqi@0 | 239 | switch ( intptr_t(p) & 7 ) { |
aoqi@0 | 240 | case 0: *(u8*)p = x; |
aoqi@0 | 241 | break; |
aoqi@0 | 242 | |
aoqi@0 | 243 | case 4: ((u4*)p)[0] = x >> 32; |
aoqi@0 | 244 | ((u4*)p)[1] = x; |
aoqi@0 | 245 | break; |
aoqi@0 | 246 | |
aoqi@0 | 247 | case 2: ((u2*)p)[0] = x >> 48; |
aoqi@0 | 248 | ((u2*)p)[1] = x >> 32; |
aoqi@0 | 249 | ((u2*)p)[2] = x >> 16; |
aoqi@0 | 250 | ((u2*)p)[3] = x; |
aoqi@0 | 251 | break; |
aoqi@0 | 252 | |
aoqi@0 | 253 | default: ((u1*)p)[0] = x >> 56; |
aoqi@0 | 254 | ((u1*)p)[1] = x >> 48; |
aoqi@0 | 255 | ((u1*)p)[2] = x >> 40; |
aoqi@0 | 256 | ((u1*)p)[3] = x >> 32; |
aoqi@0 | 257 | ((u1*)p)[4] = x >> 24; |
aoqi@0 | 258 | ((u1*)p)[5] = x >> 16; |
aoqi@0 | 259 | ((u1*)p)[6] = x >> 8; |
aoqi@0 | 260 | ((u1*)p)[7] = x; |
aoqi@0 | 261 | } |
aoqi@0 | 262 | } |
aoqi@0 | 263 | |
aoqi@0 | 264 | // Efficient reading and writing of unaligned unsigned data in Java byte ordering (i.e. big-endian ordering) |
aoqi@0 | 265 | // (no byte-order reversal is needed since Power CPUs are big-endian oriented). |
aoqi@0 | 266 | static inline u2 get_Java_u2(address p) { return get_native_u2(p); } |
aoqi@0 | 267 | static inline u4 get_Java_u4(address p) { return get_native_u4(p); } |
aoqi@0 | 268 | static inline u8 get_Java_u8(address p) { return get_native_u8(p); } |
aoqi@0 | 269 | |
aoqi@0 | 270 | static inline void put_Java_u2(address p, u2 x) { put_native_u2(p, x); } |
aoqi@0 | 271 | static inline void put_Java_u4(address p, u4 x) { put_native_u4(p, x); } |
aoqi@0 | 272 | static inline void put_Java_u8(address p, u8 x) { put_native_u8(p, x); } |
aoqi@0 | 273 | |
aoqi@0 | 274 | #endif // VM_LITTLE_ENDIAN |
aoqi@0 | 275 | }; |
aoqi@0 | 276 | |
aoqi@0 | 277 | #if defined(TARGET_OS_ARCH_linux_ppc) |
aoqi@0 | 278 | #include "bytes_linux_ppc.inline.hpp" |
aoqi@0 | 279 | #endif |
aoqi@0 | 280 | |
aoqi@0 | 281 | #endif // CPU_PPC_VM_BYTES_PPC_HPP |