Mercurial > jdk8-mips64-public > hotspot / annotate
src/cpu/sparc/vm/bytes_sparc.hpp@126ea7725993 (annotated)
src/cpu/sparc/vm/bytes_sparc.hpp
Tue, 03 Aug 2010 08:13:38 -0400
- author
- bobv
- date
- Tue, 03 Aug 2010 08:13:38 -0400
- changeset 2036
- 126ea7725993
- parent 1907
- c18cbe5936b8
- child 2314
- f95d63e2154a
- permissions
- -rw-r--r--
6953477: Increase portability and flexibility of building Hotspot
Summary: A collection of portability improvements including shared code support for PPC, ARM platforms, software floating point, cross compilation support and improvements in error crash detail.
Reviewed-by: phh, never, coleenp, dholmes
| duke@435 | 1 | /* |
| trims@1907 | 2 | * Copyright (c) 1997, 2002, Oracle and/or its affiliates. All rights reserved. |
| duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| duke@435 | 4 | * |
| duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
| duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| duke@435 | 7 | * published by the Free Software Foundation. |
| duke@435 | 8 | * |
| duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| duke@435 | 13 | * accompanied this code). |
| duke@435 | 14 | * |
| duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
| duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| duke@435 | 18 | * |
| trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
| trims@1907 | 21 | * questions. |
| duke@435 | 22 | * |
| duke@435 | 23 | */ |
| duke@435 | 24 | |
| duke@435 | 25 | class Bytes: AllStatic { |
| duke@435 | 26 | public: |
| duke@435 | 27 | // Efficient reading and writing of unaligned unsigned data in platform-specific byte ordering |
| duke@435 | 28 | // Sparc needs to check for alignment. |
| duke@435 | 29 | |
| duke@435 | 30 | // can I count on address always being a pointer to an unsigned char? Yes |
| duke@435 | 31 | |
| duke@435 | 32 | // Returns true, if the byte ordering used by Java is different from the nativ byte ordering |
| duke@435 | 33 | // of the underlying machine. For example, true for Intel x86, False, for Solaris on Sparc. |
| duke@435 | 34 | static inline bool is_Java_byte_ordering_different() { return false; } |
| duke@435 | 35 | |
| duke@435 | 36 | // Thus, a swap between native and Java ordering is always a no-op: |
| duke@435 | 37 | static inline u2 swap_u2(u2 x) { return x; } |
| duke@435 | 38 | static inline u4 swap_u4(u4 x) { return x; } |
| duke@435 | 39 | static inline u8 swap_u8(u8 x) { return x; } |
| duke@435 | 40 | |
| duke@435 | 41 | static inline u2 get_native_u2(address p){ |
| duke@435 | 42 | return (intptr_t(p) & 1) == 0 |
| duke@435 | 43 | ? *(u2*)p |
| duke@435 | 44 | : ( u2(p[0]) << 8 ) |
| duke@435 | 45 | | ( u2(p[1]) ); |
| duke@435 | 46 | } |
| duke@435 | 47 | |
| duke@435 | 48 | static inline u4 get_native_u4(address p) { |
| duke@435 | 49 | switch (intptr_t(p) & 3) { |
| duke@435 | 50 | case 0: return *(u4*)p; |
| duke@435 | 51 | |
| duke@435 | 52 | case 2: return ( u4( ((u2*)p)[0] ) << 16 ) |
| duke@435 | 53 | | ( u4( ((u2*)p)[1] ) ); |
| duke@435 | 54 | |
| duke@435 | 55 | default: return ( u4(p[0]) << 24 ) |
| duke@435 | 56 | | ( u4(p[1]) << 16 ) |
| duke@435 | 57 | | ( u4(p[2]) << 8 ) |
| duke@435 | 58 | | u4(p[3]); |
| duke@435 | 59 | } |
| duke@435 | 60 | } |
| duke@435 | 61 | |
| duke@435 | 62 | static inline u8 get_native_u8(address p) { |
| duke@435 | 63 | switch (intptr_t(p) & 7) { |
| duke@435 | 64 | case 0: return *(u8*)p; |
| duke@435 | 65 | |
| duke@435 | 66 | case 4: return ( u8( ((u4*)p)[0] ) << 32 ) |
| duke@435 | 67 | | ( u8( ((u4*)p)[1] ) ); |
| duke@435 | 68 | |
| duke@435 | 69 | case 2: return ( u8( ((u2*)p)[0] ) << 48 ) |
| duke@435 | 70 | | ( u8( ((u2*)p)[1] ) << 32 ) |
| duke@435 | 71 | | ( u8( ((u2*)p)[2] ) << 16 ) |
| duke@435 | 72 | | ( u8( ((u2*)p)[3] ) ); |
| duke@435 | 73 | |
| duke@435 | 74 | default: return ( u8(p[0]) << 56 ) |
| duke@435 | 75 | | ( u8(p[1]) << 48 ) |
| duke@435 | 76 | | ( u8(p[2]) << 40 ) |
| duke@435 | 77 | | ( u8(p[3]) << 32 ) |
| duke@435 | 78 | | ( u8(p[4]) << 24 ) |
| duke@435 | 79 | | ( u8(p[5]) << 16 ) |
| duke@435 | 80 | | ( u8(p[6]) << 8 ) |
| duke@435 | 81 | | u8(p[7]); |
| duke@435 | 82 | } |
| duke@435 | 83 | } |
| duke@435 | 84 | |
| duke@435 | 85 | |
| duke@435 | 86 | |
| duke@435 | 87 | static inline void put_native_u2(address p, u2 x) { |
| duke@435 | 88 | if ( (intptr_t(p) & 1) == 0 ) *(u2*)p = x; |
| duke@435 | 89 | else { |
| duke@435 | 90 | p[0] = x >> 8; |
| duke@435 | 91 | p[1] = x; |
| duke@435 | 92 | } |
| duke@435 | 93 | } |
| duke@435 | 94 | |
| duke@435 | 95 | static inline void put_native_u4(address p, u4 x) { |
| duke@435 | 96 | switch ( intptr_t(p) & 3 ) { |
| duke@435 | 97 | case 0: *(u4*)p = x; |
| duke@435 | 98 | break; |
| duke@435 | 99 | |
| duke@435 | 100 | case 2: ((u2*)p)[0] = x >> 16; |
| duke@435 | 101 | ((u2*)p)[1] = x; |
| duke@435 | 102 | break; |
| duke@435 | 103 | |
| duke@435 | 104 | default: ((u1*)p)[0] = x >> 24; |
| duke@435 | 105 | ((u1*)p)[1] = x >> 16; |
| duke@435 | 106 | ((u1*)p)[2] = x >> 8; |
| duke@435 | 107 | ((u1*)p)[3] = x; |
| duke@435 | 108 | break; |
| duke@435 | 109 | } |
| duke@435 | 110 | } |
| duke@435 | 111 | |
| duke@435 | 112 | static inline void put_native_u8(address p, u8 x) { |
| duke@435 | 113 | switch ( intptr_t(p) & 7 ) { |
| duke@435 | 114 | case 0: *(u8*)p = x; |
| duke@435 | 115 | break; |
| duke@435 | 116 | |
| duke@435 | 117 | case 4: ((u4*)p)[0] = x >> 32; |
| duke@435 | 118 | ((u4*)p)[1] = x; |
| duke@435 | 119 | break; |
| duke@435 | 120 | |
| duke@435 | 121 | case 2: ((u2*)p)[0] = x >> 48; |
| duke@435 | 122 | ((u2*)p)[1] = x >> 32; |
| duke@435 | 123 | ((u2*)p)[2] = x >> 16; |
| duke@435 | 124 | ((u2*)p)[3] = x; |
| duke@435 | 125 | break; |
| duke@435 | 126 | |
| duke@435 | 127 | default: ((u1*)p)[0] = x >> 56; |
| duke@435 | 128 | ((u1*)p)[1] = x >> 48; |
| duke@435 | 129 | ((u1*)p)[2] = x >> 40; |
| duke@435 | 130 | ((u1*)p)[3] = x >> 32; |
| duke@435 | 131 | ((u1*)p)[4] = x >> 24; |
| duke@435 | 132 | ((u1*)p)[5] = x >> 16; |
| duke@435 | 133 | ((u1*)p)[6] = x >> 8; |
| duke@435 | 134 | ((u1*)p)[7] = x; |
| duke@435 | 135 | } |
| duke@435 | 136 | } |
| duke@435 | 137 | |
| duke@435 | 138 | |
| duke@435 | 139 | // Efficient reading and writing of unaligned unsigned data in Java byte ordering (i.e. big-endian ordering) |
| duke@435 | 140 | // (no byte-order reversal is needed since SPARC CPUs are big-endian oriented) |
| duke@435 | 141 | static inline u2 get_Java_u2(address p) { return get_native_u2(p); } |
| duke@435 | 142 | static inline u4 get_Java_u4(address p) { return get_native_u4(p); } |
| duke@435 | 143 | static inline u8 get_Java_u8(address p) { return get_native_u8(p); } |
| duke@435 | 144 | |
| duke@435 | 145 | static inline void put_Java_u2(address p, u2 x) { put_native_u2(p, x); } |
| duke@435 | 146 | static inline void put_Java_u4(address p, u4 x) { put_native_u4(p, x); } |
| duke@435 | 147 | static inline void put_Java_u8(address p, u8 x) { put_native_u8(p, x); } |
| duke@435 | 148 | }; |
| duke@435 | 149 | |
| duke@435 | 150 | //Reconciliation History |
| duke@435 | 151 | // 1.7 98/02/24 10:18:41 bytes_i486.hpp |
| duke@435 | 152 | // 1.10 98/04/08 18:47:57 bytes_i486.hpp |
| duke@435 | 153 | // 1.13 98/07/15 17:10:03 bytes_i486.hpp |
| duke@435 | 154 | // 1.14 98/08/13 10:38:23 bytes_i486.hpp |
| duke@435 | 155 | // 1.15 98/10/05 16:30:21 bytes_i486.hpp |
| duke@435 | 156 | // 1.17 99/06/22 16:37:35 bytes_i486.hpp |
| duke@435 | 157 | //End |
