Mercurial > hg > truffle
annotate src/share/vm/oops/typeArrayOop.hpp @ 2066:02895c6a2f82
7007769: VM crashes with SIGBUS writing PerfData if tmp space is full
Summary: Fill perfdata file with zeros to verify available disk space
Reviewed-by: coleenp, kamg
author | bobv |
---|---|
date | Mon, 20 Dec 2010 14:30:24 -0500 |
parents | f95d63e2154a |
children | b92c45f2bc75 |
rev | line source |
---|---|
0 | 1 /* |
1972 | 2 * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved. |
0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #ifndef SHARE_VM_OOPS_TYPEARRAYOOP_HPP |
26 #define SHARE_VM_OOPS_TYPEARRAYOOP_HPP | |
27 | |
28 #include "oops/arrayOop.hpp" | |
29 #include "oops/typeArrayKlass.hpp" | |
30 #ifdef TARGET_OS_ARCH_linux_x86 | |
31 # include "orderAccess_linux_x86.inline.hpp" | |
32 #endif | |
33 #ifdef TARGET_OS_ARCH_linux_sparc | |
34 # include "orderAccess_linux_sparc.inline.hpp" | |
35 #endif | |
36 #ifdef TARGET_OS_ARCH_linux_zero | |
37 # include "orderAccess_linux_zero.inline.hpp" | |
38 #endif | |
39 #ifdef TARGET_OS_ARCH_solaris_x86 | |
40 # include "orderAccess_solaris_x86.inline.hpp" | |
41 #endif | |
42 #ifdef TARGET_OS_ARCH_solaris_sparc | |
43 # include "orderAccess_solaris_sparc.inline.hpp" | |
44 #endif | |
45 #ifdef TARGET_OS_ARCH_windows_x86 | |
46 # include "orderAccess_windows_x86.inline.hpp" | |
47 #endif | |
48 | |
0 | 49 // A typeArrayOop is an array containing basic types (non oop elements). |
50 // It is used for arrays of {characters, singles, doubles, bytes, shorts, integers, longs} | |
51 #include <limits.h> | |
52 | |
53 class typeArrayOopDesc : public arrayOopDesc { | |
54 protected: | |
55 jchar* char_base() const { return (jchar*) base(T_CHAR); } | |
56 jboolean* bool_base() const { return (jboolean*)base(T_BOOLEAN); } | |
57 jbyte* byte_base() const { return (jbyte*) base(T_BYTE); } | |
58 jint* int_base() const { return (jint*) base(T_INT); } | |
59 jlong* long_base() const { return (jlong*) base(T_LONG); } | |
60 jshort* short_base() const { return (jshort*) base(T_SHORT); } | |
61 jfloat* float_base() const { return (jfloat*) base(T_FLOAT); } | |
62 jdouble* double_base() const { return (jdouble*) base(T_DOUBLE); } | |
63 | |
64 friend class typeArrayKlass; | |
65 | |
66 public: | |
67 jbyte* byte_at_addr(int which) const { | |
68 assert(is_within_bounds(which), "index out of bounds"); | |
69 return &byte_base()[which]; | |
70 } | |
71 | |
72 jboolean* bool_at_addr(int which) const { | |
73 assert(is_within_bounds(which), "index out of bounds"); | |
74 return &bool_base()[which]; | |
75 } | |
76 | |
77 jchar* char_at_addr(int which) const { | |
78 assert(is_within_bounds(which), "index out of bounds"); | |
79 return &char_base()[which]; | |
80 } | |
81 | |
82 jint* int_at_addr(int which) const { | |
83 assert(is_within_bounds(which), "index out of bounds"); | |
84 return &int_base()[which]; | |
85 } | |
86 | |
87 jshort* short_at_addr(int which) const { | |
88 assert(is_within_bounds(which), "index out of bounds"); | |
89 return &short_base()[which]; | |
90 } | |
91 | |
92 jushort* ushort_at_addr(int which) const { // for field descriptor arrays | |
93 assert(is_within_bounds(which), "index out of bounds"); | |
94 return (jushort*) &short_base()[which]; | |
95 } | |
96 | |
97 jlong* long_at_addr(int which) const { | |
98 assert(is_within_bounds(which), "index out of bounds"); | |
99 return &long_base()[which]; | |
100 } | |
101 | |
102 jfloat* float_at_addr(int which) const { | |
103 assert(is_within_bounds(which), "index out of bounds"); | |
104 return &float_base()[which]; | |
105 } | |
106 | |
107 jdouble* double_at_addr(int which) const { | |
108 assert(is_within_bounds(which), "index out of bounds"); | |
109 return &double_base()[which]; | |
110 } | |
111 | |
112 jbyte byte_at(int which) const { return *byte_at_addr(which); } | |
113 void byte_at_put(int which, jbyte contents) { *byte_at_addr(which) = contents; } | |
114 | |
115 jboolean bool_at(int which) const { return *bool_at_addr(which); } | |
116 void bool_at_put(int which, jboolean contents) { *bool_at_addr(which) = contents; } | |
117 | |
118 jchar char_at(int which) const { return *char_at_addr(which); } | |
119 void char_at_put(int which, jchar contents) { *char_at_addr(which) = contents; } | |
120 | |
121 jint int_at(int which) const { return *int_at_addr(which); } | |
122 void int_at_put(int which, jint contents) { *int_at_addr(which) = contents; } | |
123 | |
124 jshort short_at(int which) const { return *short_at_addr(which); } | |
125 void short_at_put(int which, jshort contents) { *short_at_addr(which) = contents; } | |
126 | |
127 jushort ushort_at(int which) const { return *ushort_at_addr(which); } | |
128 void ushort_at_put(int which, jushort contents) { *ushort_at_addr(which) = contents; } | |
129 | |
130 jlong long_at(int which) const { return *long_at_addr(which); } | |
131 void long_at_put(int which, jlong contents) { *long_at_addr(which) = contents; } | |
132 | |
133 jfloat float_at(int which) const { return *float_at_addr(which); } | |
134 void float_at_put(int which, jfloat contents) { *float_at_addr(which) = contents; } | |
135 | |
136 jdouble double_at(int which) const { return *double_at_addr(which); } | |
137 void double_at_put(int which, jdouble contents) { *double_at_addr(which) = contents; } | |
138 | |
139 jbyte byte_at_acquire(int which) const { return OrderAccess::load_acquire(byte_at_addr(which)); } | |
140 void release_byte_at_put(int which, jbyte contents) { OrderAccess::release_store(byte_at_addr(which), contents); } | |
141 | |
142 // Sizing | |
143 | |
144 // Returns the number of words necessary to hold an array of "len" | |
145 // elements each of the given "byte_size". | |
146 private: | |
147 static int object_size(int lh, int length) { | |
148 int instance_header_size = Klass::layout_helper_header_size(lh); | |
149 int element_shift = Klass::layout_helper_log2_element_size(lh); | |
150 DEBUG_ONLY(BasicType etype = Klass::layout_helper_element_type(lh)); | |
151 assert(length <= arrayOopDesc::max_array_length(etype), "no overflow"); | |
152 | |
153 julong size_in_bytes = length; | |
154 size_in_bytes <<= element_shift; | |
155 size_in_bytes += instance_header_size; | |
156 julong size_in_words = ((size_in_bytes + (HeapWordSize-1)) >> LogHeapWordSize); | |
157 assert(size_in_words <= (julong)max_jint, "no overflow"); | |
158 | |
159 return align_object_size((intptr_t)size_in_words); | |
160 } | |
161 | |
162 public: | |
163 int object_size() { | |
164 typeArrayKlass* tk = typeArrayKlass::cast(klass()); | |
165 return object_size(tk->layout_helper(), length()); | |
166 } | |
167 }; | |
1972 | 168 |
169 #endif // SHARE_VM_OOPS_TYPEARRAYOOP_HPP |