Mercurial > hg > graal-jvmci-8
annotate src/share/vm/opto/type.cpp @ 24234:ea6f94ab283b default tip
Added tag jvmci-0.36 for changeset 8128b98d4736
| author | Gilles Duboscq <gilles.m.duboscq@oracle.com> |
|---|---|
| date | Mon, 18 Sep 2017 18:49:45 +0200 |
| parents | f13e777eb255 |
| children |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 23614 | 2 * Copyright (c) 1997, 2016, 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:
1340
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1340
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:
1340
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #include "precompiled.hpp" |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
26 #include "ci/ciMethodData.hpp" |
| 1972 | 27 #include "ci/ciTypeFlow.hpp" |
| 28 #include "classfile/symbolTable.hpp" | |
| 29 #include "classfile/systemDictionary.hpp" | |
| 30 #include "compiler/compileLog.hpp" | |
| 31 #include "libadt/dict.hpp" | |
| 32 #include "memory/gcLocker.hpp" | |
| 33 #include "memory/oopFactory.hpp" | |
| 34 #include "memory/resourceArea.hpp" | |
| 35 #include "oops/instanceKlass.hpp" | |
|
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
36 #include "oops/instanceMirrorKlass.hpp" |
| 1972 | 37 #include "oops/objArrayKlass.hpp" |
| 38 #include "oops/typeArrayKlass.hpp" | |
| 39 #include "opto/matcher.hpp" | |
| 40 #include "opto/node.hpp" | |
| 41 #include "opto/opcodes.hpp" | |
| 42 #include "opto/type.hpp" | |
| 43 | |
|
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17810
diff
changeset
|
44 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC |
|
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17810
diff
changeset
|
45 |
| 0 | 46 // Portions of code courtesy of Clifford Click |
| 47 | |
| 48 // Optimization - Graph Style | |
| 49 | |
| 50 // Dictionary of types shared among compilations. | |
| 51 Dict* Type::_shared_type_dict = NULL; | |
| 52 | |
| 53 // Array which maps compiler types to Basic Types | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
54 Type::TypeInfo Type::_type_info[Type::lastype] = { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
55 { Bad, T_ILLEGAL, "bad", false, Node::NotAMachineReg, relocInfo::none }, // Bad |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
56 { Control, T_ILLEGAL, "control", false, 0, relocInfo::none }, // Control |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
57 { Bottom, T_VOID, "top", false, 0, relocInfo::none }, // Top |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
58 { Bad, T_INT, "int:", false, Op_RegI, relocInfo::none }, // Int |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
59 { Bad, T_LONG, "long:", false, Op_RegL, relocInfo::none }, // Long |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
60 { Half, T_VOID, "half", false, 0, relocInfo::none }, // Half |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
61 { Bad, T_NARROWOOP, "narrowoop:", false, Op_RegN, relocInfo::none }, // NarrowOop |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
62 { Bad, T_NARROWKLASS,"narrowklass:", false, Op_RegN, relocInfo::none }, // NarrowKlass |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
63 { Bad, T_ILLEGAL, "tuple:", false, Node::NotAMachineReg, relocInfo::none }, // Tuple |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
64 { Bad, T_ARRAY, "array:", false, Node::NotAMachineReg, relocInfo::none }, // Array |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
65 |
|
14437
15120a36272d
8028767: PPC64: (part 121): smaller shared changes needed to build C2
goetz
parents:
13014
diff
changeset
|
66 #ifdef SPARC |
|
15120a36272d
8028767: PPC64: (part 121): smaller shared changes needed to build C2
goetz
parents:
13014
diff
changeset
|
67 { Bad, T_ILLEGAL, "vectors:", false, 0, relocInfo::none }, // VectorS |
|
15120a36272d
8028767: PPC64: (part 121): smaller shared changes needed to build C2
goetz
parents:
13014
diff
changeset
|
68 { Bad, T_ILLEGAL, "vectord:", false, Op_RegD, relocInfo::none }, // VectorD |
|
15120a36272d
8028767: PPC64: (part 121): smaller shared changes needed to build C2
goetz
parents:
13014
diff
changeset
|
69 { Bad, T_ILLEGAL, "vectorx:", false, 0, relocInfo::none }, // VectorX |
|
15120a36272d
8028767: PPC64: (part 121): smaller shared changes needed to build C2
goetz
parents:
13014
diff
changeset
|
70 { Bad, T_ILLEGAL, "vectory:", false, 0, relocInfo::none }, // VectorY |
|
15120a36272d
8028767: PPC64: (part 121): smaller shared changes needed to build C2
goetz
parents:
13014
diff
changeset
|
71 #elif defined(PPC64) |
|
15120a36272d
8028767: PPC64: (part 121): smaller shared changes needed to build C2
goetz
parents:
13014
diff
changeset
|
72 { Bad, T_ILLEGAL, "vectors:", false, 0, relocInfo::none }, // VectorS |
|
15120a36272d
8028767: PPC64: (part 121): smaller shared changes needed to build C2
goetz
parents:
13014
diff
changeset
|
73 { Bad, T_ILLEGAL, "vectord:", false, Op_RegL, relocInfo::none }, // VectorD |
|
15120a36272d
8028767: PPC64: (part 121): smaller shared changes needed to build C2
goetz
parents:
13014
diff
changeset
|
74 { Bad, T_ILLEGAL, "vectorx:", false, 0, relocInfo::none }, // VectorX |
|
15120a36272d
8028767: PPC64: (part 121): smaller shared changes needed to build C2
goetz
parents:
13014
diff
changeset
|
75 { Bad, T_ILLEGAL, "vectory:", false, 0, relocInfo::none }, // VectorY |
|
15120a36272d
8028767: PPC64: (part 121): smaller shared changes needed to build C2
goetz
parents:
13014
diff
changeset
|
76 #else // all other |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
77 { Bad, T_ILLEGAL, "vectors:", false, Op_VecS, relocInfo::none }, // VectorS |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
78 { Bad, T_ILLEGAL, "vectord:", false, Op_VecD, relocInfo::none }, // VectorD |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
79 { Bad, T_ILLEGAL, "vectorx:", false, Op_VecX, relocInfo::none }, // VectorX |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
80 { Bad, T_ILLEGAL, "vectory:", false, Op_VecY, relocInfo::none }, // VectorY |
|
14437
15120a36272d
8028767: PPC64: (part 121): smaller shared changes needed to build C2
goetz
parents:
13014
diff
changeset
|
81 #endif |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
82 { Bad, T_ADDRESS, "anyptr:", false, Op_RegP, relocInfo::none }, // AnyPtr |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
83 { Bad, T_ADDRESS, "rawptr:", false, Op_RegP, relocInfo::none }, // RawPtr |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
84 { Bad, T_OBJECT, "oop:", true, Op_RegP, relocInfo::oop_type }, // OopPtr |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
85 { Bad, T_OBJECT, "inst:", true, Op_RegP, relocInfo::oop_type }, // InstPtr |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
86 { Bad, T_OBJECT, "ary:", true, Op_RegP, relocInfo::oop_type }, // AryPtr |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
87 { Bad, T_METADATA, "metadata:", false, Op_RegP, relocInfo::metadata_type }, // MetadataPtr |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
88 { Bad, T_METADATA, "klass:", false, Op_RegP, relocInfo::metadata_type }, // KlassPtr |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
89 { Bad, T_OBJECT, "func", false, 0, relocInfo::none }, // Function |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
90 { Abio, T_ILLEGAL, "abIO", false, 0, relocInfo::none }, // Abio |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
91 { Return_Address, T_ADDRESS, "return_address",false, Op_RegP, relocInfo::none }, // Return_Address |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
92 { Memory, T_ILLEGAL, "memory", false, 0, relocInfo::none }, // Memory |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
93 { FloatBot, T_FLOAT, "float_top", false, Op_RegF, relocInfo::none }, // FloatTop |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
94 { FloatCon, T_FLOAT, "ftcon:", false, Op_RegF, relocInfo::none }, // FloatCon |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
95 { FloatTop, T_FLOAT, "float", false, Op_RegF, relocInfo::none }, // FloatBot |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
96 { DoubleBot, T_DOUBLE, "double_top", false, Op_RegD, relocInfo::none }, // DoubleTop |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
97 { DoubleCon, T_DOUBLE, "dblcon:", false, Op_RegD, relocInfo::none }, // DoubleCon |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
98 { DoubleTop, T_DOUBLE, "double", false, Op_RegD, relocInfo::none }, // DoubleBot |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
99 { Top, T_ILLEGAL, "bottom", false, 0, relocInfo::none } // Bottom |
| 0 | 100 }; |
| 101 | |
| 102 // Map ideal registers (machine types) to ideal types | |
| 103 const Type *Type::mreg2type[_last_machine_leaf]; | |
| 104 | |
| 105 // Map basic types to canonical Type* pointers. | |
| 106 const Type* Type:: _const_basic_type[T_CONFLICT+1]; | |
| 107 | |
| 108 // Map basic types to constant-zero Types. | |
| 109 const Type* Type:: _zero_type[T_CONFLICT+1]; | |
| 110 | |
| 111 // Map basic types to array-body alias types. | |
| 112 const TypeAryPtr* TypeAryPtr::_array_body_type[T_CONFLICT+1]; | |
| 113 | |
| 114 //============================================================================= | |
| 115 // Convenience common pre-built types. | |
| 116 const Type *Type::ABIO; // State-of-machine only | |
| 117 const Type *Type::BOTTOM; // All values | |
| 118 const Type *Type::CONTROL; // Control only | |
| 119 const Type *Type::DOUBLE; // All doubles | |
| 120 const Type *Type::FLOAT; // All floats | |
| 121 const Type *Type::HALF; // Placeholder half of doublewide type | |
| 122 const Type *Type::MEMORY; // Abstract store only | |
| 123 const Type *Type::RETURN_ADDRESS; | |
| 124 const Type *Type::TOP; // No values in set | |
| 125 | |
| 126 //------------------------------get_const_type--------------------------- | |
| 127 const Type* Type::get_const_type(ciType* type) { | |
| 128 if (type == NULL) { | |
| 129 return NULL; | |
| 130 } else if (type->is_primitive_type()) { | |
| 131 return get_const_basic_type(type->basic_type()); | |
| 132 } else { | |
| 133 return TypeOopPtr::make_from_klass(type->as_klass()); | |
| 134 } | |
| 135 } | |
| 136 | |
| 137 //---------------------------array_element_basic_type--------------------------------- | |
| 138 // Mapping to the array element's basic type. | |
| 139 BasicType Type::array_element_basic_type() const { | |
| 140 BasicType bt = basic_type(); | |
| 141 if (bt == T_INT) { | |
| 142 if (this == TypeInt::INT) return T_INT; | |
| 143 if (this == TypeInt::CHAR) return T_CHAR; | |
| 144 if (this == TypeInt::BYTE) return T_BYTE; | |
| 145 if (this == TypeInt::BOOL) return T_BOOLEAN; | |
| 146 if (this == TypeInt::SHORT) return T_SHORT; | |
| 147 return T_VOID; | |
| 148 } | |
| 149 return bt; | |
| 150 } | |
| 151 | |
|
23849
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
152 // For two instance arrays of same dimension, return the base element types. |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
153 // Otherwise or if the arrays have different dimensions, return NULL. |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
154 void Type::get_arrays_base_elements(const Type *a1, const Type *a2, |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
155 const TypeInstPtr **e1, const TypeInstPtr **e2) { |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
156 |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
157 if (e1) *e1 = NULL; |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
158 if (e2) *e2 = NULL; |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
159 const TypeAryPtr* a1tap = (a1 == NULL) ? NULL : a1->isa_aryptr(); |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
160 const TypeAryPtr* a2tap = (a2 == NULL) ? NULL : a2->isa_aryptr(); |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
161 |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
162 if (a1tap != NULL && a2tap != NULL) { |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
163 // Handle multidimensional arrays |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
164 const TypePtr* a1tp = a1tap->elem()->make_ptr(); |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
165 const TypePtr* a2tp = a2tap->elem()->make_ptr(); |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
166 while (a1tp && a1tp->isa_aryptr() && a2tp && a2tp->isa_aryptr()) { |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
167 a1tap = a1tp->is_aryptr(); |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
168 a2tap = a2tp->is_aryptr(); |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
169 a1tp = a1tap->elem()->make_ptr(); |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
170 a2tp = a2tap->elem()->make_ptr(); |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
171 } |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
172 if (a1tp && a1tp->isa_instptr() && a2tp && a2tp->isa_instptr()) { |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
173 if (e1) *e1 = a1tp->is_instptr(); |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
174 if (e2) *e2 = a2tp->is_instptr(); |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
175 } |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
176 } |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
177 } |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
178 |
| 0 | 179 //---------------------------get_typeflow_type--------------------------------- |
| 180 // Import a type produced by ciTypeFlow. | |
| 181 const Type* Type::get_typeflow_type(ciType* type) { | |
| 182 switch (type->basic_type()) { | |
| 183 | |
| 184 case ciTypeFlow::StateVector::T_BOTTOM: | |
| 185 assert(type == ciTypeFlow::StateVector::bottom_type(), ""); | |
| 186 return Type::BOTTOM; | |
| 187 | |
| 188 case ciTypeFlow::StateVector::T_TOP: | |
| 189 assert(type == ciTypeFlow::StateVector::top_type(), ""); | |
| 190 return Type::TOP; | |
| 191 | |
| 192 case ciTypeFlow::StateVector::T_NULL: | |
| 193 assert(type == ciTypeFlow::StateVector::null_type(), ""); | |
| 194 return TypePtr::NULL_PTR; | |
| 195 | |
| 196 case ciTypeFlow::StateVector::T_LONG2: | |
| 197 // The ciTypeFlow pass pushes a long, then the half. | |
| 198 // We do the same. | |
| 199 assert(type == ciTypeFlow::StateVector::long2_type(), ""); | |
| 200 return TypeInt::TOP; | |
| 201 | |
| 202 case ciTypeFlow::StateVector::T_DOUBLE2: | |
| 203 // The ciTypeFlow pass pushes double, then the half. | |
| 204 // Our convention is the same. | |
| 205 assert(type == ciTypeFlow::StateVector::double2_type(), ""); | |
| 206 return Type::TOP; | |
| 207 | |
| 208 case T_ADDRESS: | |
| 209 assert(type->is_return_address(), ""); | |
| 210 return TypeRawPtr::make((address)(intptr_t)type->as_return_address()->bci()); | |
| 211 | |
| 212 default: | |
| 213 // make sure we did not mix up the cases: | |
| 214 assert(type != ciTypeFlow::StateVector::bottom_type(), ""); | |
| 215 assert(type != ciTypeFlow::StateVector::top_type(), ""); | |
| 216 assert(type != ciTypeFlow::StateVector::null_type(), ""); | |
| 217 assert(type != ciTypeFlow::StateVector::long2_type(), ""); | |
| 218 assert(type != ciTypeFlow::StateVector::double2_type(), ""); | |
| 219 assert(!type->is_return_address(), ""); | |
| 220 | |
| 221 return Type::get_const_type(type); | |
| 222 } | |
| 223 } | |
| 224 | |
| 225 | |
|
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
226 //-----------------------make_from_constant------------------------------------ |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
227 const Type* Type::make_from_constant(ciConstant constant, |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
228 bool require_constant, bool is_autobox_cache) { |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
229 switch (constant.basic_type()) { |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
230 case T_BOOLEAN: return TypeInt::make(constant.as_boolean()); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
231 case T_CHAR: return TypeInt::make(constant.as_char()); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
232 case T_BYTE: return TypeInt::make(constant.as_byte()); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
233 case T_SHORT: return TypeInt::make(constant.as_short()); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
234 case T_INT: return TypeInt::make(constant.as_int()); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
235 case T_LONG: return TypeLong::make(constant.as_long()); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
236 case T_FLOAT: return TypeF::make(constant.as_float()); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
237 case T_DOUBLE: return TypeD::make(constant.as_double()); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
238 case T_ARRAY: |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
239 case T_OBJECT: |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
240 { |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
241 // cases: |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
242 // can_be_constant = (oop not scavengable || ScavengeRootsInCode != 0) |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
243 // should_be_constant = (oop not scavengable || ScavengeRootsInCode >= 2) |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
244 // An oop is not scavengable if it is in the perm gen. |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
245 ciObject* oop_constant = constant.as_object(); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
246 if (oop_constant->is_null_object()) { |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
247 return Type::get_zero_type(T_OBJECT); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
248 } else if (require_constant || oop_constant->should_be_constant()) { |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
249 return TypeOopPtr::make_from_constant(oop_constant, require_constant, is_autobox_cache); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
250 } |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
251 } |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
252 } |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
253 // Fall through to failure |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
254 return NULL; |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
255 } |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
256 |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
257 |
| 0 | 258 //------------------------------make------------------------------------------- |
| 259 // Create a simple Type, with default empty symbol sets. Then hashcons it | |
| 260 // and look for an existing copy in the type dictionary. | |
| 261 const Type *Type::make( enum TYPES t ) { | |
| 262 return (new Type(t))->hashcons(); | |
| 263 } | |
| 223 | 264 |
| 0 | 265 //------------------------------cmp-------------------------------------------- |
| 266 int Type::cmp( const Type *const t1, const Type *const t2 ) { | |
| 267 if( t1->_base != t2->_base ) | |
| 268 return 1; // Missed badly | |
| 269 assert(t1 != t2 || t1->eq(t2), "eq must be reflexive"); | |
| 270 return !t1->eq(t2); // Return ZERO if equal | |
| 271 } | |
| 272 | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
273 const Type* Type::maybe_remove_speculative(bool include_speculative) const { |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
274 if (!include_speculative) { |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
275 return remove_speculative(); |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
276 } |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
277 return this; |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
278 } |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
279 |
| 0 | 280 //------------------------------hash------------------------------------------- |
| 281 int Type::uhash( const Type *const t ) { | |
| 282 return t->hash(); | |
| 283 } | |
| 284 | |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
285 #define SMALLINT ((juint)3) // a value too insignificant to consider widening |
|
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
286 |
| 0 | 287 //--------------------------Initialize_shared---------------------------------- |
| 288 void Type::Initialize_shared(Compile* current) { | |
| 289 // This method does not need to be locked because the first system | |
| 290 // compilations (stub compilations) occur serially. If they are | |
| 291 // changed to proceed in parallel, then this section will need | |
| 292 // locking. | |
| 293 | |
| 294 Arena* save = current->type_arena(); | |
| 20360 | 295 Arena* shared_type_arena = new (mtCompiler)Arena(mtCompiler); |
| 0 | 296 |
| 297 current->set_type_arena(shared_type_arena); | |
| 298 _shared_type_dict = | |
| 299 new (shared_type_arena) Dict( (CmpKey)Type::cmp, (Hash)Type::uhash, | |
| 300 shared_type_arena, 128 ); | |
| 301 current->set_type_dict(_shared_type_dict); | |
| 302 | |
| 303 // Make shared pre-built types. | |
| 304 CONTROL = make(Control); // Control only | |
| 305 TOP = make(Top); // No values in set | |
| 306 MEMORY = make(Memory); // Abstract store only | |
| 307 ABIO = make(Abio); // State-of-machine only | |
| 308 RETURN_ADDRESS=make(Return_Address); | |
| 309 FLOAT = make(FloatBot); // All floats | |
| 310 DOUBLE = make(DoubleBot); // All doubles | |
| 311 BOTTOM = make(Bottom); // Everything | |
| 312 HALF = make(Half); // Placeholder half of doublewide type | |
| 313 | |
| 314 TypeF::ZERO = TypeF::make(0.0); // Float 0 (positive zero) | |
| 315 TypeF::ONE = TypeF::make(1.0); // Float 1 | |
| 316 | |
| 317 TypeD::ZERO = TypeD::make(0.0); // Double 0 (positive zero) | |
| 318 TypeD::ONE = TypeD::make(1.0); // Double 1 | |
| 319 | |
| 320 TypeInt::MINUS_1 = TypeInt::make(-1); // -1 | |
| 321 TypeInt::ZERO = TypeInt::make( 0); // 0 | |
| 322 TypeInt::ONE = TypeInt::make( 1); // 1 | |
| 323 TypeInt::BOOL = TypeInt::make(0,1, WidenMin); // 0 or 1, FALSE or TRUE. | |
| 324 TypeInt::CC = TypeInt::make(-1, 1, WidenMin); // -1, 0 or 1, condition codes | |
| 325 TypeInt::CC_LT = TypeInt::make(-1,-1, WidenMin); // == TypeInt::MINUS_1 | |
| 326 TypeInt::CC_GT = TypeInt::make( 1, 1, WidenMin); // == TypeInt::ONE | |
| 327 TypeInt::CC_EQ = TypeInt::make( 0, 0, WidenMin); // == TypeInt::ZERO | |
| 328 TypeInt::CC_LE = TypeInt::make(-1, 0, WidenMin); | |
| 329 TypeInt::CC_GE = TypeInt::make( 0, 1, WidenMin); // == TypeInt::BOOL | |
| 330 TypeInt::BYTE = TypeInt::make(-128,127, WidenMin); // Bytes | |
| 624 | 331 TypeInt::UBYTE = TypeInt::make(0, 255, WidenMin); // Unsigned Bytes |
| 0 | 332 TypeInt::CHAR = TypeInt::make(0,65535, WidenMin); // Java chars |
| 333 TypeInt::SHORT = TypeInt::make(-32768,32767, WidenMin); // Java shorts | |
| 334 TypeInt::POS = TypeInt::make(0,max_jint, WidenMin); // Non-neg values | |
| 335 TypeInt::POS1 = TypeInt::make(1,max_jint, WidenMin); // Positive values | |
| 336 TypeInt::INT = TypeInt::make(min_jint,max_jint, WidenMax); // 32-bit integers | |
| 337 TypeInt::SYMINT = TypeInt::make(-max_jint,max_jint,WidenMin); // symmetric range | |
|
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
14383
diff
changeset
|
338 TypeInt::TYPE_DOMAIN = TypeInt::INT; |
| 0 | 339 // CmpL is overloaded both as the bytecode computation returning |
| 340 // a trinary (-1,0,+1) integer result AND as an efficient long | |
| 341 // compare returning optimizer ideal-type flags. | |
| 342 assert( TypeInt::CC_LT == TypeInt::MINUS_1, "types must match for CmpL to work" ); | |
| 343 assert( TypeInt::CC_GT == TypeInt::ONE, "types must match for CmpL to work" ); | |
| 344 assert( TypeInt::CC_EQ == TypeInt::ZERO, "types must match for CmpL to work" ); | |
| 345 assert( TypeInt::CC_GE == TypeInt::BOOL, "types must match for CmpL to work" ); | |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
346 assert( (juint)(TypeInt::CC->_hi - TypeInt::CC->_lo) <= SMALLINT, "CC is truly small"); |
| 0 | 347 |
| 348 TypeLong::MINUS_1 = TypeLong::make(-1); // -1 | |
| 349 TypeLong::ZERO = TypeLong::make( 0); // 0 | |
| 350 TypeLong::ONE = TypeLong::make( 1); // 1 | |
| 351 TypeLong::POS = TypeLong::make(0,max_jlong, WidenMin); // Non-neg values | |
| 352 TypeLong::LONG = TypeLong::make(min_jlong,max_jlong,WidenMax); // 64-bit integers | |
| 353 TypeLong::INT = TypeLong::make((jlong)min_jint,(jlong)max_jint,WidenMin); | |
| 354 TypeLong::UINT = TypeLong::make(0,(jlong)max_juint,WidenMin); | |
|
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
14383
diff
changeset
|
355 TypeLong::TYPE_DOMAIN = TypeLong::LONG; |
| 0 | 356 |
| 357 const Type **fboth =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); | |
| 358 fboth[0] = Type::CONTROL; | |
| 359 fboth[1] = Type::CONTROL; | |
| 360 TypeTuple::IFBOTH = TypeTuple::make( 2, fboth ); | |
| 361 | |
| 362 const Type **ffalse =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); | |
| 363 ffalse[0] = Type::CONTROL; | |
| 364 ffalse[1] = Type::TOP; | |
| 365 TypeTuple::IFFALSE = TypeTuple::make( 2, ffalse ); | |
| 366 | |
| 367 const Type **fneither =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); | |
| 368 fneither[0] = Type::TOP; | |
| 369 fneither[1] = Type::TOP; | |
| 370 TypeTuple::IFNEITHER = TypeTuple::make( 2, fneither ); | |
| 371 | |
| 372 const Type **ftrue =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); | |
| 373 ftrue[0] = Type::TOP; | |
| 374 ftrue[1] = Type::CONTROL; | |
| 375 TypeTuple::IFTRUE = TypeTuple::make( 2, ftrue ); | |
| 376 | |
| 377 const Type **floop =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); | |
| 378 floop[0] = Type::CONTROL; | |
| 379 floop[1] = TypeInt::INT; | |
| 380 TypeTuple::LOOPBODY = TypeTuple::make( 2, floop ); | |
| 381 | |
| 382 TypePtr::NULL_PTR= TypePtr::make( AnyPtr, TypePtr::Null, 0 ); | |
| 383 TypePtr::NOTNULL = TypePtr::make( AnyPtr, TypePtr::NotNull, OffsetBot ); | |
| 384 TypePtr::BOTTOM = TypePtr::make( AnyPtr, TypePtr::BotPTR, OffsetBot ); | |
| 385 | |
| 386 TypeRawPtr::BOTTOM = TypeRawPtr::make( TypePtr::BotPTR ); | |
| 387 TypeRawPtr::NOTNULL= TypeRawPtr::make( TypePtr::NotNull ); | |
| 388 | |
| 389 const Type **fmembar = TypeTuple::fields(0); | |
| 390 TypeTuple::MEMBAR = TypeTuple::make(TypeFunc::Parms+0, fmembar); | |
| 391 | |
| 392 const Type **fsc = (const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*)); | |
| 393 fsc[0] = TypeInt::CC; | |
| 394 fsc[1] = Type::MEMORY; | |
| 395 TypeTuple::STORECONDITIONAL = TypeTuple::make(2, fsc); | |
| 396 | |
| 397 TypeInstPtr::NOTNULL = TypeInstPtr::make(TypePtr::NotNull, current->env()->Object_klass()); | |
| 398 TypeInstPtr::BOTTOM = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass()); | |
| 399 TypeInstPtr::MIRROR = TypeInstPtr::make(TypePtr::NotNull, current->env()->Class_klass()); | |
| 400 TypeInstPtr::MARK = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), | |
| 401 false, 0, oopDesc::mark_offset_in_bytes()); | |
| 402 TypeInstPtr::KLASS = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(), | |
| 403 false, 0, oopDesc::klass_offset_in_bytes()); | |
| 12966 | 404 TypeOopPtr::BOTTOM = TypeOopPtr::make(TypePtr::BotPTR, OffsetBot, TypeOopPtr::InstanceBot, NULL); |
| 0 | 405 |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
406 TypeMetadataPtr::BOTTOM = TypeMetadataPtr::make(TypePtr::BotPTR, NULL, OffsetBot); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
407 |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
408 TypeNarrowOop::NULL_PTR = TypeNarrowOop::make( TypePtr::NULL_PTR ); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
409 TypeNarrowOop::BOTTOM = TypeNarrowOop::make( TypeInstPtr::BOTTOM ); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
410 |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
411 TypeNarrowKlass::NULL_PTR = TypeNarrowKlass::make( TypePtr::NULL_PTR ); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
412 |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
413 mreg2type[Op_Node] = Type::BOTTOM; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
414 mreg2type[Op_Set ] = 0; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
415 mreg2type[Op_RegN] = TypeNarrowOop::BOTTOM; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
416 mreg2type[Op_RegI] = TypeInt::INT; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
417 mreg2type[Op_RegP] = TypePtr::BOTTOM; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
418 mreg2type[Op_RegF] = Type::FLOAT; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
419 mreg2type[Op_RegD] = Type::DOUBLE; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
420 mreg2type[Op_RegL] = TypeLong::LONG; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
421 mreg2type[Op_RegFlags] = TypeInt::CC; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
422 |
| 1761 | 423 TypeAryPtr::RANGE = TypeAryPtr::make( TypePtr::BotPTR, TypeAry::make(Type::BOTTOM,TypeInt::POS), NULL /* current->env()->Object_klass() */, false, arrayOopDesc::length_offset_in_bytes()); |
| 163 | 424 |
| 425 TypeAryPtr::NARROWOOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeNarrowOop::BOTTOM, TypeInt::POS), NULL /*ciArrayKlass::make(o)*/, false, Type::OffsetBot); | |
| 426 | |
| 427 #ifdef _LP64 | |
| 428 if (UseCompressedOops) { | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
429 assert(TypeAryPtr::NARROWOOPS->is_ptr_to_narrowoop(), "array of narrow oops must be ptr to narrow oop"); |
| 163 | 430 TypeAryPtr::OOPS = TypeAryPtr::NARROWOOPS; |
| 431 } else | |
| 432 #endif | |
| 433 { | |
| 434 // There is no shared klass for Object[]. See note in TypeAryPtr::klass(). | |
| 435 TypeAryPtr::OOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInstPtr::BOTTOM,TypeInt::POS), NULL /*ciArrayKlass::make(o)*/, false, Type::OffsetBot); | |
| 436 } | |
| 0 | 437 TypeAryPtr::BYTES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::BYTE ,TypeInt::POS), ciTypeArrayKlass::make(T_BYTE), true, Type::OffsetBot); |
| 438 TypeAryPtr::SHORTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::SHORT ,TypeInt::POS), ciTypeArrayKlass::make(T_SHORT), true, Type::OffsetBot); | |
| 439 TypeAryPtr::CHARS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::CHAR ,TypeInt::POS), ciTypeArrayKlass::make(T_CHAR), true, Type::OffsetBot); | |
| 440 TypeAryPtr::INTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::INT ,TypeInt::POS), ciTypeArrayKlass::make(T_INT), true, Type::OffsetBot); | |
| 441 TypeAryPtr::LONGS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeLong::LONG ,TypeInt::POS), ciTypeArrayKlass::make(T_LONG), true, Type::OffsetBot); | |
| 442 TypeAryPtr::FLOATS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::FLOAT ,TypeInt::POS), ciTypeArrayKlass::make(T_FLOAT), true, Type::OffsetBot); | |
| 443 TypeAryPtr::DOUBLES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::DOUBLE ,TypeInt::POS), ciTypeArrayKlass::make(T_DOUBLE), true, Type::OffsetBot); | |
| 444 | |
| 163 | 445 // Nobody should ask _array_body_type[T_NARROWOOP]. Use NULL as assert. |
| 446 TypeAryPtr::_array_body_type[T_NARROWOOP] = NULL; | |
| 0 | 447 TypeAryPtr::_array_body_type[T_OBJECT] = TypeAryPtr::OOPS; |
| 163 | 448 TypeAryPtr::_array_body_type[T_ARRAY] = TypeAryPtr::OOPS; // arrays are stored in oop arrays |
| 0 | 449 TypeAryPtr::_array_body_type[T_BYTE] = TypeAryPtr::BYTES; |
| 450 TypeAryPtr::_array_body_type[T_BOOLEAN] = TypeAryPtr::BYTES; // boolean[] is a byte array | |
| 451 TypeAryPtr::_array_body_type[T_SHORT] = TypeAryPtr::SHORTS; | |
| 452 TypeAryPtr::_array_body_type[T_CHAR] = TypeAryPtr::CHARS; | |
| 453 TypeAryPtr::_array_body_type[T_INT] = TypeAryPtr::INTS; | |
| 454 TypeAryPtr::_array_body_type[T_LONG] = TypeAryPtr::LONGS; | |
| 455 TypeAryPtr::_array_body_type[T_FLOAT] = TypeAryPtr::FLOATS; | |
| 456 TypeAryPtr::_array_body_type[T_DOUBLE] = TypeAryPtr::DOUBLES; | |
| 457 | |
| 458 TypeKlassPtr::OBJECT = TypeKlassPtr::make( TypePtr::NotNull, current->env()->Object_klass(), 0 ); | |
| 459 TypeKlassPtr::OBJECT_OR_NULL = TypeKlassPtr::make( TypePtr::BotPTR, current->env()->Object_klass(), 0 ); | |
| 460 | |
| 461 const Type **fi2c = TypeTuple::fields(2); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
462 fi2c[TypeFunc::Parms+0] = TypeInstPtr::BOTTOM; // Method* |
| 0 | 463 fi2c[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // argument pointer |
| 464 TypeTuple::START_I2C = TypeTuple::make(TypeFunc::Parms+2, fi2c); | |
| 465 | |
| 466 const Type **intpair = TypeTuple::fields(2); | |
| 467 intpair[0] = TypeInt::INT; | |
| 468 intpair[1] = TypeInt::INT; | |
| 469 TypeTuple::INT_PAIR = TypeTuple::make(2, intpair); | |
| 470 | |
| 471 const Type **longpair = TypeTuple::fields(2); | |
| 472 longpair[0] = TypeLong::LONG; | |
| 473 longpair[1] = TypeLong::LONG; | |
| 474 TypeTuple::LONG_PAIR = TypeTuple::make(2, longpair); | |
| 475 | |
| 12323 | 476 const Type **intccpair = TypeTuple::fields(2); |
| 477 intccpair[0] = TypeInt::INT; | |
| 478 intccpair[1] = TypeInt::CC; | |
| 479 TypeTuple::INT_CC_PAIR = TypeTuple::make(2, intccpair); | |
| 480 | |
|
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
481 const Type **longccpair = TypeTuple::fields(2); |
|
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
482 longccpair[0] = TypeLong::LONG; |
|
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
483 longccpair[1] = TypeInt::CC; |
|
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
484 TypeTuple::LONG_CC_PAIR = TypeTuple::make(2, longccpair); |
|
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
485 |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
486 _const_basic_type[T_NARROWOOP] = TypeNarrowOop::BOTTOM; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
487 _const_basic_type[T_NARROWKLASS] = Type::BOTTOM; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
488 _const_basic_type[T_BOOLEAN] = TypeInt::BOOL; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
489 _const_basic_type[T_CHAR] = TypeInt::CHAR; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
490 _const_basic_type[T_BYTE] = TypeInt::BYTE; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
491 _const_basic_type[T_SHORT] = TypeInt::SHORT; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
492 _const_basic_type[T_INT] = TypeInt::INT; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
493 _const_basic_type[T_LONG] = TypeLong::LONG; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
494 _const_basic_type[T_FLOAT] = Type::FLOAT; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
495 _const_basic_type[T_DOUBLE] = Type::DOUBLE; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
496 _const_basic_type[T_OBJECT] = TypeInstPtr::BOTTOM; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
497 _const_basic_type[T_ARRAY] = TypeInstPtr::BOTTOM; // there is no separate bottom for arrays |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
498 _const_basic_type[T_VOID] = TypePtr::NULL_PTR; // reflection represents void this way |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
499 _const_basic_type[T_ADDRESS] = TypeRawPtr::BOTTOM; // both interpreter return addresses & random raw ptrs |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
500 _const_basic_type[T_CONFLICT] = Type::BOTTOM; // why not? |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
501 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
502 _zero_type[T_NARROWOOP] = TypeNarrowOop::NULL_PTR; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
503 _zero_type[T_NARROWKLASS] = TypeNarrowKlass::NULL_PTR; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
504 _zero_type[T_BOOLEAN] = TypeInt::ZERO; // false == 0 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
505 _zero_type[T_CHAR] = TypeInt::ZERO; // '\0' == 0 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
506 _zero_type[T_BYTE] = TypeInt::ZERO; // 0x00 == 0 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
507 _zero_type[T_SHORT] = TypeInt::ZERO; // 0x0000 == 0 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
508 _zero_type[T_INT] = TypeInt::ZERO; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
509 _zero_type[T_LONG] = TypeLong::ZERO; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
510 _zero_type[T_FLOAT] = TypeF::ZERO; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
511 _zero_type[T_DOUBLE] = TypeD::ZERO; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
512 _zero_type[T_OBJECT] = TypePtr::NULL_PTR; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
513 _zero_type[T_ARRAY] = TypePtr::NULL_PTR; // null array is null oop |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
514 _zero_type[T_ADDRESS] = TypePtr::NULL_PTR; // raw pointers use the same null |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
515 _zero_type[T_VOID] = Type::TOP; // the only void value is no value at all |
| 0 | 516 |
| 517 // get_zero_type() should not happen for T_CONFLICT | |
| 518 _zero_type[T_CONFLICT]= NULL; | |
| 519 | |
|
6179
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
520 // Vector predefined types, it needs initialized _const_basic_type[]. |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
521 if (Matcher::vector_size_supported(T_BYTE,4)) { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
522 TypeVect::VECTS = TypeVect::make(T_BYTE,4); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
523 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
524 if (Matcher::vector_size_supported(T_FLOAT,2)) { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
525 TypeVect::VECTD = TypeVect::make(T_FLOAT,2); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
526 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
527 if (Matcher::vector_size_supported(T_FLOAT,4)) { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
528 TypeVect::VECTX = TypeVect::make(T_FLOAT,4); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
529 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
530 if (Matcher::vector_size_supported(T_FLOAT,8)) { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
531 TypeVect::VECTY = TypeVect::make(T_FLOAT,8); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
532 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
533 mreg2type[Op_VecS] = TypeVect::VECTS; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
534 mreg2type[Op_VecD] = TypeVect::VECTD; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
535 mreg2type[Op_VecX] = TypeVect::VECTX; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
536 mreg2type[Op_VecY] = TypeVect::VECTY; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
537 |
| 0 | 538 // Restore working type arena. |
| 539 current->set_type_arena(save); | |
| 540 current->set_type_dict(NULL); | |
| 541 } | |
| 542 | |
| 543 //------------------------------Initialize------------------------------------- | |
| 544 void Type::Initialize(Compile* current) { | |
| 545 assert(current->type_arena() != NULL, "must have created type arena"); | |
| 546 | |
| 547 if (_shared_type_dict == NULL) { | |
| 548 Initialize_shared(current); | |
| 549 } | |
| 550 | |
| 551 Arena* type_arena = current->type_arena(); | |
| 552 | |
| 553 // Create the hash-cons'ing dictionary with top-level storage allocation | |
| 554 Dict *tdic = new (type_arena) Dict( (CmpKey)Type::cmp,(Hash)Type::uhash, type_arena, 128 ); | |
| 555 current->set_type_dict(tdic); | |
| 556 | |
| 557 // Transfer the shared types. | |
| 558 DictI i(_shared_type_dict); | |
| 559 for( ; i.test(); ++i ) { | |
| 560 Type* t = (Type*)i._value; | |
| 561 tdic->Insert(t,t); // New Type, insert into Type table | |
| 562 } | |
| 563 } | |
| 564 | |
| 565 //------------------------------hashcons--------------------------------------- | |
| 566 // Do the hash-cons trick. If the Type already exists in the type table, | |
| 567 // delete the current Type and return the existing Type. Otherwise stick the | |
| 568 // current Type in the Type table. | |
| 569 const Type *Type::hashcons(void) { | |
| 570 debug_only(base()); // Check the assertion in Type::base(). | |
| 571 // Look up the Type in the Type dictionary | |
| 572 Dict *tdic = type_dict(); | |
| 573 Type* old = (Type*)(tdic->Insert(this, this, false)); | |
| 574 if( old ) { // Pre-existing Type? | |
| 575 if( old != this ) // Yes, this guy is not the pre-existing? | |
| 576 delete this; // Yes, Nuke this guy | |
| 577 assert( old->_dual, "" ); | |
| 578 return old; // Return pre-existing | |
| 579 } | |
| 580 | |
| 581 // Every type has a dual (to make my lattice symmetric). | |
| 582 // Since we just discovered a new Type, compute its dual right now. | |
| 583 assert( !_dual, "" ); // No dual yet | |
| 584 _dual = xdual(); // Compute the dual | |
| 585 if( cmp(this,_dual)==0 ) { // Handle self-symmetric | |
| 586 _dual = this; | |
| 587 return this; | |
| 588 } | |
| 589 assert( !_dual->_dual, "" ); // No reverse dual yet | |
| 590 assert( !(*tdic)[_dual], "" ); // Dual not in type system either | |
| 591 // New Type, insert into Type table | |
| 592 tdic->Insert((void*)_dual,(void*)_dual); | |
| 593 ((Type*)_dual)->_dual = this; // Finish up being symmetric | |
| 594 #ifdef ASSERT | |
| 595 Type *dual_dual = (Type*)_dual->xdual(); | |
| 596 assert( eq(dual_dual), "xdual(xdual()) should be identity" ); | |
| 597 delete dual_dual; | |
| 598 #endif | |
| 599 return this; // Return new Type | |
| 600 } | |
| 601 | |
| 602 //------------------------------eq--------------------------------------------- | |
| 603 // Structural equality check for Type representations | |
| 604 bool Type::eq( const Type * ) const { | |
| 605 return true; // Nothing else can go wrong | |
| 606 } | |
| 607 | |
| 608 //------------------------------hash------------------------------------------- | |
| 609 // Type-specific hashing function. | |
| 610 int Type::hash(void) const { | |
| 611 return _base; | |
| 612 } | |
| 613 | |
| 614 //------------------------------is_finite-------------------------------------- | |
| 615 // Has a finite value | |
| 616 bool Type::is_finite() const { | |
| 617 return false; | |
| 618 } | |
| 619 | |
| 620 //------------------------------is_nan----------------------------------------- | |
| 621 // Is not a number (NaN) | |
| 622 bool Type::is_nan() const { | |
| 623 return false; | |
| 624 } | |
| 625 | |
|
820
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
626 //----------------------interface_vs_oop--------------------------------------- |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
627 #ifdef ASSERT |
| 12966 | 628 bool Type::interface_vs_oop_helper(const Type *t) const { |
|
820
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
629 bool result = false; |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
630 |
| 992 | 631 const TypePtr* this_ptr = this->make_ptr(); // In case it is narrow_oop |
| 632 const TypePtr* t_ptr = t->make_ptr(); | |
| 633 if( this_ptr == NULL || t_ptr == NULL ) | |
| 634 return result; | |
| 635 | |
| 636 const TypeInstPtr* this_inst = this_ptr->isa_instptr(); | |
| 637 const TypeInstPtr* t_inst = t_ptr->isa_instptr(); | |
|
820
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
638 if( this_inst && this_inst->is_loaded() && t_inst && t_inst->is_loaded() ) { |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
639 bool this_interface = this_inst->klass()->is_interface(); |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
640 bool t_interface = t_inst->klass()->is_interface(); |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
641 result = this_interface ^ t_interface; |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
642 } |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
643 |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
644 return result; |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
645 } |
| 12966 | 646 |
| 647 bool Type::interface_vs_oop(const Type *t) const { | |
| 648 if (interface_vs_oop_helper(t)) { | |
| 649 return true; | |
| 650 } | |
| 651 // Now check the speculative parts as well | |
| 652 const TypeOopPtr* this_spec = isa_oopptr() != NULL ? isa_oopptr()->speculative() : NULL; | |
| 653 const TypeOopPtr* t_spec = t->isa_oopptr() != NULL ? t->isa_oopptr()->speculative() : NULL; | |
| 654 if (this_spec != NULL && t_spec != NULL) { | |
| 655 if (this_spec->interface_vs_oop_helper(t_spec)) { | |
| 656 return true; | |
| 657 } | |
| 658 return false; | |
| 659 } | |
| 660 if (this_spec != NULL && this_spec->interface_vs_oop_helper(t)) { | |
| 661 return true; | |
| 662 } | |
| 663 if (t_spec != NULL && interface_vs_oop_helper(t_spec)) { | |
| 664 return true; | |
| 665 } | |
| 666 return false; | |
| 667 } | |
| 668 | |
|
820
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
669 #endif |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
670 |
| 0 | 671 //------------------------------meet------------------------------------------- |
| 672 // Compute the MEET of two types. NOT virtual. It enforces that meet is | |
| 673 // commutative and the lattice is symmetric. | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
674 const Type *Type::meet_helper(const Type *t, bool include_speculative) const { |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
675 if (isa_narrowoop() && t->isa_narrowoop()) { |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
676 const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative); |
|
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
183
diff
changeset
|
677 return result->make_narrowoop(); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
678 } |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
679 if (isa_narrowklass() && t->isa_narrowklass()) { |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
680 const Type* result = make_ptr()->meet_helper(t->make_ptr(), include_speculative); |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
681 return result->make_narrowklass(); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
682 } |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
683 |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
684 const Type *this_t = maybe_remove_speculative(include_speculative); |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
685 t = t->maybe_remove_speculative(include_speculative); |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
686 |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
687 const Type *mt = this_t->xmeet(t); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
688 if (isa_narrowoop() || t->isa_narrowoop()) return mt; |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
689 if (isa_narrowklass() || t->isa_narrowklass()) return mt; |
| 0 | 690 #ifdef ASSERT |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
691 assert(mt == t->xmeet(this_t), "meet not commutative"); |
| 0 | 692 const Type* dual_join = mt->_dual; |
| 693 const Type *t2t = dual_join->xmeet(t->_dual); | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
694 const Type *t2this = dual_join->xmeet(this_t->_dual); |
| 0 | 695 |
| 696 // Interface meet Oop is Not Symmetric: | |
| 697 // Interface:AnyNull meet Oop:AnyNull == Interface:AnyNull | |
| 698 // Interface:NotNull meet Oop:NotNull == java/lang/Object:NotNull | |
|
820
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
699 |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
700 if( !interface_vs_oop(t) && (t2t != t->_dual || t2this != this_t->_dual) ) { |
| 0 | 701 tty->print_cr("=== Meet Not Symmetric ==="); |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
702 tty->print("t = "); t->dump(); tty->cr(); |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
703 tty->print("this= "); this_t->dump(); tty->cr(); |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
704 tty->print("mt=(t meet this)= "); mt->dump(); tty->cr(); |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
705 |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
706 tty->print("t_dual= "); t->_dual->dump(); tty->cr(); |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
707 tty->print("this_dual= "); this_t->_dual->dump(); tty->cr(); |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
708 tty->print("mt_dual= "); mt->_dual->dump(); tty->cr(); |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
709 |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
710 tty->print("mt_dual meet t_dual= "); t2t ->dump(); tty->cr(); |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
711 tty->print("mt_dual meet this_dual= "); t2this ->dump(); tty->cr(); |
| 0 | 712 |
| 713 fatal("meet not symmetric" ); | |
| 714 } | |
| 715 #endif | |
| 716 return mt; | |
| 717 } | |
| 718 | |
| 719 //------------------------------xmeet------------------------------------------ | |
| 720 // Compute the MEET of two types. It returns a new Type object. | |
| 721 const Type *Type::xmeet( const Type *t ) const { | |
| 722 // Perform a fast test for common case; meeting the same types together. | |
| 723 if( this == t ) return this; // Meeting same type-rep? | |
| 724 | |
| 725 // Meeting TOP with anything? | |
| 726 if( _base == Top ) return t; | |
| 727 | |
| 728 // Meeting BOTTOM with anything? | |
| 729 if( _base == Bottom ) return BOTTOM; | |
| 730 | |
| 731 // Current "this->_base" is one of: Bad, Multi, Control, Top, | |
| 732 // Abio, Abstore, Floatxxx, Doublexxx, Bottom, lastype. | |
| 733 switch (t->base()) { // Switch on original type | |
| 734 | |
| 735 // Cut in half the number of cases I must handle. Only need cases for when | |
| 736 // the given enum "t->type" is less than or equal to the local enum "type". | |
| 737 case FloatCon: | |
| 738 case DoubleCon: | |
| 739 case Int: | |
| 740 case Long: | |
| 741 return t->xmeet(this); | |
| 742 | |
| 743 case OopPtr: | |
| 744 return t->xmeet(this); | |
| 745 | |
| 746 case InstPtr: | |
| 747 return t->xmeet(this); | |
| 748 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
749 case MetadataPtr: |
| 0 | 750 case KlassPtr: |
| 751 return t->xmeet(this); | |
| 752 | |
| 753 case AryPtr: | |
| 754 return t->xmeet(this); | |
| 755 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
756 case NarrowOop: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
757 return t->xmeet(this); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
758 |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
759 case NarrowKlass: |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
760 return t->xmeet(this); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
761 |
| 0 | 762 case Bad: // Type check |
| 763 default: // Bogus type not in lattice | |
| 764 typerr(t); | |
| 765 return Type::BOTTOM; | |
| 766 | |
| 767 case Bottom: // Ye Olde Default | |
| 768 return t; | |
| 769 | |
| 770 case FloatTop: | |
| 771 if( _base == FloatTop ) return this; | |
| 772 case FloatBot: // Float | |
| 773 if( _base == FloatBot || _base == FloatTop ) return FLOAT; | |
| 774 if( _base == DoubleTop || _base == DoubleBot ) return Type::BOTTOM; | |
| 775 typerr(t); | |
| 776 return Type::BOTTOM; | |
| 777 | |
| 778 case DoubleTop: | |
| 779 if( _base == DoubleTop ) return this; | |
| 780 case DoubleBot: // Double | |
| 781 if( _base == DoubleBot || _base == DoubleTop ) return DOUBLE; | |
| 782 if( _base == FloatTop || _base == FloatBot ) return Type::BOTTOM; | |
| 783 typerr(t); | |
| 784 return Type::BOTTOM; | |
| 785 | |
| 786 // These next few cases must match exactly or it is a compile-time error. | |
| 787 case Control: // Control of code | |
| 788 case Abio: // State of world outside of program | |
| 789 case Memory: | |
| 790 if( _base == t->_base ) return this; | |
| 791 typerr(t); | |
| 792 return Type::BOTTOM; | |
| 793 | |
| 794 case Top: // Top of the lattice | |
| 795 return this; | |
| 796 } | |
| 797 | |
| 798 // The type is unchanged | |
| 799 return this; | |
| 800 } | |
| 801 | |
| 802 //-----------------------------filter------------------------------------------ | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
803 const Type *Type::filter_helper(const Type *kills, bool include_speculative) const { |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
804 const Type* ft = join_helper(kills, include_speculative); |
| 0 | 805 if (ft->empty()) |
| 806 return Type::TOP; // Canonical empty value | |
| 807 return ft; | |
| 808 } | |
| 809 | |
| 810 //------------------------------xdual------------------------------------------ | |
| 811 // Compute dual right now. | |
| 812 const Type::TYPES Type::dual_type[Type::lastype] = { | |
| 813 Bad, // Bad | |
| 814 Control, // Control | |
| 815 Bottom, // Top | |
| 816 Bad, // Int - handled in v-call | |
| 817 Bad, // Long - handled in v-call | |
| 818 Half, // Half | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
819 Bad, // NarrowOop - handled in v-call |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
820 Bad, // NarrowKlass - handled in v-call |
| 0 | 821 |
| 822 Bad, // Tuple - handled in v-call | |
| 823 Bad, // Array - handled in v-call | |
|
6179
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
824 Bad, // VectorS - handled in v-call |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
825 Bad, // VectorD - handled in v-call |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
826 Bad, // VectorX - handled in v-call |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
827 Bad, // VectorY - handled in v-call |
| 0 | 828 |
| 829 Bad, // AnyPtr - handled in v-call | |
| 830 Bad, // RawPtr - handled in v-call | |
| 831 Bad, // OopPtr - handled in v-call | |
| 832 Bad, // InstPtr - handled in v-call | |
| 833 Bad, // AryPtr - handled in v-call | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
834 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
835 Bad, // MetadataPtr - handled in v-call |
| 0 | 836 Bad, // KlassPtr - handled in v-call |
| 837 | |
| 838 Bad, // Function - handled in v-call | |
| 839 Abio, // Abio | |
| 840 Return_Address,// Return_Address | |
| 841 Memory, // Memory | |
| 842 FloatBot, // FloatTop | |
| 843 FloatCon, // FloatCon | |
| 844 FloatTop, // FloatBot | |
| 845 DoubleBot, // DoubleTop | |
| 846 DoubleCon, // DoubleCon | |
| 847 DoubleTop, // DoubleBot | |
| 848 Top // Bottom | |
| 849 }; | |
| 850 | |
| 851 const Type *Type::xdual() const { | |
| 852 // Note: the base() accessor asserts the sanity of _base. | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
853 assert(_type_info[base()].dual_type != Bad, "implement with v-call"); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
854 return new Type(_type_info[_base].dual_type); |
| 0 | 855 } |
| 856 | |
| 857 //------------------------------has_memory------------------------------------- | |
| 858 bool Type::has_memory() const { | |
| 859 Type::TYPES tx = base(); | |
| 860 if (tx == Memory) return true; | |
| 861 if (tx == Tuple) { | |
| 862 const TypeTuple *t = is_tuple(); | |
| 863 for (uint i=0; i < t->cnt(); i++) { | |
| 864 tx = t->field_at(i)->base(); | |
| 865 if (tx == Memory) return true; | |
| 866 } | |
| 867 } | |
| 868 return false; | |
| 869 } | |
| 870 | |
| 871 #ifndef PRODUCT | |
| 872 //------------------------------dump2------------------------------------------ | |
| 873 void Type::dump2( Dict &d, uint depth, outputStream *st ) const { | |
|
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17810
diff
changeset
|
874 st->print("%s", _type_info[_base].msg); |
| 0 | 875 } |
| 876 | |
| 877 //------------------------------dump------------------------------------------- | |
| 878 void Type::dump_on(outputStream *st) const { | |
| 879 ResourceMark rm; | |
| 880 Dict d(cmpkey,hashkey); // Stop recursive type dumping | |
| 881 dump2(d,1, st); | |
| 163 | 882 if (is_ptr_to_narrowoop()) { |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
883 st->print(" [narrow]"); |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
884 } else if (is_ptr_to_narrowklass()) { |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
885 st->print(" [narrowklass]"); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
886 } |
| 0 | 887 } |
| 888 #endif | |
| 889 | |
| 890 //------------------------------singleton-------------------------------------- | |
| 891 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple | |
| 892 // constants (Ldi nodes). Singletons are integer, float or double constants. | |
| 893 bool Type::singleton(void) const { | |
| 894 return _base == Top || _base == Half; | |
| 895 } | |
| 896 | |
| 897 //------------------------------empty------------------------------------------ | |
| 898 // TRUE if Type is a type with no values, FALSE otherwise. | |
| 899 bool Type::empty(void) const { | |
| 900 switch (_base) { | |
| 901 case DoubleTop: | |
| 902 case FloatTop: | |
| 903 case Top: | |
| 904 return true; | |
| 905 | |
| 906 case Half: | |
| 907 case Abio: | |
| 908 case Return_Address: | |
| 909 case Memory: | |
| 910 case Bottom: | |
| 911 case FloatBot: | |
| 912 case DoubleBot: | |
| 913 return false; // never a singleton, therefore never empty | |
| 914 } | |
| 915 | |
| 916 ShouldNotReachHere(); | |
| 917 return false; | |
| 918 } | |
| 919 | |
| 920 //------------------------------dump_stats------------------------------------- | |
| 921 // Dump collected statistics to stderr | |
| 922 #ifndef PRODUCT | |
| 923 void Type::dump_stats() { | |
| 924 tty->print("Types made: %d\n", type_dict()->Size()); | |
| 925 } | |
| 926 #endif | |
| 927 | |
| 928 //------------------------------typerr----------------------------------------- | |
| 929 void Type::typerr( const Type *t ) const { | |
| 930 #ifndef PRODUCT | |
| 931 tty->print("\nError mixing types: "); | |
| 932 dump(); | |
| 933 tty->print(" and "); | |
| 934 t->dump(); | |
| 935 tty->print("\n"); | |
| 936 #endif | |
| 937 ShouldNotReachHere(); | |
| 938 } | |
| 939 | |
| 940 | |
| 941 //============================================================================= | |
| 942 // Convenience common pre-built types. | |
| 943 const TypeF *TypeF::ZERO; // Floating point zero | |
| 944 const TypeF *TypeF::ONE; // Floating point one | |
| 945 | |
| 946 //------------------------------make------------------------------------------- | |
| 947 // Create a float constant | |
| 948 const TypeF *TypeF::make(float f) { | |
| 949 return (TypeF*)(new TypeF(f))->hashcons(); | |
| 950 } | |
| 951 | |
| 952 //------------------------------meet------------------------------------------- | |
| 953 // Compute the MEET of two types. It returns a new Type object. | |
| 954 const Type *TypeF::xmeet( const Type *t ) const { | |
| 955 // Perform a fast test for common case; meeting the same types together. | |
| 956 if( this == t ) return this; // Meeting same type-rep? | |
| 957 | |
| 958 // Current "this->_base" is FloatCon | |
| 959 switch (t->base()) { // Switch on original type | |
| 960 case AnyPtr: // Mixing with oops happens when javac | |
| 961 case RawPtr: // reuses local variables | |
| 962 case OopPtr: | |
| 963 case InstPtr: | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
964 case AryPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
965 case MetadataPtr: |
| 0 | 966 case KlassPtr: |
|
293
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
247
diff
changeset
|
967 case NarrowOop: |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
968 case NarrowKlass: |
| 0 | 969 case Int: |
| 970 case Long: | |
| 971 case DoubleTop: | |
| 972 case DoubleCon: | |
| 973 case DoubleBot: | |
| 974 case Bottom: // Ye Olde Default | |
| 975 return Type::BOTTOM; | |
| 976 | |
| 977 case FloatBot: | |
| 978 return t; | |
| 979 | |
| 980 default: // All else is a mistake | |
| 981 typerr(t); | |
| 982 | |
| 983 case FloatCon: // Float-constant vs Float-constant? | |
| 984 if( jint_cast(_f) != jint_cast(t->getf()) ) // unequal constants? | |
| 985 // must compare bitwise as positive zero, negative zero and NaN have | |
| 986 // all the same representation in C++ | |
| 987 return FLOAT; // Return generic float | |
| 988 // Equal constants | |
| 989 case Top: | |
| 990 case FloatTop: | |
| 991 break; // Return the float constant | |
| 992 } | |
| 993 return this; // Return the float constant | |
| 994 } | |
| 995 | |
| 996 //------------------------------xdual------------------------------------------ | |
| 997 // Dual: symmetric | |
| 998 const Type *TypeF::xdual() const { | |
| 999 return this; | |
| 1000 } | |
| 1001 | |
| 1002 //------------------------------eq--------------------------------------------- | |
| 1003 // Structural equality check for Type representations | |
| 1004 bool TypeF::eq( const Type *t ) const { | |
| 1005 if( g_isnan(_f) || | |
| 1006 g_isnan(t->getf()) ) { | |
| 1007 // One or both are NANs. If both are NANs return true, else false. | |
| 1008 return (g_isnan(_f) && g_isnan(t->getf())); | |
| 1009 } | |
| 1010 if (_f == t->getf()) { | |
| 1011 // (NaN is impossible at this point, since it is not equal even to itself) | |
| 1012 if (_f == 0.0) { | |
| 1013 // difference between positive and negative zero | |
| 1014 if (jint_cast(_f) != jint_cast(t->getf())) return false; | |
| 1015 } | |
| 1016 return true; | |
| 1017 } | |
| 1018 return false; | |
| 1019 } | |
| 1020 | |
| 1021 //------------------------------hash------------------------------------------- | |
| 1022 // Type-specific hashing function. | |
| 1023 int TypeF::hash(void) const { | |
| 1024 return *(int*)(&_f); | |
| 1025 } | |
| 1026 | |
| 1027 //------------------------------is_finite-------------------------------------- | |
| 1028 // Has a finite value | |
| 1029 bool TypeF::is_finite() const { | |
| 1030 return g_isfinite(getf()) != 0; | |
| 1031 } | |
| 1032 | |
| 1033 //------------------------------is_nan----------------------------------------- | |
| 1034 // Is not a number (NaN) | |
| 1035 bool TypeF::is_nan() const { | |
| 1036 return g_isnan(getf()) != 0; | |
| 1037 } | |
| 1038 | |
| 1039 //------------------------------dump2------------------------------------------ | |
| 1040 // Dump float constant Type | |
| 1041 #ifndef PRODUCT | |
| 1042 void TypeF::dump2( Dict &d, uint depth, outputStream *st ) const { | |
| 1043 Type::dump2(d,depth, st); | |
| 1044 st->print("%f", _f); | |
| 1045 } | |
| 1046 #endif | |
| 1047 | |
| 1048 //------------------------------singleton-------------------------------------- | |
| 1049 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple | |
| 1050 // constants (Ldi nodes). Singletons are integer, float or double constants | |
| 1051 // or a single symbol. | |
| 1052 bool TypeF::singleton(void) const { | |
| 1053 return true; // Always a singleton | |
| 1054 } | |
| 1055 | |
| 1056 bool TypeF::empty(void) const { | |
| 1057 return false; // always exactly a singleton | |
| 1058 } | |
| 1059 | |
| 1060 //============================================================================= | |
| 1061 // Convenience common pre-built types. | |
| 1062 const TypeD *TypeD::ZERO; // Floating point zero | |
| 1063 const TypeD *TypeD::ONE; // Floating point one | |
| 1064 | |
| 1065 //------------------------------make------------------------------------------- | |
| 1066 const TypeD *TypeD::make(double d) { | |
| 1067 return (TypeD*)(new TypeD(d))->hashcons(); | |
| 1068 } | |
| 1069 | |
| 1070 //------------------------------meet------------------------------------------- | |
| 1071 // Compute the MEET of two types. It returns a new Type object. | |
| 1072 const Type *TypeD::xmeet( const Type *t ) const { | |
| 1073 // Perform a fast test for common case; meeting the same types together. | |
| 1074 if( this == t ) return this; // Meeting same type-rep? | |
| 1075 | |
| 1076 // Current "this->_base" is DoubleCon | |
| 1077 switch (t->base()) { // Switch on original type | |
| 1078 case AnyPtr: // Mixing with oops happens when javac | |
| 1079 case RawPtr: // reuses local variables | |
| 1080 case OopPtr: | |
| 1081 case InstPtr: | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
1082 case AryPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
1083 case MetadataPtr: |
| 0 | 1084 case KlassPtr: |
|
183
d4dbd9f91680
6711083: 64bit JVM crashes with Internal Error (type.cpp:763) - ShouldNotReachHere() with enabled COOPs
never
parents:
163
diff
changeset
|
1085 case NarrowOop: |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
1086 case NarrowKlass: |
| 0 | 1087 case Int: |
| 1088 case Long: | |
| 1089 case FloatTop: | |
| 1090 case FloatCon: | |
| 1091 case FloatBot: | |
| 1092 case Bottom: // Ye Olde Default | |
| 1093 return Type::BOTTOM; | |
| 1094 | |
| 1095 case DoubleBot: | |
| 1096 return t; | |
| 1097 | |
| 1098 default: // All else is a mistake | |
| 1099 typerr(t); | |
| 1100 | |
| 1101 case DoubleCon: // Double-constant vs Double-constant? | |
| 1102 if( jlong_cast(_d) != jlong_cast(t->getd()) ) // unequal constants? (see comment in TypeF::xmeet) | |
| 1103 return DOUBLE; // Return generic double | |
| 1104 case Top: | |
| 1105 case DoubleTop: | |
| 1106 break; | |
| 1107 } | |
| 1108 return this; // Return the double constant | |
| 1109 } | |
| 1110 | |
| 1111 //------------------------------xdual------------------------------------------ | |
| 1112 // Dual: symmetric | |
| 1113 const Type *TypeD::xdual() const { | |
| 1114 return this; | |
| 1115 } | |
| 1116 | |
| 1117 //------------------------------eq--------------------------------------------- | |
| 1118 // Structural equality check for Type representations | |
| 1119 bool TypeD::eq( const Type *t ) const { | |
| 1120 if( g_isnan(_d) || | |
| 1121 g_isnan(t->getd()) ) { | |
|
21984
107b1a534264
Apply JDK-8073670
Stefan Anzinger <stefan.anzinger@oracle.com>
parents:
20804
diff
changeset
|
1122 // it is important, when two different NaNs are used in one method, the NaNs are treated |
|
107b1a534264
Apply JDK-8073670
Stefan Anzinger <stefan.anzinger@oracle.com>
parents:
20804
diff
changeset
|
1123 // as different NaNs (as C1 does) |
|
107b1a534264
Apply JDK-8073670
Stefan Anzinger <stefan.anzinger@oracle.com>
parents:
20804
diff
changeset
|
1124 jdouble td = t->getd(); |
|
107b1a534264
Apply JDK-8073670
Stefan Anzinger <stefan.anzinger@oracle.com>
parents:
20804
diff
changeset
|
1125 return *((jlong*)(&_d)) == *(jlong*)(&td); |
| 0 | 1126 } |
| 1127 if (_d == t->getd()) { | |
| 1128 // (NaN is impossible at this point, since it is not equal even to itself) | |
| 1129 if (_d == 0.0) { | |
| 1130 // difference between positive and negative zero | |
| 1131 if (jlong_cast(_d) != jlong_cast(t->getd())) return false; | |
| 1132 } | |
| 1133 return true; | |
| 1134 } | |
| 1135 return false; | |
| 1136 } | |
| 1137 | |
| 1138 //------------------------------hash------------------------------------------- | |
| 1139 // Type-specific hashing function. | |
| 1140 int TypeD::hash(void) const { | |
| 1141 return *(int*)(&_d); | |
| 1142 } | |
| 1143 | |
| 1144 //------------------------------is_finite-------------------------------------- | |
| 1145 // Has a finite value | |
| 1146 bool TypeD::is_finite() const { | |
| 1147 return g_isfinite(getd()) != 0; | |
| 1148 } | |
| 1149 | |
| 1150 //------------------------------is_nan----------------------------------------- | |
| 1151 // Is not a number (NaN) | |
| 1152 bool TypeD::is_nan() const { | |
| 1153 return g_isnan(getd()) != 0; | |
| 1154 } | |
| 1155 | |
| 1156 //------------------------------dump2------------------------------------------ | |
| 1157 // Dump double constant Type | |
| 1158 #ifndef PRODUCT | |
| 1159 void TypeD::dump2( Dict &d, uint depth, outputStream *st ) const { | |
| 1160 Type::dump2(d,depth,st); | |
| 1161 st->print("%f", _d); | |
| 1162 } | |
| 1163 #endif | |
| 1164 | |
| 1165 //------------------------------singleton-------------------------------------- | |
| 1166 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple | |
| 1167 // constants (Ldi nodes). Singletons are integer, float or double constants | |
| 1168 // or a single symbol. | |
| 1169 bool TypeD::singleton(void) const { | |
| 1170 return true; // Always a singleton | |
| 1171 } | |
| 1172 | |
| 1173 bool TypeD::empty(void) const { | |
| 1174 return false; // always exactly a singleton | |
| 1175 } | |
| 1176 | |
| 1177 //============================================================================= | |
| 1178 // Convience common pre-built types. | |
| 1179 const TypeInt *TypeInt::MINUS_1;// -1 | |
| 1180 const TypeInt *TypeInt::ZERO; // 0 | |
| 1181 const TypeInt *TypeInt::ONE; // 1 | |
| 1182 const TypeInt *TypeInt::BOOL; // 0 or 1, FALSE or TRUE. | |
| 1183 const TypeInt *TypeInt::CC; // -1,0 or 1, condition codes | |
| 1184 const TypeInt *TypeInt::CC_LT; // [-1] == MINUS_1 | |
| 1185 const TypeInt *TypeInt::CC_GT; // [1] == ONE | |
| 1186 const TypeInt *TypeInt::CC_EQ; // [0] == ZERO | |
| 1187 const TypeInt *TypeInt::CC_LE; // [-1,0] | |
| 1188 const TypeInt *TypeInt::CC_GE; // [0,1] == BOOL (!) | |
| 1189 const TypeInt *TypeInt::BYTE; // Bytes, -128 to 127 | |
| 624 | 1190 const TypeInt *TypeInt::UBYTE; // Unsigned Bytes, 0 to 255 |
| 0 | 1191 const TypeInt *TypeInt::CHAR; // Java chars, 0-65535 |
| 1192 const TypeInt *TypeInt::SHORT; // Java shorts, -32768-32767 | |
| 1193 const TypeInt *TypeInt::POS; // Positive 32-bit integers or zero | |
| 1194 const TypeInt *TypeInt::POS1; // Positive 32-bit integers | |
| 1195 const TypeInt *TypeInt::INT; // 32-bit integers | |
| 1196 const TypeInt *TypeInt::SYMINT; // symmetric range [-max_jint..max_jint] | |
|
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
14383
diff
changeset
|
1197 const TypeInt *TypeInt::TYPE_DOMAIN; // alias for TypeInt::INT |
| 0 | 1198 |
| 1199 //------------------------------TypeInt---------------------------------------- | |
| 1200 TypeInt::TypeInt( jint lo, jint hi, int w ) : Type(Int), _lo(lo), _hi(hi), _widen(w) { | |
| 1201 } | |
| 1202 | |
| 1203 //------------------------------make------------------------------------------- | |
| 1204 const TypeInt *TypeInt::make( jint lo ) { | |
| 1205 return (TypeInt*)(new TypeInt(lo,lo,WidenMin))->hashcons(); | |
| 1206 } | |
| 1207 | |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1208 static int normalize_int_widen( jint lo, jint hi, int w ) { |
| 0 | 1209 // Certain normalizations keep us sane when comparing types. |
| 1210 // The 'SMALLINT' covers constants and also CC and its relatives. | |
| 1211 if (lo <= hi) { | |
|
23069
2a55e4998f0d
8078666: JVM fastdebug build compiled with GCC 5 asserts with "widen increases"
sgehwolf
parents:
22943
diff
changeset
|
1212 if (((juint)hi - lo) <= SMALLINT) w = Type::WidenMin; |
|
2a55e4998f0d
8078666: JVM fastdebug build compiled with GCC 5 asserts with "widen increases"
sgehwolf
parents:
22943
diff
changeset
|
1213 if (((juint)hi - lo) >= max_juint) w = Type::WidenMax; // TypeInt::INT |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1214 } else { |
|
23069
2a55e4998f0d
8078666: JVM fastdebug build compiled with GCC 5 asserts with "widen increases"
sgehwolf
parents:
22943
diff
changeset
|
1215 if (((juint)lo - hi) <= SMALLINT) w = Type::WidenMin; |
|
2a55e4998f0d
8078666: JVM fastdebug build compiled with GCC 5 asserts with "widen increases"
sgehwolf
parents:
22943
diff
changeset
|
1216 if (((juint)lo - hi) >= max_juint) w = Type::WidenMin; // dual TypeInt::INT |
| 0 | 1217 } |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1218 return w; |
|
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1219 } |
|
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1220 |
|
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1221 const TypeInt *TypeInt::make( jint lo, jint hi, int w ) { |
|
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1222 w = normalize_int_widen(lo, hi, w); |
| 0 | 1223 return (TypeInt*)(new TypeInt(lo,hi,w))->hashcons(); |
| 1224 } | |
| 1225 | |
| 1226 //------------------------------meet------------------------------------------- | |
| 1227 // Compute the MEET of two types. It returns a new Type representation object | |
| 1228 // with reference count equal to the number of Types pointing at it. | |
| 1229 // Caller should wrap a Types around it. | |
| 1230 const Type *TypeInt::xmeet( const Type *t ) const { | |
| 1231 // Perform a fast test for common case; meeting the same types together. | |
| 1232 if( this == t ) return this; // Meeting same type? | |
| 1233 | |
| 1234 // Currently "this->_base" is a TypeInt | |
| 1235 switch (t->base()) { // Switch on original type | |
| 1236 case AnyPtr: // Mixing with oops happens when javac | |
| 1237 case RawPtr: // reuses local variables | |
| 1238 case OopPtr: | |
| 1239 case InstPtr: | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
1240 case AryPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
1241 case MetadataPtr: |
| 0 | 1242 case KlassPtr: |
|
183
d4dbd9f91680
6711083: 64bit JVM crashes with Internal Error (type.cpp:763) - ShouldNotReachHere() with enabled COOPs
never
parents:
163
diff
changeset
|
1243 case NarrowOop: |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
1244 case NarrowKlass: |
| 0 | 1245 case Long: |
| 1246 case FloatTop: | |
| 1247 case FloatCon: | |
| 1248 case FloatBot: | |
| 1249 case DoubleTop: | |
| 1250 case DoubleCon: | |
| 1251 case DoubleBot: | |
| 1252 case Bottom: // Ye Olde Default | |
| 1253 return Type::BOTTOM; | |
| 1254 default: // All else is a mistake | |
| 1255 typerr(t); | |
| 1256 case Top: // No change | |
| 1257 return this; | |
| 1258 case Int: // Int vs Int? | |
| 1259 break; | |
| 1260 } | |
| 1261 | |
| 1262 // Expand covered set | |
| 1263 const TypeInt *r = t->is_int(); | |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1264 return make( MIN2(_lo,r->_lo), MAX2(_hi,r->_hi), MAX2(_widen,r->_widen) ); |
| 0 | 1265 } |
| 1266 | |
| 1267 //------------------------------xdual------------------------------------------ | |
| 1268 // Dual: reverse hi & lo; flip widen | |
| 1269 const Type *TypeInt::xdual() const { | |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1270 int w = normalize_int_widen(_hi,_lo, WidenMax-_widen); |
|
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1271 return new TypeInt(_hi,_lo,w); |
| 0 | 1272 } |
| 1273 | |
| 1274 //------------------------------widen------------------------------------------ | |
| 1275 // Only happens for optimistic top-down optimizations. | |
|
1009
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1276 const Type *TypeInt::widen( const Type *old, const Type* limit ) const { |
| 0 | 1277 // Coming from TOP or such; no widening |
| 1278 if( old->base() != Int ) return this; | |
| 1279 const TypeInt *ot = old->is_int(); | |
| 1280 | |
| 1281 // If new guy is equal to old guy, no widening | |
| 1282 if( _lo == ot->_lo && _hi == ot->_hi ) | |
| 1283 return old; | |
| 1284 | |
| 1285 // If new guy contains old, then we widened | |
| 1286 if( _lo <= ot->_lo && _hi >= ot->_hi ) { | |
| 1287 // New contains old | |
| 1288 // If new guy is already wider than old, no widening | |
| 1289 if( _widen > ot->_widen ) return this; | |
| 1290 // If old guy was a constant, do not bother | |
| 1291 if (ot->_lo == ot->_hi) return this; | |
| 1292 // Now widen new guy. | |
| 1293 // Check for widening too far | |
| 1294 if (_widen == WidenMax) { | |
|
1009
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1295 int max = max_jint; |
|
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1296 int min = min_jint; |
|
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1297 if (limit->isa_int()) { |
|
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1298 max = limit->is_int()->_hi; |
|
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1299 min = limit->is_int()->_lo; |
|
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1300 } |
|
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1301 if (min < _lo && _hi < max) { |
| 0 | 1302 // If neither endpoint is extremal yet, push out the endpoint |
| 1303 // which is closer to its respective limit. | |
| 1304 if (_lo >= 0 || // easy common case | |
|
1009
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1305 (juint)(_lo - min) >= (juint)(max - _hi)) { |
| 0 | 1306 // Try to widen to an unsigned range type of 31 bits: |
|
1009
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1307 return make(_lo, max, WidenMax); |
| 0 | 1308 } else { |
|
1009
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1309 return make(min, _hi, WidenMax); |
| 0 | 1310 } |
| 1311 } | |
| 1312 return TypeInt::INT; | |
| 1313 } | |
| 1314 // Returned widened new guy | |
| 1315 return make(_lo,_hi,_widen+1); | |
| 1316 } | |
| 1317 | |
| 1318 // If old guy contains new, then we probably widened too far & dropped to | |
| 1319 // bottom. Return the wider fellow. | |
| 1320 if ( ot->_lo <= _lo && ot->_hi >= _hi ) | |
| 1321 return old; | |
| 1322 | |
| 1323 //fatal("Integer value range is not subset"); | |
| 1324 //return this; | |
| 1325 return TypeInt::INT; | |
| 1326 } | |
| 1327 | |
| 1328 //------------------------------narrow--------------------------------------- | |
| 1329 // Only happens for pessimistic optimizations. | |
| 1330 const Type *TypeInt::narrow( const Type *old ) const { | |
| 1331 if (_lo >= _hi) return this; // already narrow enough | |
| 1332 if (old == NULL) return this; | |
| 1333 const TypeInt* ot = old->isa_int(); | |
| 1334 if (ot == NULL) return this; | |
| 1335 jint olo = ot->_lo; | |
| 1336 jint ohi = ot->_hi; | |
| 1337 | |
| 1338 // If new guy is equal to old guy, no narrowing | |
| 1339 if (_lo == olo && _hi == ohi) return old; | |
| 1340 | |
| 1341 // If old guy was maximum range, allow the narrowing | |
| 1342 if (olo == min_jint && ohi == max_jint) return this; | |
| 1343 | |
| 1344 if (_lo < olo || _hi > ohi) | |
| 1345 return this; // doesn't narrow; pretty wierd | |
| 1346 | |
| 1347 // The new type narrows the old type, so look for a "death march". | |
| 1348 // See comments on PhaseTransform::saturate. | |
| 1349 juint nrange = _hi - _lo; | |
| 1350 juint orange = ohi - olo; | |
| 1351 if (nrange < max_juint - 1 && nrange > (orange >> 1) + (SMALLINT*2)) { | |
| 1352 // Use the new type only if the range shrinks a lot. | |
| 1353 // We do not want the optimizer computing 2^31 point by point. | |
| 1354 return old; | |
| 1355 } | |
| 1356 | |
| 1357 return this; | |
| 1358 } | |
| 1359 | |
| 1360 //-----------------------------filter------------------------------------------ | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
1361 const Type *TypeInt::filter_helper(const Type *kills, bool include_speculative) const { |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
1362 const TypeInt* ft = join_helper(kills, include_speculative)->isa_int(); |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1363 if (ft == NULL || ft->empty()) |
| 0 | 1364 return Type::TOP; // Canonical empty value |
| 1365 if (ft->_widen < this->_widen) { | |
| 1366 // Do not allow the value of kill->_widen to affect the outcome. | |
| 1367 // The widen bits must be allowed to run freely through the graph. | |
| 1368 ft = TypeInt::make(ft->_lo, ft->_hi, this->_widen); | |
| 1369 } | |
| 1370 return ft; | |
| 1371 } | |
| 1372 | |
| 1373 //------------------------------eq--------------------------------------------- | |
| 1374 // Structural equality check for Type representations | |
| 1375 bool TypeInt::eq( const Type *t ) const { | |
| 1376 const TypeInt *r = t->is_int(); // Handy access | |
| 1377 return r->_lo == _lo && r->_hi == _hi && r->_widen == _widen; | |
| 1378 } | |
| 1379 | |
| 1380 //------------------------------hash------------------------------------------- | |
| 1381 // Type-specific hashing function. | |
| 1382 int TypeInt::hash(void) const { | |
| 1383 return _lo+_hi+_widen+(int)Type::Int; | |
| 1384 } | |
| 1385 | |
| 1386 //------------------------------is_finite-------------------------------------- | |
| 1387 // Has a finite value | |
| 1388 bool TypeInt::is_finite() const { | |
| 1389 return true; | |
| 1390 } | |
| 1391 | |
| 1392 //------------------------------dump2------------------------------------------ | |
| 1393 // Dump TypeInt | |
| 1394 #ifndef PRODUCT | |
| 1395 static const char* intname(char* buf, jint n) { | |
| 1396 if (n == min_jint) | |
| 1397 return "min"; | |
| 1398 else if (n < min_jint + 10000) | |
| 1399 sprintf(buf, "min+" INT32_FORMAT, n - min_jint); | |
| 1400 else if (n == max_jint) | |
| 1401 return "max"; | |
| 1402 else if (n > max_jint - 10000) | |
| 1403 sprintf(buf, "max-" INT32_FORMAT, max_jint - n); | |
| 1404 else | |
| 1405 sprintf(buf, INT32_FORMAT, n); | |
| 1406 return buf; | |
| 1407 } | |
| 1408 | |
| 1409 void TypeInt::dump2( Dict &d, uint depth, outputStream *st ) const { | |
| 1410 char buf[40], buf2[40]; | |
| 1411 if (_lo == min_jint && _hi == max_jint) | |
| 1412 st->print("int"); | |
| 1413 else if (is_con()) | |
| 1414 st->print("int:%s", intname(buf, get_con())); | |
| 1415 else if (_lo == BOOL->_lo && _hi == BOOL->_hi) | |
| 1416 st->print("bool"); | |
| 1417 else if (_lo == BYTE->_lo && _hi == BYTE->_hi) | |
| 1418 st->print("byte"); | |
| 1419 else if (_lo == CHAR->_lo && _hi == CHAR->_hi) | |
| 1420 st->print("char"); | |
| 1421 else if (_lo == SHORT->_lo && _hi == SHORT->_hi) | |
| 1422 st->print("short"); | |
| 1423 else if (_hi == max_jint) | |
| 1424 st->print("int:>=%s", intname(buf, _lo)); | |
| 1425 else if (_lo == min_jint) | |
| 1426 st->print("int:<=%s", intname(buf, _hi)); | |
| 1427 else | |
| 1428 st->print("int:%s..%s", intname(buf, _lo), intname(buf2, _hi)); | |
| 1429 | |
| 1430 if (_widen != 0 && this != TypeInt::INT) | |
| 1431 st->print(":%.*s", _widen, "wwww"); | |
| 1432 } | |
| 1433 #endif | |
| 1434 | |
| 1435 //------------------------------singleton-------------------------------------- | |
| 1436 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple | |
| 1437 // constants. | |
| 1438 bool TypeInt::singleton(void) const { | |
| 1439 return _lo >= _hi; | |
| 1440 } | |
| 1441 | |
| 1442 bool TypeInt::empty(void) const { | |
| 1443 return _lo > _hi; | |
| 1444 } | |
| 1445 | |
| 1446 //============================================================================= | |
| 1447 // Convenience common pre-built types. | |
| 1448 const TypeLong *TypeLong::MINUS_1;// -1 | |
| 1449 const TypeLong *TypeLong::ZERO; // 0 | |
| 1450 const TypeLong *TypeLong::ONE; // 1 | |
| 1451 const TypeLong *TypeLong::POS; // >=0 | |
| 1452 const TypeLong *TypeLong::LONG; // 64-bit integers | |
| 1453 const TypeLong *TypeLong::INT; // 32-bit subrange | |
| 1454 const TypeLong *TypeLong::UINT; // 32-bit unsigned subrange | |
|
17726
085b304a1cc5
8027754: Enable loop optimizations for loops with MathExact inside
rbackman
parents:
14383
diff
changeset
|
1455 const TypeLong *TypeLong::TYPE_DOMAIN; // alias for TypeLong::LONG |
| 0 | 1456 |
| 1457 //------------------------------TypeLong--------------------------------------- | |
| 1458 TypeLong::TypeLong( jlong lo, jlong hi, int w ) : Type(Long), _lo(lo), _hi(hi), _widen(w) { | |
| 1459 } | |
| 1460 | |
| 1461 //------------------------------make------------------------------------------- | |
| 1462 const TypeLong *TypeLong::make( jlong lo ) { | |
| 1463 return (TypeLong*)(new TypeLong(lo,lo,WidenMin))->hashcons(); | |
| 1464 } | |
| 1465 | |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1466 static int normalize_long_widen( jlong lo, jlong hi, int w ) { |
| 0 | 1467 // Certain normalizations keep us sane when comparing types. |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1468 // The 'SMALLINT' covers constants. |
| 0 | 1469 if (lo <= hi) { |
|
23069
2a55e4998f0d
8078666: JVM fastdebug build compiled with GCC 5 asserts with "widen increases"
sgehwolf
parents:
22943
diff
changeset
|
1470 if (((julong)hi - lo) <= SMALLINT) w = Type::WidenMin; |
|
2a55e4998f0d
8078666: JVM fastdebug build compiled with GCC 5 asserts with "widen increases"
sgehwolf
parents:
22943
diff
changeset
|
1471 if (((julong)hi - lo) >= max_julong) w = Type::WidenMax; // TypeLong::LONG |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1472 } else { |
|
23069
2a55e4998f0d
8078666: JVM fastdebug build compiled with GCC 5 asserts with "widen increases"
sgehwolf
parents:
22943
diff
changeset
|
1473 if (((julong)lo - hi) <= SMALLINT) w = Type::WidenMin; |
|
2a55e4998f0d
8078666: JVM fastdebug build compiled with GCC 5 asserts with "widen increases"
sgehwolf
parents:
22943
diff
changeset
|
1474 if (((julong)lo - hi) >= max_julong) w = Type::WidenMin; // dual TypeLong::LONG |
| 0 | 1475 } |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1476 return w; |
|
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1477 } |
|
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1478 |
|
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1479 const TypeLong *TypeLong::make( jlong lo, jlong hi, int w ) { |
|
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1480 w = normalize_long_widen(lo, hi, w); |
| 0 | 1481 return (TypeLong*)(new TypeLong(lo,hi,w))->hashcons(); |
| 1482 } | |
| 1483 | |
| 1484 | |
| 1485 //------------------------------meet------------------------------------------- | |
| 1486 // Compute the MEET of two types. It returns a new Type representation object | |
| 1487 // with reference count equal to the number of Types pointing at it. | |
| 1488 // Caller should wrap a Types around it. | |
| 1489 const Type *TypeLong::xmeet( const Type *t ) const { | |
| 1490 // Perform a fast test for common case; meeting the same types together. | |
| 1491 if( this == t ) return this; // Meeting same type? | |
| 1492 | |
| 1493 // Currently "this->_base" is a TypeLong | |
| 1494 switch (t->base()) { // Switch on original type | |
| 1495 case AnyPtr: // Mixing with oops happens when javac | |
| 1496 case RawPtr: // reuses local variables | |
| 1497 case OopPtr: | |
| 1498 case InstPtr: | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
1499 case AryPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
1500 case MetadataPtr: |
| 0 | 1501 case KlassPtr: |
|
183
d4dbd9f91680
6711083: 64bit JVM crashes with Internal Error (type.cpp:763) - ShouldNotReachHere() with enabled COOPs
never
parents:
163
diff
changeset
|
1502 case NarrowOop: |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
1503 case NarrowKlass: |
| 0 | 1504 case Int: |
| 1505 case FloatTop: | |
| 1506 case FloatCon: | |
| 1507 case FloatBot: | |
| 1508 case DoubleTop: | |
| 1509 case DoubleCon: | |
| 1510 case DoubleBot: | |
| 1511 case Bottom: // Ye Olde Default | |
| 1512 return Type::BOTTOM; | |
| 1513 default: // All else is a mistake | |
| 1514 typerr(t); | |
| 1515 case Top: // No change | |
| 1516 return this; | |
| 1517 case Long: // Long vs Long? | |
| 1518 break; | |
| 1519 } | |
| 1520 | |
| 1521 // Expand covered set | |
| 1522 const TypeLong *r = t->is_long(); // Turn into a TypeLong | |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1523 return make( MIN2(_lo,r->_lo), MAX2(_hi,r->_hi), MAX2(_widen,r->_widen) ); |
| 0 | 1524 } |
| 1525 | |
| 1526 //------------------------------xdual------------------------------------------ | |
| 1527 // Dual: reverse hi & lo; flip widen | |
| 1528 const Type *TypeLong::xdual() const { | |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1529 int w = normalize_long_widen(_hi,_lo, WidenMax-_widen); |
|
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1530 return new TypeLong(_hi,_lo,w); |
| 0 | 1531 } |
| 1532 | |
| 1533 //------------------------------widen------------------------------------------ | |
| 1534 // Only happens for optimistic top-down optimizations. | |
|
1009
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1535 const Type *TypeLong::widen( const Type *old, const Type* limit ) const { |
| 0 | 1536 // Coming from TOP or such; no widening |
| 1537 if( old->base() != Long ) return this; | |
| 1538 const TypeLong *ot = old->is_long(); | |
| 1539 | |
| 1540 // If new guy is equal to old guy, no widening | |
| 1541 if( _lo == ot->_lo && _hi == ot->_hi ) | |
| 1542 return old; | |
| 1543 | |
| 1544 // If new guy contains old, then we widened | |
| 1545 if( _lo <= ot->_lo && _hi >= ot->_hi ) { | |
| 1546 // New contains old | |
| 1547 // If new guy is already wider than old, no widening | |
| 1548 if( _widen > ot->_widen ) return this; | |
| 1549 // If old guy was a constant, do not bother | |
| 1550 if (ot->_lo == ot->_hi) return this; | |
| 1551 // Now widen new guy. | |
| 1552 // Check for widening too far | |
| 1553 if (_widen == WidenMax) { | |
|
1009
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1554 jlong max = max_jlong; |
|
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1555 jlong min = min_jlong; |
|
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1556 if (limit->isa_long()) { |
|
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1557 max = limit->is_long()->_hi; |
|
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1558 min = limit->is_long()->_lo; |
|
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1559 } |
|
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1560 if (min < _lo && _hi < max) { |
| 0 | 1561 // If neither endpoint is extremal yet, push out the endpoint |
| 1562 // which is closer to its respective limit. | |
| 1563 if (_lo >= 0 || // easy common case | |
|
1009
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1564 (julong)(_lo - min) >= (julong)(max - _hi)) { |
| 0 | 1565 // Try to widen to an unsigned range type of 32/63 bits: |
|
1009
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1566 if (max >= max_juint && _hi < max_juint) |
| 0 | 1567 return make(_lo, max_juint, WidenMax); |
| 1568 else | |
|
1009
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1569 return make(_lo, max, WidenMax); |
| 0 | 1570 } else { |
|
1009
03b336640699
6885584: A particular class structure causes large allocation spike for jit
never
parents:
992
diff
changeset
|
1571 return make(min, _hi, WidenMax); |
| 0 | 1572 } |
| 1573 } | |
| 1574 return TypeLong::LONG; | |
| 1575 } | |
| 1576 // Returned widened new guy | |
| 1577 return make(_lo,_hi,_widen+1); | |
| 1578 } | |
| 1579 | |
| 1580 // If old guy contains new, then we probably widened too far & dropped to | |
| 1581 // bottom. Return the wider fellow. | |
| 1582 if ( ot->_lo <= _lo && ot->_hi >= _hi ) | |
| 1583 return old; | |
| 1584 | |
| 1585 // fatal("Long value range is not subset"); | |
| 1586 // return this; | |
| 1587 return TypeLong::LONG; | |
| 1588 } | |
| 1589 | |
| 1590 //------------------------------narrow---------------------------------------- | |
| 1591 // Only happens for pessimistic optimizations. | |
| 1592 const Type *TypeLong::narrow( const Type *old ) const { | |
| 1593 if (_lo >= _hi) return this; // already narrow enough | |
| 1594 if (old == NULL) return this; | |
| 1595 const TypeLong* ot = old->isa_long(); | |
| 1596 if (ot == NULL) return this; | |
| 1597 jlong olo = ot->_lo; | |
| 1598 jlong ohi = ot->_hi; | |
| 1599 | |
| 1600 // If new guy is equal to old guy, no narrowing | |
| 1601 if (_lo == olo && _hi == ohi) return old; | |
| 1602 | |
| 1603 // If old guy was maximum range, allow the narrowing | |
| 1604 if (olo == min_jlong && ohi == max_jlong) return this; | |
| 1605 | |
| 1606 if (_lo < olo || _hi > ohi) | |
| 1607 return this; // doesn't narrow; pretty wierd | |
| 1608 | |
| 1609 // The new type narrows the old type, so look for a "death march". | |
| 1610 // See comments on PhaseTransform::saturate. | |
| 1611 julong nrange = _hi - _lo; | |
| 1612 julong orange = ohi - olo; | |
| 1613 if (nrange < max_julong - 1 && nrange > (orange >> 1) + (SMALLINT*2)) { | |
| 1614 // Use the new type only if the range shrinks a lot. | |
| 1615 // We do not want the optimizer computing 2^31 point by point. | |
| 1616 return old; | |
| 1617 } | |
| 1618 | |
| 1619 return this; | |
| 1620 } | |
| 1621 | |
| 1622 //-----------------------------filter------------------------------------------ | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
1623 const Type *TypeLong::filter_helper(const Type *kills, bool include_speculative) const { |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
1624 const TypeLong* ft = join_helper(kills, include_speculative)->isa_long(); |
|
1620
d678e3277048
6964479: widen normalization of small int and long values should be symmetric
kvn
parents:
1552
diff
changeset
|
1625 if (ft == NULL || ft->empty()) |
| 0 | 1626 return Type::TOP; // Canonical empty value |
| 1627 if (ft->_widen < this->_widen) { | |
| 1628 // Do not allow the value of kill->_widen to affect the outcome. | |
| 1629 // The widen bits must be allowed to run freely through the graph. | |
| 1630 ft = TypeLong::make(ft->_lo, ft->_hi, this->_widen); | |
| 1631 } | |
| 1632 return ft; | |
| 1633 } | |
| 1634 | |
| 1635 //------------------------------eq--------------------------------------------- | |
| 1636 // Structural equality check for Type representations | |
| 1637 bool TypeLong::eq( const Type *t ) const { | |
| 1638 const TypeLong *r = t->is_long(); // Handy access | |
| 1639 return r->_lo == _lo && r->_hi == _hi && r->_widen == _widen; | |
| 1640 } | |
| 1641 | |
| 1642 //------------------------------hash------------------------------------------- | |
| 1643 // Type-specific hashing function. | |
| 1644 int TypeLong::hash(void) const { | |
| 1645 return (int)(_lo+_hi+_widen+(int)Type::Long); | |
| 1646 } | |
| 1647 | |
| 1648 //------------------------------is_finite-------------------------------------- | |
| 1649 // Has a finite value | |
| 1650 bool TypeLong::is_finite() const { | |
| 1651 return true; | |
| 1652 } | |
| 1653 | |
| 1654 //------------------------------dump2------------------------------------------ | |
| 1655 // Dump TypeLong | |
| 1656 #ifndef PRODUCT | |
| 1657 static const char* longnamenear(jlong x, const char* xname, char* buf, jlong n) { | |
| 1658 if (n > x) { | |
| 1659 if (n >= x + 10000) return NULL; | |
|
7623
203f64878aab
7102489: RFE: cleanup jlong typedef on __APPLE__and _LLP64 systems.
hseigel
parents:
6890
diff
changeset
|
1660 sprintf(buf, "%s+" JLONG_FORMAT, xname, n - x); |
| 0 | 1661 } else if (n < x) { |
| 1662 if (n <= x - 10000) return NULL; | |
|
7623
203f64878aab
7102489: RFE: cleanup jlong typedef on __APPLE__and _LLP64 systems.
hseigel
parents:
6890
diff
changeset
|
1663 sprintf(buf, "%s-" JLONG_FORMAT, xname, x - n); |
| 0 | 1664 } else { |
| 1665 return xname; | |
| 1666 } | |
| 1667 return buf; | |
| 1668 } | |
| 1669 | |
| 1670 static const char* longname(char* buf, jlong n) { | |
| 1671 const char* str; | |
| 1672 if (n == min_jlong) | |
| 1673 return "min"; | |
| 1674 else if (n < min_jlong + 10000) | |
|
7623
203f64878aab
7102489: RFE: cleanup jlong typedef on __APPLE__and _LLP64 systems.
hseigel
parents:
6890
diff
changeset
|
1675 sprintf(buf, "min+" JLONG_FORMAT, n - min_jlong); |
| 0 | 1676 else if (n == max_jlong) |
| 1677 return "max"; | |
| 1678 else if (n > max_jlong - 10000) | |
|
7623
203f64878aab
7102489: RFE: cleanup jlong typedef on __APPLE__and _LLP64 systems.
hseigel
parents:
6890
diff
changeset
|
1679 sprintf(buf, "max-" JLONG_FORMAT, max_jlong - n); |
| 0 | 1680 else if ((str = longnamenear(max_juint, "maxuint", buf, n)) != NULL) |
| 1681 return str; | |
| 1682 else if ((str = longnamenear(max_jint, "maxint", buf, n)) != NULL) | |
| 1683 return str; | |
| 1684 else if ((str = longnamenear(min_jint, "minint", buf, n)) != NULL) | |
| 1685 return str; | |
| 1686 else | |
|
7623
203f64878aab
7102489: RFE: cleanup jlong typedef on __APPLE__and _LLP64 systems.
hseigel
parents:
6890
diff
changeset
|
1687 sprintf(buf, JLONG_FORMAT, n); |
| 0 | 1688 return buf; |
| 1689 } | |
| 1690 | |
| 1691 void TypeLong::dump2( Dict &d, uint depth, outputStream *st ) const { | |
| 1692 char buf[80], buf2[80]; | |
| 1693 if (_lo == min_jlong && _hi == max_jlong) | |
| 1694 st->print("long"); | |
| 1695 else if (is_con()) | |
| 1696 st->print("long:%s", longname(buf, get_con())); | |
| 1697 else if (_hi == max_jlong) | |
| 1698 st->print("long:>=%s", longname(buf, _lo)); | |
| 1699 else if (_lo == min_jlong) | |
| 1700 st->print("long:<=%s", longname(buf, _hi)); | |
| 1701 else | |
| 1702 st->print("long:%s..%s", longname(buf, _lo), longname(buf2, _hi)); | |
| 1703 | |
| 1704 if (_widen != 0 && this != TypeLong::LONG) | |
| 1705 st->print(":%.*s", _widen, "wwww"); | |
| 1706 } | |
| 1707 #endif | |
| 1708 | |
| 1709 //------------------------------singleton-------------------------------------- | |
| 1710 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple | |
| 1711 // constants | |
| 1712 bool TypeLong::singleton(void) const { | |
| 1713 return _lo >= _hi; | |
| 1714 } | |
| 1715 | |
| 1716 bool TypeLong::empty(void) const { | |
| 1717 return _lo > _hi; | |
| 1718 } | |
| 1719 | |
| 1720 //============================================================================= | |
| 1721 // Convenience common pre-built types. | |
| 1722 const TypeTuple *TypeTuple::IFBOTH; // Return both arms of IF as reachable | |
| 1723 const TypeTuple *TypeTuple::IFFALSE; | |
| 1724 const TypeTuple *TypeTuple::IFTRUE; | |
| 1725 const TypeTuple *TypeTuple::IFNEITHER; | |
| 1726 const TypeTuple *TypeTuple::LOOPBODY; | |
| 1727 const TypeTuple *TypeTuple::MEMBAR; | |
| 1728 const TypeTuple *TypeTuple::STORECONDITIONAL; | |
| 1729 const TypeTuple *TypeTuple::START_I2C; | |
| 1730 const TypeTuple *TypeTuple::INT_PAIR; | |
| 1731 const TypeTuple *TypeTuple::LONG_PAIR; | |
| 12323 | 1732 const TypeTuple *TypeTuple::INT_CC_PAIR; |
|
12972
59e8ad757e19
8026844: Various Math functions needs intrinsification
rbackman
parents:
12966
diff
changeset
|
1733 const TypeTuple *TypeTuple::LONG_CC_PAIR; |
| 0 | 1734 |
| 1735 | |
| 1736 //------------------------------make------------------------------------------- | |
| 1737 // Make a TypeTuple from the range of a method signature | |
| 1738 const TypeTuple *TypeTuple::make_range(ciSignature* sig) { | |
| 1739 ciType* return_type = sig->return_type(); | |
| 1740 uint total_fields = TypeFunc::Parms + return_type->size(); | |
| 1741 const Type **field_array = fields(total_fields); | |
| 1742 switch (return_type->basic_type()) { | |
| 1743 case T_LONG: | |
| 1744 field_array[TypeFunc::Parms] = TypeLong::LONG; | |
| 1745 field_array[TypeFunc::Parms+1] = Type::HALF; | |
| 1746 break; | |
| 1747 case T_DOUBLE: | |
| 1748 field_array[TypeFunc::Parms] = Type::DOUBLE; | |
| 1749 field_array[TypeFunc::Parms+1] = Type::HALF; | |
| 1750 break; | |
| 1751 case T_OBJECT: | |
| 1752 case T_ARRAY: | |
| 1753 case T_BOOLEAN: | |
| 1754 case T_CHAR: | |
| 1755 case T_FLOAT: | |
| 1756 case T_BYTE: | |
| 1757 case T_SHORT: | |
| 1758 case T_INT: | |
| 1759 field_array[TypeFunc::Parms] = get_const_type(return_type); | |
| 1760 break; | |
| 1761 case T_VOID: | |
| 1762 break; | |
| 1763 default: | |
| 1764 ShouldNotReachHere(); | |
| 1765 } | |
| 1766 return (TypeTuple*)(new TypeTuple(total_fields,field_array))->hashcons(); | |
| 1767 } | |
| 1768 | |
| 1769 // Make a TypeTuple from the domain of a method signature | |
| 1770 const TypeTuple *TypeTuple::make_domain(ciInstanceKlass* recv, ciSignature* sig) { | |
| 1771 uint total_fields = TypeFunc::Parms + sig->size(); | |
| 1772 | |
| 1773 uint pos = TypeFunc::Parms; | |
| 1774 const Type **field_array; | |
| 1775 if (recv != NULL) { | |
| 1776 total_fields++; | |
| 1777 field_array = fields(total_fields); | |
| 1778 // Use get_const_type here because it respects UseUniqueSubclasses: | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
1779 field_array[pos++] = get_const_type(recv)->join_speculative(TypePtr::NOTNULL); |
| 0 | 1780 } else { |
| 1781 field_array = fields(total_fields); | |
| 1782 } | |
| 1783 | |
| 1784 int i = 0; | |
| 1785 while (pos < total_fields) { | |
| 1786 ciType* type = sig->type_at(i); | |
| 1787 | |
| 1788 switch (type->basic_type()) { | |
| 1789 case T_LONG: | |
| 1790 field_array[pos++] = TypeLong::LONG; | |
| 1791 field_array[pos++] = Type::HALF; | |
| 1792 break; | |
| 1793 case T_DOUBLE: | |
| 1794 field_array[pos++] = Type::DOUBLE; | |
| 1795 field_array[pos++] = Type::HALF; | |
| 1796 break; | |
| 1797 case T_OBJECT: | |
| 1798 case T_ARRAY: | |
| 23614 | 1799 case T_FLOAT: |
| 1800 case T_INT: | |
| 1801 field_array[pos++] = get_const_type(type); | |
| 1802 break; | |
| 0 | 1803 case T_BOOLEAN: |
| 1804 case T_CHAR: | |
| 1805 case T_BYTE: | |
| 1806 case T_SHORT: | |
| 23614 | 1807 field_array[pos++] = TypeInt::INT; |
| 0 | 1808 break; |
| 1809 default: | |
| 1810 ShouldNotReachHere(); | |
| 1811 } | |
| 1812 i++; | |
| 1813 } | |
| 1814 return (TypeTuple*)(new TypeTuple(total_fields,field_array))->hashcons(); | |
| 1815 } | |
| 1816 | |
| 1817 const TypeTuple *TypeTuple::make( uint cnt, const Type **fields ) { | |
| 1818 return (TypeTuple*)(new TypeTuple(cnt,fields))->hashcons(); | |
| 1819 } | |
| 1820 | |
| 1821 //------------------------------fields----------------------------------------- | |
| 1822 // Subroutine call type with space allocated for argument types | |
| 1823 const Type **TypeTuple::fields( uint arg_cnt ) { | |
| 1824 const Type **flds = (const Type **)(Compile::current()->type_arena()->Amalloc_4((TypeFunc::Parms+arg_cnt)*sizeof(Type*) )); | |
| 1825 flds[TypeFunc::Control ] = Type::CONTROL; | |
| 1826 flds[TypeFunc::I_O ] = Type::ABIO; | |
| 1827 flds[TypeFunc::Memory ] = Type::MEMORY; | |
| 1828 flds[TypeFunc::FramePtr ] = TypeRawPtr::BOTTOM; | |
| 1829 flds[TypeFunc::ReturnAdr] = Type::RETURN_ADDRESS; | |
| 1830 | |
| 1831 return flds; | |
| 1832 } | |
| 1833 | |
| 1834 //------------------------------meet------------------------------------------- | |
| 1835 // Compute the MEET of two types. It returns a new Type object. | |
| 1836 const Type *TypeTuple::xmeet( const Type *t ) const { | |
| 1837 // Perform a fast test for common case; meeting the same types together. | |
| 1838 if( this == t ) return this; // Meeting same type-rep? | |
| 1839 | |
| 1840 // Current "this->_base" is Tuple | |
| 1841 switch (t->base()) { // switch on original type | |
| 1842 | |
| 1843 case Bottom: // Ye Olde Default | |
| 1844 return t; | |
| 1845 | |
| 1846 default: // All else is a mistake | |
| 1847 typerr(t); | |
| 1848 | |
| 1849 case Tuple: { // Meeting 2 signatures? | |
| 1850 const TypeTuple *x = t->is_tuple(); | |
| 1851 assert( _cnt == x->_cnt, "" ); | |
| 1852 const Type **fields = (const Type **)(Compile::current()->type_arena()->Amalloc_4( _cnt*sizeof(Type*) )); | |
| 1853 for( uint i=0; i<_cnt; i++ ) | |
| 1854 fields[i] = field_at(i)->xmeet( x->field_at(i) ); | |
| 1855 return TypeTuple::make(_cnt,fields); | |
| 1856 } | |
| 1857 case Top: | |
| 1858 break; | |
| 1859 } | |
| 1860 return this; // Return the double constant | |
| 1861 } | |
| 1862 | |
| 1863 //------------------------------xdual------------------------------------------ | |
| 1864 // Dual: compute field-by-field dual | |
| 1865 const Type *TypeTuple::xdual() const { | |
| 1866 const Type **fields = (const Type **)(Compile::current()->type_arena()->Amalloc_4( _cnt*sizeof(Type*) )); | |
| 1867 for( uint i=0; i<_cnt; i++ ) | |
| 1868 fields[i] = _fields[i]->dual(); | |
| 1869 return new TypeTuple(_cnt,fields); | |
| 1870 } | |
| 1871 | |
| 1872 //------------------------------eq--------------------------------------------- | |
| 1873 // Structural equality check for Type representations | |
| 1874 bool TypeTuple::eq( const Type *t ) const { | |
| 1875 const TypeTuple *s = (const TypeTuple *)t; | |
| 1876 if (_cnt != s->_cnt) return false; // Unequal field counts | |
| 1877 for (uint i = 0; i < _cnt; i++) | |
| 1878 if (field_at(i) != s->field_at(i)) // POINTER COMPARE! NO RECURSION! | |
| 1879 return false; // Missed | |
| 1880 return true; | |
| 1881 } | |
| 1882 | |
| 1883 //------------------------------hash------------------------------------------- | |
| 1884 // Type-specific hashing function. | |
| 1885 int TypeTuple::hash(void) const { | |
| 1886 intptr_t sum = _cnt; | |
| 1887 for( uint i=0; i<_cnt; i++ ) | |
| 1888 sum += (intptr_t)_fields[i]; // Hash on pointers directly | |
| 1889 return sum; | |
| 1890 } | |
| 1891 | |
| 1892 //------------------------------dump2------------------------------------------ | |
| 1893 // Dump signature Type | |
| 1894 #ifndef PRODUCT | |
| 1895 void TypeTuple::dump2( Dict &d, uint depth, outputStream *st ) const { | |
| 1896 st->print("{"); | |
| 1897 if( !depth || d[this] ) { // Check for recursive print | |
| 1898 st->print("...}"); | |
| 1899 return; | |
| 1900 } | |
| 1901 d.Insert((void*)this, (void*)this); // Stop recursion | |
| 1902 if( _cnt ) { | |
| 1903 uint i; | |
| 1904 for( i=0; i<_cnt-1; i++ ) { | |
| 1905 st->print("%d:", i); | |
| 1906 _fields[i]->dump2(d, depth-1, st); | |
| 1907 st->print(", "); | |
| 1908 } | |
| 1909 st->print("%d:", i); | |
| 1910 _fields[i]->dump2(d, depth-1, st); | |
| 1911 } | |
| 1912 st->print("}"); | |
| 1913 } | |
| 1914 #endif | |
| 1915 | |
| 1916 //------------------------------singleton-------------------------------------- | |
| 1917 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple | |
| 1918 // constants (Ldi nodes). Singletons are integer, float or double constants | |
| 1919 // or a single symbol. | |
| 1920 bool TypeTuple::singleton(void) const { | |
| 1921 return false; // Never a singleton | |
| 1922 } | |
| 1923 | |
| 1924 bool TypeTuple::empty(void) const { | |
| 1925 for( uint i=0; i<_cnt; i++ ) { | |
| 1926 if (_fields[i]->empty()) return true; | |
| 1927 } | |
| 1928 return false; | |
| 1929 } | |
| 1930 | |
| 1931 //============================================================================= | |
| 1932 // Convenience common pre-built types. | |
| 1933 | |
| 1934 inline const TypeInt* normalize_array_size(const TypeInt* size) { | |
| 1935 // Certain normalizations keep us sane when comparing types. | |
| 1936 // We do not want arrayOop variables to differ only by the wideness | |
| 1937 // of their index types. Pick minimum wideness, since that is the | |
| 1938 // forced wideness of small ranges anyway. | |
| 1939 if (size->_widen != Type::WidenMin) | |
| 1940 return TypeInt::make(size->_lo, size->_hi, Type::WidenMin); | |
| 1941 else | |
| 1942 return size; | |
| 1943 } | |
| 1944 | |
| 1945 //------------------------------make------------------------------------------- | |
|
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
1946 const TypeAry* TypeAry::make(const Type* elem, const TypeInt* size, bool stable) { |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
1947 if (UseCompressedOops && elem->isa_oopptr()) { |
|
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
183
diff
changeset
|
1948 elem = elem->make_narrowoop(); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
1949 } |
| 0 | 1950 size = normalize_array_size(size); |
|
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
1951 return (TypeAry*)(new TypeAry(elem,size,stable))->hashcons(); |
| 0 | 1952 } |
| 1953 | |
| 1954 //------------------------------meet------------------------------------------- | |
| 1955 // Compute the MEET of two types. It returns a new Type object. | |
| 1956 const Type *TypeAry::xmeet( const Type *t ) const { | |
| 1957 // Perform a fast test for common case; meeting the same types together. | |
| 1958 if( this == t ) return this; // Meeting same type-rep? | |
| 1959 | |
| 1960 // Current "this->_base" is Ary | |
| 1961 switch (t->base()) { // switch on original type | |
| 1962 | |
| 1963 case Bottom: // Ye Olde Default | |
| 1964 return t; | |
| 1965 | |
| 1966 default: // All else is a mistake | |
| 1967 typerr(t); | |
| 1968 | |
| 1969 case Array: { // Meeting 2 arrays? | |
| 1970 const TypeAry *a = t->is_ary(); | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
1971 return TypeAry::make(_elem->meet_speculative(a->_elem), |
|
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
1972 _size->xmeet(a->_size)->is_int(), |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
1973 _stable & a->_stable); |
| 0 | 1974 } |
| 1975 case Top: | |
| 1976 break; | |
| 1977 } | |
| 1978 return this; // Return the double constant | |
| 1979 } | |
| 1980 | |
| 1981 //------------------------------xdual------------------------------------------ | |
| 1982 // Dual: compute field-by-field dual | |
| 1983 const Type *TypeAry::xdual() const { | |
| 1984 const TypeInt* size_dual = _size->dual()->is_int(); | |
| 1985 size_dual = normalize_array_size(size_dual); | |
|
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
1986 return new TypeAry(_elem->dual(), size_dual, !_stable); |
| 0 | 1987 } |
| 1988 | |
| 1989 //------------------------------eq--------------------------------------------- | |
| 1990 // Structural equality check for Type representations | |
| 1991 bool TypeAry::eq( const Type *t ) const { | |
| 1992 const TypeAry *a = (const TypeAry*)t; | |
| 1993 return _elem == a->_elem && | |
|
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
1994 _stable == a->_stable && |
| 0 | 1995 _size == a->_size; |
| 1996 } | |
| 1997 | |
| 1998 //------------------------------hash------------------------------------------- | |
| 1999 // Type-specific hashing function. | |
| 2000 int TypeAry::hash(void) const { | |
|
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
2001 return (intptr_t)_elem + (intptr_t)_size + (_stable ? 43 : 0); |
| 0 | 2002 } |
| 2003 | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2004 /** |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2005 * Return same type without a speculative part in the element |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2006 */ |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2007 const Type* TypeAry::remove_speculative() const { |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2008 return make(_elem->remove_speculative(), _size, _stable); |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2009 } |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2010 |
|
820
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
2011 //----------------------interface_vs_oop--------------------------------------- |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
2012 #ifdef ASSERT |
|
23293
071a85b9e631
Fix interface_vs_oop assertion logic for array types
Tom Rodriguez <tom.rodriguez@oracle.com>
parents:
23286
diff
changeset
|
2013 bool TypeAry::interface_vs_oop_helper(const Type *t) const { |
|
820
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
2014 const TypeAry* t_ary = t->is_ary(); |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
2015 if (t_ary) { |
|
23849
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2016 const TypePtr* this_ptr = _elem->make_ptr(); // In case we have narrow_oops |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2017 const TypePtr* t_ptr = t_ary->_elem->make_ptr(); |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2018 if(this_ptr != NULL && t_ptr != NULL) { |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2019 return this_ptr->interface_vs_oop(t_ptr); |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2020 } |
|
820
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
2021 } |
|
23293
071a85b9e631
Fix interface_vs_oop assertion logic for array types
Tom Rodriguez <tom.rodriguez@oracle.com>
parents:
23286
diff
changeset
|
2022 return Type::interface_vs_oop_helper(t); |
|
820
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
2023 } |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
2024 #endif |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
2025 |
| 0 | 2026 //------------------------------dump2------------------------------------------ |
| 2027 #ifndef PRODUCT | |
| 2028 void TypeAry::dump2( Dict &d, uint depth, outputStream *st ) const { | |
|
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
2029 if (_stable) st->print("stable:"); |
| 0 | 2030 _elem->dump2(d, depth, st); |
| 2031 st->print("["); | |
| 2032 _size->dump2(d, depth, st); | |
| 2033 st->print("]"); | |
| 2034 } | |
| 2035 #endif | |
| 2036 | |
| 2037 //------------------------------singleton-------------------------------------- | |
| 2038 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple | |
| 2039 // constants (Ldi nodes). Singletons are integer, float or double constants | |
| 2040 // or a single symbol. | |
| 2041 bool TypeAry::singleton(void) const { | |
| 2042 return false; // Never a singleton | |
| 2043 } | |
| 2044 | |
| 2045 bool TypeAry::empty(void) const { | |
| 2046 return _elem->empty() || _size->empty(); | |
| 2047 } | |
| 2048 | |
| 2049 //--------------------------ary_must_be_exact---------------------------------- | |
| 2050 bool TypeAry::ary_must_be_exact() const { | |
| 2051 if (!UseExactTypes) return false; | |
| 2052 // This logic looks at the element type of an array, and returns true | |
| 2053 // if the element type is either a primitive or a final instance class. | |
| 2054 // In such cases, an array built on this ary must have no subclasses. | |
| 2055 if (_elem == BOTTOM) return false; // general array not exact | |
| 2056 if (_elem == TOP ) return false; // inverted general array not exact | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
2057 const TypeOopPtr* toop = NULL; |
|
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
183
diff
changeset
|
2058 if (UseCompressedOops && _elem->isa_narrowoop()) { |
|
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
183
diff
changeset
|
2059 toop = _elem->make_ptr()->isa_oopptr(); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
2060 } else { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
2061 toop = _elem->isa_oopptr(); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
2062 } |
| 0 | 2063 if (!toop) return true; // a primitive type, like int |
| 2064 ciKlass* tklass = toop->klass(); | |
| 2065 if (tklass == NULL) return false; // unloaded class | |
| 2066 if (!tklass->is_loaded()) return false; // unloaded class | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
2067 const TypeInstPtr* tinst; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
2068 if (_elem->isa_narrowoop()) |
|
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
183
diff
changeset
|
2069 tinst = _elem->make_ptr()->isa_instptr(); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
2070 else |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
2071 tinst = _elem->isa_instptr(); |
|
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
183
diff
changeset
|
2072 if (tinst) |
|
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
183
diff
changeset
|
2073 return tklass->as_instance_klass()->is_final(); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
2074 const TypeAryPtr* tap; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
2075 if (_elem->isa_narrowoop()) |
|
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
183
diff
changeset
|
2076 tap = _elem->make_ptr()->isa_aryptr(); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
2077 else |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
2078 tap = _elem->isa_aryptr(); |
|
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
183
diff
changeset
|
2079 if (tap) |
|
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
183
diff
changeset
|
2080 return tap->ary()->ary_must_be_exact(); |
| 0 | 2081 return false; |
| 2082 } | |
| 2083 | |
|
6179
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2084 //==============================TypeVect======================================= |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2085 // Convenience common pre-built types. |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2086 const TypeVect *TypeVect::VECTS = NULL; // 32-bit vectors |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2087 const TypeVect *TypeVect::VECTD = NULL; // 64-bit vectors |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2088 const TypeVect *TypeVect::VECTX = NULL; // 128-bit vectors |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2089 const TypeVect *TypeVect::VECTY = NULL; // 256-bit vectors |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2090 |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2091 //------------------------------make------------------------------------------- |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2092 const TypeVect* TypeVect::make(const Type *elem, uint length) { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2093 BasicType elem_bt = elem->array_element_basic_type(); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2094 assert(is_java_primitive(elem_bt), "only primitive types in vector"); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2095 assert(length > 1 && is_power_of_2(length), "vector length is power of 2"); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2096 assert(Matcher::vector_size_supported(elem_bt, length), "length in range"); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2097 int size = length * type2aelembytes(elem_bt); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2098 switch (Matcher::vector_ideal_reg(size)) { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2099 case Op_VecS: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2100 return (TypeVect*)(new TypeVectS(elem, length))->hashcons(); |
|
14437
15120a36272d
8028767: PPC64: (part 121): smaller shared changes needed to build C2
goetz
parents:
13014
diff
changeset
|
2101 case Op_RegL: |
|
6179
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2102 case Op_VecD: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2103 case Op_RegD: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2104 return (TypeVect*)(new TypeVectD(elem, length))->hashcons(); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2105 case Op_VecX: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2106 return (TypeVect*)(new TypeVectX(elem, length))->hashcons(); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2107 case Op_VecY: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2108 return (TypeVect*)(new TypeVectY(elem, length))->hashcons(); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2109 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2110 ShouldNotReachHere(); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2111 return NULL; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2112 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2113 |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2114 //------------------------------meet------------------------------------------- |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2115 // Compute the MEET of two types. It returns a new Type object. |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2116 const Type *TypeVect::xmeet( const Type *t ) const { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2117 // Perform a fast test for common case; meeting the same types together. |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2118 if( this == t ) return this; // Meeting same type-rep? |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2119 |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2120 // Current "this->_base" is Vector |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2121 switch (t->base()) { // switch on original type |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2122 |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2123 case Bottom: // Ye Olde Default |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2124 return t; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2125 |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2126 default: // All else is a mistake |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2127 typerr(t); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2128 |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2129 case VectorS: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2130 case VectorD: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2131 case VectorX: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2132 case VectorY: { // Meeting 2 vectors? |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2133 const TypeVect* v = t->is_vect(); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2134 assert( base() == v->base(), ""); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2135 assert(length() == v->length(), ""); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2136 assert(element_basic_type() == v->element_basic_type(), ""); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2137 return TypeVect::make(_elem->xmeet(v->_elem), _length); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2138 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2139 case Top: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2140 break; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2141 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2142 return this; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2143 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2144 |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2145 //------------------------------xdual------------------------------------------ |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2146 // Dual: compute field-by-field dual |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2147 const Type *TypeVect::xdual() const { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2148 return new TypeVect(base(), _elem->dual(), _length); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2149 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2150 |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2151 //------------------------------eq--------------------------------------------- |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2152 // Structural equality check for Type representations |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2153 bool TypeVect::eq(const Type *t) const { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2154 const TypeVect *v = t->is_vect(); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2155 return (_elem == v->_elem) && (_length == v->_length); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2156 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2157 |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2158 //------------------------------hash------------------------------------------- |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2159 // Type-specific hashing function. |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2160 int TypeVect::hash(void) const { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2161 return (intptr_t)_elem + (intptr_t)_length; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2162 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2163 |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2164 //------------------------------singleton-------------------------------------- |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2165 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2166 // constants (Ldi nodes). Vector is singleton if all elements are the same |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2167 // constant value (when vector is created with Replicate code). |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2168 bool TypeVect::singleton(void) const { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2169 // There is no Con node for vectors yet. |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2170 // return _elem->singleton(); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2171 return false; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2172 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2173 |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2174 bool TypeVect::empty(void) const { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2175 return _elem->empty(); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2176 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2177 |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2178 //------------------------------dump2------------------------------------------ |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2179 #ifndef PRODUCT |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2180 void TypeVect::dump2(Dict &d, uint depth, outputStream *st) const { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2181 switch (base()) { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2182 case VectorS: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2183 st->print("vectors["); break; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2184 case VectorD: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2185 st->print("vectord["); break; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2186 case VectorX: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2187 st->print("vectorx["); break; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2188 case VectorY: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2189 st->print("vectory["); break; |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2190 default: |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2191 ShouldNotReachHere(); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2192 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2193 st->print("%d]:{", _length); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2194 _elem->dump2(d, depth, st); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2195 st->print("}"); |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2196 } |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2197 #endif |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2198 |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
2376
diff
changeset
|
2199 |
| 0 | 2200 //============================================================================= |
| 2201 // Convenience common pre-built types. | |
| 2202 const TypePtr *TypePtr::NULL_PTR; | |
| 2203 const TypePtr *TypePtr::NOTNULL; | |
| 2204 const TypePtr *TypePtr::BOTTOM; | |
| 2205 | |
| 2206 //------------------------------meet------------------------------------------- | |
| 2207 // Meet over the PTR enum | |
| 2208 const TypePtr::PTR TypePtr::ptr_meet[TypePtr::lastPTR][TypePtr::lastPTR] = { | |
| 2209 // TopPTR, AnyNull, Constant, Null, NotNull, BotPTR, | |
| 2210 { /* Top */ TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,}, | |
| 2211 { /* AnyNull */ AnyNull, AnyNull, Constant, BotPTR, NotNull, BotPTR,}, | |
| 2212 { /* Constant*/ Constant, Constant, Constant, BotPTR, NotNull, BotPTR,}, | |
| 2213 { /* Null */ Null, BotPTR, BotPTR, Null, BotPTR, BotPTR,}, | |
| 2214 { /* NotNull */ NotNull, NotNull, NotNull, BotPTR, NotNull, BotPTR,}, | |
| 2215 { /* BotPTR */ BotPTR, BotPTR, BotPTR, BotPTR, BotPTR, BotPTR,} | |
| 2216 }; | |
| 2217 | |
| 2218 //------------------------------make------------------------------------------- | |
| 2219 const TypePtr *TypePtr::make( TYPES t, enum PTR ptr, int offset ) { | |
| 2220 return (TypePtr*)(new TypePtr(t,ptr,offset))->hashcons(); | |
| 2221 } | |
| 2222 | |
| 2223 //------------------------------cast_to_ptr_type------------------------------- | |
| 2224 const Type *TypePtr::cast_to_ptr_type(PTR ptr) const { | |
| 2225 assert(_base == AnyPtr, "subclass must override cast_to_ptr_type"); | |
| 2226 if( ptr == _ptr ) return this; | |
| 2227 return make(_base, ptr, _offset); | |
| 2228 } | |
| 2229 | |
| 2230 //------------------------------get_con---------------------------------------- | |
| 2231 intptr_t TypePtr::get_con() const { | |
| 2232 assert( _ptr == Null, "" ); | |
| 2233 return _offset; | |
| 2234 } | |
| 2235 | |
| 2236 //------------------------------meet------------------------------------------- | |
| 2237 // Compute the MEET of two types. It returns a new Type object. | |
| 2238 const Type *TypePtr::xmeet( const Type *t ) const { | |
| 2239 // Perform a fast test for common case; meeting the same types together. | |
| 2240 if( this == t ) return this; // Meeting same type-rep? | |
| 2241 | |
| 2242 // Current "this->_base" is AnyPtr | |
| 2243 switch (t->base()) { // switch on original type | |
| 2244 case Int: // Mixing ints & oops happens when javac | |
| 2245 case Long: // reuses local variables | |
| 2246 case FloatTop: | |
| 2247 case FloatCon: | |
| 2248 case FloatBot: | |
| 2249 case DoubleTop: | |
| 2250 case DoubleCon: | |
| 2251 case DoubleBot: | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
2252 case NarrowOop: |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
2253 case NarrowKlass: |
| 0 | 2254 case Bottom: // Ye Olde Default |
| 2255 return Type::BOTTOM; | |
| 2256 case Top: | |
| 2257 return this; | |
| 2258 | |
| 2259 case AnyPtr: { // Meeting to AnyPtrs | |
| 2260 const TypePtr *tp = t->is_ptr(); | |
| 2261 return make( AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()) ); | |
| 2262 } | |
| 2263 case RawPtr: // For these, flip the call around to cut down | |
| 2264 case OopPtr: | |
| 2265 case InstPtr: // on the cases I have to handle. | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2266 case AryPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2267 case MetadataPtr: |
| 0 | 2268 case KlassPtr: |
| 2269 return t->xmeet(this); // Call in reverse direction | |
| 2270 default: // All else is a mistake | |
| 2271 typerr(t); | |
| 2272 | |
| 2273 } | |
| 2274 return this; | |
| 2275 } | |
| 2276 | |
| 2277 //------------------------------meet_offset------------------------------------ | |
| 2278 int TypePtr::meet_offset( int offset ) const { | |
| 2279 // Either is 'TOP' offset? Return the other offset! | |
| 2280 if( _offset == OffsetTop ) return offset; | |
| 2281 if( offset == OffsetTop ) return _offset; | |
| 2282 // If either is different, return 'BOTTOM' offset | |
| 2283 if( _offset != offset ) return OffsetBot; | |
| 2284 return _offset; | |
| 2285 } | |
| 2286 | |
| 2287 //------------------------------dual_offset------------------------------------ | |
| 2288 int TypePtr::dual_offset( ) const { | |
| 2289 if( _offset == OffsetTop ) return OffsetBot;// Map 'TOP' into 'BOTTOM' | |
| 2290 if( _offset == OffsetBot ) return OffsetTop;// Map 'BOTTOM' into 'TOP' | |
| 2291 return _offset; // Map everything else into self | |
| 2292 } | |
| 2293 | |
| 2294 //------------------------------xdual------------------------------------------ | |
| 2295 // Dual: compute field-by-field dual | |
| 2296 const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = { | |
| 2297 BotPTR, NotNull, Constant, Null, AnyNull, TopPTR | |
| 2298 }; | |
| 2299 const Type *TypePtr::xdual() const { | |
| 2300 return new TypePtr( AnyPtr, dual_ptr(), dual_offset() ); | |
| 2301 } | |
| 2302 | |
|
306
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2303 //------------------------------xadd_offset------------------------------------ |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2304 int TypePtr::xadd_offset( intptr_t offset ) const { |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2305 // Adding to 'TOP' offset? Return 'TOP'! |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2306 if( _offset == OffsetTop || offset == OffsetTop ) return OffsetTop; |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2307 // Adding to 'BOTTOM' offset? Return 'BOTTOM'! |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2308 if( _offset == OffsetBot || offset == OffsetBot ) return OffsetBot; |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2309 // Addition overflows or "accidentally" equals to OffsetTop? Return 'BOTTOM'! |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2310 offset += (intptr_t)_offset; |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2311 if (offset != (int)offset || offset == OffsetTop) return OffsetBot; |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2312 |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2313 // assert( _offset >= 0 && _offset+offset >= 0, "" ); |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2314 // It is possible to construct a negative offset during PhaseCCP |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2315 |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2316 return (int)offset; // Sum valid offsets |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2317 } |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2318 |
| 0 | 2319 //------------------------------add_offset------------------------------------- |
|
306
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2320 const TypePtr *TypePtr::add_offset( intptr_t offset ) const { |
|
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2321 return make( AnyPtr, _ptr, xadd_offset(offset) ); |
| 0 | 2322 } |
| 2323 | |
| 2324 //------------------------------eq--------------------------------------------- | |
| 2325 // Structural equality check for Type representations | |
| 2326 bool TypePtr::eq( const Type *t ) const { | |
| 2327 const TypePtr *a = (const TypePtr*)t; | |
| 2328 return _ptr == a->ptr() && _offset == a->offset(); | |
| 2329 } | |
| 2330 | |
| 2331 //------------------------------hash------------------------------------------- | |
| 2332 // Type-specific hashing function. | |
| 2333 int TypePtr::hash(void) const { | |
| 2334 return _ptr + _offset; | |
| 2335 } | |
| 2336 | |
| 2337 //------------------------------dump2------------------------------------------ | |
| 2338 const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = { | |
| 2339 "TopPTR","AnyNull","Constant","NULL","NotNull","BotPTR" | |
| 2340 }; | |
| 2341 | |
| 2342 #ifndef PRODUCT | |
| 2343 void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const { | |
| 2344 if( _ptr == Null ) st->print("NULL"); | |
| 2345 else st->print("%s *", ptr_msg[_ptr]); | |
| 2346 if( _offset == OffsetTop ) st->print("+top"); | |
| 2347 else if( _offset == OffsetBot ) st->print("+bot"); | |
| 2348 else if( _offset ) st->print("+%d", _offset); | |
| 2349 } | |
| 2350 #endif | |
| 2351 | |
| 2352 //------------------------------singleton-------------------------------------- | |
| 2353 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple | |
| 2354 // constants | |
| 2355 bool TypePtr::singleton(void) const { | |
| 2356 // TopPTR, Null, AnyNull, Constant are all singletons | |
| 2357 return (_offset != OffsetBot) && !below_centerline(_ptr); | |
| 2358 } | |
| 2359 | |
| 2360 bool TypePtr::empty(void) const { | |
| 2361 return (_offset == OffsetTop) || above_centerline(_ptr); | |
| 2362 } | |
| 2363 | |
| 2364 //============================================================================= | |
| 2365 // Convenience common pre-built types. | |
| 2366 const TypeRawPtr *TypeRawPtr::BOTTOM; | |
| 2367 const TypeRawPtr *TypeRawPtr::NOTNULL; | |
| 2368 | |
| 2369 //------------------------------make------------------------------------------- | |
| 2370 const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) { | |
| 2371 assert( ptr != Constant, "what is the constant?" ); | |
| 2372 assert( ptr != Null, "Use TypePtr for NULL" ); | |
| 2373 return (TypeRawPtr*)(new TypeRawPtr(ptr,0))->hashcons(); | |
| 2374 } | |
| 2375 | |
| 2376 const TypeRawPtr *TypeRawPtr::make( address bits ) { | |
| 2377 assert( bits, "Use TypePtr for NULL" ); | |
| 2378 return (TypeRawPtr*)(new TypeRawPtr(Constant,bits))->hashcons(); | |
| 2379 } | |
| 2380 | |
| 2381 //------------------------------cast_to_ptr_type------------------------------- | |
| 2382 const Type *TypeRawPtr::cast_to_ptr_type(PTR ptr) const { | |
| 2383 assert( ptr != Constant, "what is the constant?" ); | |
| 2384 assert( ptr != Null, "Use TypePtr for NULL" ); | |
| 2385 assert( _bits==0, "Why cast a constant address?"); | |
| 2386 if( ptr == _ptr ) return this; | |
| 2387 return make(ptr); | |
| 2388 } | |
| 2389 | |
| 2390 //------------------------------get_con---------------------------------------- | |
| 2391 intptr_t TypeRawPtr::get_con() const { | |
| 2392 assert( _ptr == Null || _ptr == Constant, "" ); | |
| 2393 return (intptr_t)_bits; | |
| 2394 } | |
| 2395 | |
| 2396 //------------------------------meet------------------------------------------- | |
| 2397 // Compute the MEET of two types. It returns a new Type object. | |
| 2398 const Type *TypeRawPtr::xmeet( const Type *t ) const { | |
| 2399 // Perform a fast test for common case; meeting the same types together. | |
| 2400 if( this == t ) return this; // Meeting same type-rep? | |
| 2401 | |
| 2402 // Current "this->_base" is RawPtr | |
| 2403 switch( t->base() ) { // switch on original type | |
| 2404 case Bottom: // Ye Olde Default | |
| 2405 return t; | |
| 2406 case Top: | |
| 2407 return this; | |
| 2408 case AnyPtr: // Meeting to AnyPtrs | |
| 2409 break; | |
| 2410 case RawPtr: { // might be top, bot, any/not or constant | |
| 2411 enum PTR tptr = t->is_ptr()->ptr(); | |
| 2412 enum PTR ptr = meet_ptr( tptr ); | |
| 2413 if( ptr == Constant ) { // Cannot be equal constants, so... | |
| 2414 if( tptr == Constant && _ptr != Constant) return t; | |
| 2415 if( _ptr == Constant && tptr != Constant) return this; | |
| 2416 ptr = NotNull; // Fall down in lattice | |
| 2417 } | |
| 2418 return make( ptr ); | |
| 2419 } | |
| 2420 | |
| 2421 case OopPtr: | |
| 2422 case InstPtr: | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2423 case AryPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2424 case MetadataPtr: |
| 0 | 2425 case KlassPtr: |
| 2426 return TypePtr::BOTTOM; // Oop meet raw is not well defined | |
| 2427 default: // All else is a mistake | |
| 2428 typerr(t); | |
| 2429 } | |
| 2430 | |
| 2431 // Found an AnyPtr type vs self-RawPtr type | |
| 2432 const TypePtr *tp = t->is_ptr(); | |
| 2433 switch (tp->ptr()) { | |
| 2434 case TypePtr::TopPTR: return this; | |
| 2435 case TypePtr::BotPTR: return t; | |
| 2436 case TypePtr::Null: | |
| 2437 if( _ptr == TypePtr::TopPTR ) return t; | |
| 2438 return TypeRawPtr::BOTTOM; | |
| 2439 case TypePtr::NotNull: return TypePtr::make( AnyPtr, meet_ptr(TypePtr::NotNull), tp->meet_offset(0) ); | |
| 2440 case TypePtr::AnyNull: | |
| 2441 if( _ptr == TypePtr::Constant) return this; | |
| 2442 return make( meet_ptr(TypePtr::AnyNull) ); | |
| 2443 default: ShouldNotReachHere(); | |
| 2444 } | |
| 2445 return this; | |
| 2446 } | |
| 2447 | |
| 2448 //------------------------------xdual------------------------------------------ | |
| 2449 // Dual: compute field-by-field dual | |
| 2450 const Type *TypeRawPtr::xdual() const { | |
| 2451 return new TypeRawPtr( dual_ptr(), _bits ); | |
| 2452 } | |
| 2453 | |
| 2454 //------------------------------add_offset------------------------------------- | |
|
306
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
2455 const TypePtr *TypeRawPtr::add_offset( intptr_t offset ) const { |
| 0 | 2456 if( offset == OffsetTop ) return BOTTOM; // Undefined offset-> undefined pointer |
| 2457 if( offset == OffsetBot ) return BOTTOM; // Unknown offset-> unknown pointer | |
| 2458 if( offset == 0 ) return this; // No change | |
| 2459 switch (_ptr) { | |
| 2460 case TypePtr::TopPTR: | |
| 2461 case TypePtr::BotPTR: | |
| 2462 case TypePtr::NotNull: | |
| 2463 return this; | |
| 2464 case TypePtr::Null: | |
|
2115
78e248949382
6876037: CTW fails jdk7/hotspot/src/share/vm/opto/type.cpp:2055. assert(bits,"Use TypePtr for NULL")
kvn
parents:
1972
diff
changeset
|
2465 case TypePtr::Constant: { |
|
78e248949382
6876037: CTW fails jdk7/hotspot/src/share/vm/opto/type.cpp:2055. assert(bits,"Use TypePtr for NULL")
kvn
parents:
1972
diff
changeset
|
2466 address bits = _bits+offset; |
|
78e248949382
6876037: CTW fails jdk7/hotspot/src/share/vm/opto/type.cpp:2055. assert(bits,"Use TypePtr for NULL")
kvn
parents:
1972
diff
changeset
|
2467 if ( bits == 0 ) return TypePtr::NULL_PTR; |
|
78e248949382
6876037: CTW fails jdk7/hotspot/src/share/vm/opto/type.cpp:2055. assert(bits,"Use TypePtr for NULL")
kvn
parents:
1972
diff
changeset
|
2468 return make( bits ); |
|
78e248949382
6876037: CTW fails jdk7/hotspot/src/share/vm/opto/type.cpp:2055. assert(bits,"Use TypePtr for NULL")
kvn
parents:
1972
diff
changeset
|
2469 } |
| 0 | 2470 default: ShouldNotReachHere(); |
| 2471 } | |
| 2472 return NULL; // Lint noise | |
| 2473 } | |
| 2474 | |
| 2475 //------------------------------eq--------------------------------------------- | |
| 2476 // Structural equality check for Type representations | |
| 2477 bool TypeRawPtr::eq( const Type *t ) const { | |
| 2478 const TypeRawPtr *a = (const TypeRawPtr*)t; | |
| 2479 return _bits == a->_bits && TypePtr::eq(t); | |
| 2480 } | |
| 2481 | |
| 2482 //------------------------------hash------------------------------------------- | |
| 2483 // Type-specific hashing function. | |
| 2484 int TypeRawPtr::hash(void) const { | |
| 2485 return (intptr_t)_bits + TypePtr::hash(); | |
| 2486 } | |
| 2487 | |
| 2488 //------------------------------dump2------------------------------------------ | |
| 2489 #ifndef PRODUCT | |
| 2490 void TypeRawPtr::dump2( Dict &d, uint depth, outputStream *st ) const { | |
| 2491 if( _ptr == Constant ) | |
| 2492 st->print(INTPTR_FORMAT, _bits); | |
| 2493 else | |
| 2494 st->print("rawptr:%s", ptr_msg[_ptr]); | |
| 2495 } | |
| 2496 #endif | |
| 2497 | |
| 2498 //============================================================================= | |
| 2499 // Convenience common pre-built type. | |
| 2500 const TypeOopPtr *TypeOopPtr::BOTTOM; | |
| 2501 | |
| 163 | 2502 //------------------------------TypeOopPtr------------------------------------- |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2503 TypeOopPtr::TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, bool xk, ciObject* o, int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth) |
| 163 | 2504 : TypePtr(t, ptr, offset), |
| 2505 _const_oop(o), _klass(k), | |
| 2506 _klass_is_exact(xk), | |
| 2507 _is_ptr_to_narrowoop(false), | |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
2508 _is_ptr_to_narrowklass(false), |
| 10278 | 2509 _is_ptr_to_boxed_value(false), |
| 12966 | 2510 _instance_id(instance_id), |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2511 _speculative(speculative), |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2512 _inline_depth(inline_depth){ |
| 10278 | 2513 if (Compile::current()->eliminate_boxing() && (t == InstPtr) && |
| 2514 (offset > 0) && xk && (k != 0) && k->is_instance_klass()) { | |
| 2515 _is_ptr_to_boxed_value = k->as_instance_klass()->is_boxed_value_offset(offset); | |
| 2516 } | |
| 163 | 2517 #ifdef _LP64 |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
2518 if (_offset != 0) { |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2519 if (_offset == oopDesc::klass_offset_in_bytes()) { |
|
12226
7944aba7ba41
8015107: NPG: Use consistent naming for metaspace concepts
ehelin
parents:
10278
diff
changeset
|
2520 _is_ptr_to_narrowklass = UseCompressedClassPointers; |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2521 } else if (klass() == NULL) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2522 // Array with unknown body type |
| 163 | 2523 assert(this->isa_aryptr(), "only arrays without klass"); |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
2524 _is_ptr_to_narrowoop = UseCompressedOops; |
| 163 | 2525 } else if (this->isa_aryptr()) { |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
2526 _is_ptr_to_narrowoop = (UseCompressedOops && klass()->is_obj_array_klass() && |
| 163 | 2527 _offset != arrayOopDesc::length_offset_in_bytes()); |
| 2528 } else if (klass()->is_instance_klass()) { | |
| 2529 ciInstanceKlass* ik = klass()->as_instance_klass(); | |
| 2530 ciField* field = NULL; | |
| 2531 if (this->isa_klassptr()) { | |
|
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2532 // Perm objects don't use compressed references |
| 163 | 2533 } else if (_offset == OffsetBot || _offset == OffsetTop) { |
| 2534 // unsafe access | |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
2535 _is_ptr_to_narrowoop = UseCompressedOops; |
| 163 | 2536 } else { // exclude unsafe ops |
| 2537 assert(this->isa_instptr(), "must be an instance ptr."); | |
|
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2538 |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2539 if (klass() == ciEnv::current()->Class_klass() && |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2540 (_offset == java_lang_Class::klass_offset_in_bytes() || |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2541 _offset == java_lang_Class::array_klass_offset_in_bytes())) { |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2542 // Special hidden fields from the Class. |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2543 assert(this->isa_instptr(), "must be an instance ptr."); |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2544 _is_ptr_to_narrowoop = false; |
|
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2545 } else if (klass() == ciEnv::current()->Class_klass() && |
|
6735
aed758eda82a
7195833: NPG: Rename instanceClassLoaderKlass, instanceRefKlass and instanceMirrorKlass
coleenp
parents:
6728
diff
changeset
|
2546 _offset >= InstanceMirrorKlass::offset_of_static_fields()) { |
|
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2547 // Static fields |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2548 assert(o != NULL, "must be constant"); |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2549 ciInstanceKlass* k = o->as_instance()->java_lang_Class_klass()->as_instance_klass(); |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2550 ciField* field = k->get_field_by_offset(_offset, true); |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2551 assert(field != NULL, "missing field"); |
| 163 | 2552 BasicType basic_elem_type = field->layout_type(); |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
2553 _is_ptr_to_narrowoop = UseCompressedOops && (basic_elem_type == T_OBJECT || |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
2554 basic_elem_type == T_ARRAY); |
| 163 | 2555 } else { |
|
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2556 // Instance fields which contains a compressed oop references. |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2557 field = ik->get_field_by_offset(_offset, false); |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2558 if (field != NULL) { |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2559 BasicType basic_elem_type = field->layout_type(); |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
2560 _is_ptr_to_narrowoop = UseCompressedOops && (basic_elem_type == T_OBJECT || |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
2561 basic_elem_type == T_ARRAY); |
|
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2562 } else if (klass()->equals(ciEnv::current()->Object_klass())) { |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2563 // Compile::find_alias_type() cast exactness on all types to verify |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2564 // that it does not affect alias type. |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
2565 _is_ptr_to_narrowoop = UseCompressedOops; |
|
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2566 } else { |
|
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2567 // Type for the copy start in LibraryCallKit::inline_native_clone(). |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
2568 _is_ptr_to_narrowoop = UseCompressedOops; |
|
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2354
diff
changeset
|
2569 } |
| 163 | 2570 } |
| 2571 } | |
| 2572 } | |
| 2573 } | |
| 2574 #endif | |
| 2575 } | |
| 2576 | |
| 0 | 2577 //------------------------------make------------------------------------------- |
| 2578 const TypeOopPtr *TypeOopPtr::make(PTR ptr, | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2579 int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth) { |
| 0 | 2580 assert(ptr != Constant, "no constant generic pointers"); |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2581 ciKlass* k = Compile::current()->env()->Object_klass(); |
| 0 | 2582 bool xk = false; |
| 2583 ciObject* o = NULL; | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2584 return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, xk, o, offset, instance_id, speculative, inline_depth))->hashcons(); |
| 0 | 2585 } |
| 2586 | |
| 2587 | |
| 2588 //------------------------------cast_to_ptr_type------------------------------- | |
| 2589 const Type *TypeOopPtr::cast_to_ptr_type(PTR ptr) const { | |
| 2590 assert(_base == OopPtr, "subclass must override cast_to_ptr_type"); | |
| 2591 if( ptr == _ptr ) return this; | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2592 return make(ptr, _offset, _instance_id, _speculative, _inline_depth); |
| 0 | 2593 } |
| 2594 | |
| 247 | 2595 //-----------------------------cast_to_instance_id---------------------------- |
| 223 | 2596 const TypeOopPtr *TypeOopPtr::cast_to_instance_id(int instance_id) const { |
| 0 | 2597 // There are no instances of a general oop. |
| 2598 // Return self unchanged. | |
| 2599 return this; | |
| 2600 } | |
| 2601 | |
| 2602 //-----------------------------cast_to_exactness------------------------------- | |
| 2603 const Type *TypeOopPtr::cast_to_exactness(bool klass_is_exact) const { | |
| 2604 // There is no such thing as an exact general oop. | |
| 2605 // Return self unchanged. | |
| 2606 return this; | |
| 2607 } | |
| 2608 | |
| 2609 | |
| 2610 //------------------------------as_klass_type---------------------------------- | |
| 2611 // Return the klass type corresponding to this instance or array type. | |
| 2612 // It is the type that is loaded from an object of this type. | |
| 2613 const TypeKlassPtr* TypeOopPtr::as_klass_type() const { | |
| 2614 ciKlass* k = klass(); | |
| 2615 bool xk = klass_is_exact(); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2616 if (k == NULL) |
| 0 | 2617 return TypeKlassPtr::OBJECT; |
| 2618 else | |
| 2619 return TypeKlassPtr::make(xk? Constant: NotNull, k, 0); | |
| 2620 } | |
| 2621 | |
| 12966 | 2622 const Type *TypeOopPtr::xmeet(const Type *t) const { |
| 2623 const Type* res = xmeet_helper(t); | |
| 2624 if (res->isa_oopptr() == NULL) { | |
| 2625 return res; | |
| 2626 } | |
| 2627 | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2628 const TypeOopPtr* res_oopptr = res->is_oopptr(); |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2629 if (res_oopptr->speculative() != NULL) { |
| 12966 | 2630 // type->speculative() == NULL means that speculation is no better |
| 2631 // than type, i.e. type->speculative() == type. So there are 2 | |
| 2632 // ways to represent the fact that we have no useful speculative | |
| 2633 // data and we should use a single one to be able to test for | |
| 2634 // equality between types. Check whether type->speculative() == | |
| 2635 // type and set speculative to NULL if it is the case. | |
| 2636 if (res_oopptr->remove_speculative() == res_oopptr->speculative()) { | |
| 2637 return res_oopptr->remove_speculative(); | |
| 2638 } | |
| 2639 } | |
| 2640 | |
| 2641 return res; | |
| 2642 } | |
| 0 | 2643 |
| 2644 //------------------------------meet------------------------------------------- | |
| 2645 // Compute the MEET of two types. It returns a new Type object. | |
| 12966 | 2646 const Type *TypeOopPtr::xmeet_helper(const Type *t) const { |
| 0 | 2647 // Perform a fast test for common case; meeting the same types together. |
| 2648 if( this == t ) return this; // Meeting same type-rep? | |
| 2649 | |
| 2650 // Current "this->_base" is OopPtr | |
| 2651 switch (t->base()) { // switch on original type | |
| 2652 | |
| 2653 case Int: // Mixing ints & oops happens when javac | |
| 2654 case Long: // reuses local variables | |
| 2655 case FloatTop: | |
| 2656 case FloatCon: | |
| 2657 case FloatBot: | |
| 2658 case DoubleTop: | |
| 2659 case DoubleCon: | |
| 2660 case DoubleBot: | |
|
293
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
247
diff
changeset
|
2661 case NarrowOop: |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
2662 case NarrowKlass: |
| 0 | 2663 case Bottom: // Ye Olde Default |
| 2664 return Type::BOTTOM; | |
| 2665 case Top: | |
| 2666 return this; | |
| 2667 | |
| 2668 default: // All else is a mistake | |
| 2669 typerr(t); | |
| 2670 | |
| 2671 case RawPtr: | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2672 case MetadataPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2673 case KlassPtr: |
| 0 | 2674 return TypePtr::BOTTOM; // Oop meet raw is not well defined |
| 2675 | |
| 2676 case AnyPtr: { | |
| 2677 // Found an AnyPtr type vs self-OopPtr type | |
| 2678 const TypePtr *tp = t->is_ptr(); | |
| 2679 int offset = meet_offset(tp->offset()); | |
| 2680 PTR ptr = meet_ptr(tp->ptr()); | |
| 2681 switch (tp->ptr()) { | |
| 2682 case Null: | |
| 2683 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset); | |
| 2684 // else fall through: | |
| 2685 case TopPTR: | |
| 992 | 2686 case AnyNull: { |
| 2687 int instance_id = meet_instance_id(InstanceTop); | |
| 12966 | 2688 const TypeOopPtr* speculative = _speculative; |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2689 return make(ptr, offset, instance_id, speculative, _inline_depth); |
| 992 | 2690 } |
| 0 | 2691 case BotPTR: |
| 2692 case NotNull: | |
| 2693 return TypePtr::make(AnyPtr, ptr, offset); | |
| 2694 default: typerr(t); | |
| 2695 } | |
| 2696 } | |
| 2697 | |
| 2698 case OopPtr: { // Meeting to other OopPtrs | |
| 2699 const TypeOopPtr *tp = t->is_oopptr(); | |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
827
diff
changeset
|
2700 int instance_id = meet_instance_id(tp->instance_id()); |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2701 const TypeOopPtr* speculative = xmeet_speculative(tp); |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2702 int depth = meet_inline_depth(tp->inline_depth()); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2703 return make(meet_ptr(tp->ptr()), meet_offset(tp->offset()), instance_id, speculative, depth); |
| 0 | 2704 } |
| 2705 | |
| 2706 case InstPtr: // For these, flip the call around to cut down | |
| 2707 case AryPtr: | |
| 2708 return t->xmeet(this); // Call in reverse direction | |
| 2709 | |
| 2710 } // End of switch | |
| 2711 return this; // Return the double constant | |
| 2712 } | |
| 2713 | |
| 2714 | |
| 2715 //------------------------------xdual------------------------------------------ | |
| 2716 // Dual of a pure heap pointer. No relevant klass or oop information. | |
| 2717 const Type *TypeOopPtr::xdual() const { | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2718 assert(klass() == Compile::current()->env()->Object_klass(), "no klasses here"); |
| 0 | 2719 assert(const_oop() == NULL, "no constants here"); |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2720 return new TypeOopPtr(_base, dual_ptr(), klass(), klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth()); |
| 0 | 2721 } |
| 2722 | |
| 2723 //--------------------------make_from_klass_common----------------------------- | |
| 2724 // Computes the element-type given a klass. | |
| 2725 const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass *klass, bool klass_change, bool try_for_exact) { | |
| 2726 if (klass->is_instance_klass()) { | |
| 2727 Compile* C = Compile::current(); | |
| 2728 Dependencies* deps = C->dependencies(); | |
| 2729 assert((deps != NULL) == (C->method() != NULL && C->method()->code_size() > 0), "sanity"); | |
| 2730 // Element is an instance | |
| 2731 bool klass_is_exact = false; | |
| 2732 if (klass->is_loaded()) { | |
| 2733 // Try to set klass_is_exact. | |
| 2734 ciInstanceKlass* ik = klass->as_instance_klass(); | |
| 2735 klass_is_exact = ik->is_final(); | |
| 2736 if (!klass_is_exact && klass_change | |
| 2737 && deps != NULL && UseUniqueSubclasses) { | |
| 2738 ciInstanceKlass* sub = ik->unique_concrete_subklass(); | |
| 2739 if (sub != NULL) { | |
| 2740 deps->assert_abstract_with_unique_concrete_subtype(ik, sub); | |
| 2741 klass = ik = sub; | |
| 2742 klass_is_exact = sub->is_final(); | |
| 2743 } | |
| 2744 } | |
| 2745 if (!klass_is_exact && try_for_exact | |
| 2746 && deps != NULL && UseExactTypes) { | |
| 2747 if (!ik->is_interface() && !ik->has_subklass()) { | |
| 2748 // Add a dependence; if concrete subclass added we need to recompile | |
| 2749 deps->assert_leaf_type(ik); | |
| 2750 klass_is_exact = true; | |
| 2751 } | |
| 2752 } | |
| 2753 } | |
| 2754 return TypeInstPtr::make(TypePtr::BotPTR, klass, klass_is_exact, NULL, 0); | |
| 2755 } else if (klass->is_obj_array_klass()) { | |
| 2756 // Element is an object array. Recursively call ourself. | |
| 2757 const TypeOopPtr *etype = TypeOopPtr::make_from_klass_common(klass->as_obj_array_klass()->element_klass(), false, try_for_exact); | |
| 2758 bool xk = etype->klass_is_exact(); | |
| 2759 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS); | |
| 2760 // We used to pass NotNull in here, asserting that the sub-arrays | |
| 2761 // are all not-null. This is not true in generally, as code can | |
| 2762 // slam NULLs down in the subarrays. | |
| 2763 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, xk, 0); | |
| 2764 return arr; | |
| 2765 } else if (klass->is_type_array_klass()) { | |
| 2766 // Element is an typeArray | |
| 2767 const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type()); | |
| 2768 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS); | |
| 2769 // We used to pass NotNull in here, asserting that the array pointer | |
| 2770 // is not-null. That was not true in general. | |
| 2771 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, 0); | |
| 2772 return arr; | |
| 2773 } else { | |
| 2774 ShouldNotReachHere(); | |
| 2775 return NULL; | |
| 2776 } | |
| 2777 } | |
| 2778 | |
| 2779 //------------------------------make_from_constant----------------------------- | |
| 2780 // Make a java pointer from an oop constant | |
| 10278 | 2781 const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o, |
| 2782 bool require_constant, | |
| 2783 bool is_autobox_cache) { | |
| 2784 assert(!o->is_null_object(), "null object not yet handled here."); | |
| 2785 ciKlass* klass = o->klass(); | |
| 2786 if (klass->is_instance_klass()) { | |
| 2787 // Element is an instance | |
| 2788 if (require_constant) { | |
| 2789 if (!o->can_be_constant()) return NULL; | |
| 2790 } else if (!o->should_be_constant()) { | |
| 2791 return TypeInstPtr::make(TypePtr::NotNull, klass, true, NULL, 0); | |
| 2792 } | |
| 2793 return TypeInstPtr::make(o); | |
| 2794 } else if (klass->is_obj_array_klass()) { | |
| 2795 // Element is an object array. Recursively call ourself. | |
| 2796 const TypeOopPtr *etype = | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2797 TypeOopPtr::make_from_klass_raw(klass->as_obj_array_klass()->element_klass()); |
| 10278 | 2798 if (is_autobox_cache) { |
| 2799 // The pointers in the autobox arrays are always non-null. | |
| 2800 etype = etype->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr(); | |
| 2801 } | |
| 2802 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length())); | |
| 2803 // We used to pass NotNull in here, asserting that the sub-arrays | |
| 2804 // are all not-null. This is not true in generally, as code can | |
| 2805 // slam NULLs down in the subarrays. | |
| 2806 if (require_constant) { | |
| 2807 if (!o->can_be_constant()) return NULL; | |
| 2808 } else if (!o->should_be_constant()) { | |
| 2809 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0); | |
| 2810 } | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2811 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0, InstanceBot, NULL, InlineDepthBottom, is_autobox_cache); |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2812 return arr; |
| 10278 | 2813 } else if (klass->is_type_array_klass()) { |
| 2814 // Element is an typeArray | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2815 const Type* etype = |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2816 (Type*)get_const_basic_type(klass->as_type_array_klass()->element_type()); |
| 10278 | 2817 const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length())); |
| 2818 // We used to pass NotNull in here, asserting that the array pointer | |
| 2819 // is not-null. That was not true in general. | |
| 2820 if (require_constant) { | |
| 2821 if (!o->can_be_constant()) return NULL; | |
| 2822 } else if (!o->should_be_constant()) { | |
| 2823 return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0); | |
| 2824 } | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2825 const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
2826 return arr; |
| 0 | 2827 } |
| 2828 | |
|
6182
765ee2d1674b
7157365: jruby/bench.bench_timeout crashes with JVM internal error
twisti
parents:
6179
diff
changeset
|
2829 fatal("unhandled object type"); |
| 0 | 2830 return NULL; |
| 2831 } | |
| 2832 | |
| 2833 //------------------------------get_con---------------------------------------- | |
| 2834 intptr_t TypeOopPtr::get_con() const { | |
| 2835 assert( _ptr == Null || _ptr == Constant, "" ); | |
| 2836 assert( _offset >= 0, "" ); | |
| 2837 | |
| 2838 if (_offset != 0) { | |
| 2839 // After being ported to the compiler interface, the compiler no longer | |
| 2840 // directly manipulates the addresses of oops. Rather, it only has a pointer | |
| 2841 // to a handle at compile time. This handle is embedded in the generated | |
| 2842 // code and dereferenced at the time the nmethod is made. Until that time, | |
| 2843 // it is not reasonable to do arithmetic with the addresses of oops (we don't | |
| 2844 // have access to the addresses!). This does not seem to currently happen, | |
| 605 | 2845 // but this assertion here is to help prevent its occurence. |
| 0 | 2846 tty->print_cr("Found oop constant with non-zero offset"); |
| 2847 ShouldNotReachHere(); | |
| 2848 } | |
| 2849 | |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
958
diff
changeset
|
2850 return (intptr_t)const_oop()->constant_encoding(); |
| 0 | 2851 } |
| 2852 | |
| 2853 | |
| 2854 //-----------------------------filter------------------------------------------ | |
| 2855 // Do not allow interface-vs.-noninterface joins to collapse to top. | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2856 const Type *TypeOopPtr::filter_helper(const Type *kills, bool include_speculative) const { |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2857 |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2858 const Type* ft = join_helper(kills, include_speculative); |
| 0 | 2859 const TypeInstPtr* ftip = ft->isa_instptr(); |
| 2860 const TypeInstPtr* ktip = kills->isa_instptr(); | |
| 2861 | |
| 2862 if (ft->empty()) { | |
| 2863 // Check for evil case of 'this' being a class and 'kills' expecting an | |
| 2864 // interface. This can happen because the bytecodes do not contain | |
| 2865 // enough type info to distinguish a Java-level interface variable | |
| 2866 // from a Java-level object variable. If we meet 2 classes which | |
| 2867 // both implement interface I, but their meet is at 'j/l/O' which | |
| 2868 // doesn't implement I, we have no way to tell if the result should | |
| 2869 // be 'I' or 'j/l/O'. Thus we'll pick 'j/l/O'. If this then flows | |
| 2870 // into a Phi which "knows" it's an Interface type we'll have to | |
| 2871 // uplift the type. | |
|
23849
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2872 if (!empty()) { |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2873 if (ktip != NULL && ktip->is_loaded() && ktip->klass()->is_interface()) { |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2874 return kills; // Uplift to interface |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2875 } |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2876 // Also check for evil cases of 'this' being a class array |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2877 // and 'kills' expecting an array of interfaces. |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2878 Type::get_arrays_base_elements(ft, kills, NULL, &ktip); |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2879 if (ktip != NULL && ktip->is_loaded() && ktip->klass()->is_interface()) { |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2880 return kills; // Uplift to array of interface |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2881 } |
|
09687c445ce1
8141551: C2 can not handle returns with inccompatible interface arrays
shshahma
parents:
23069
diff
changeset
|
2882 } |
| 0 | 2883 |
| 2884 return Type::TOP; // Canonical empty value | |
| 2885 } | |
| 2886 | |
| 2887 // If we have an interface-typed Phi or cast and we narrow to a class type, | |
| 2888 // the join should report back the class. However, if we have a J/L/Object | |
| 2889 // class-typed Phi and an interface flows in, it's possible that the meet & | |
| 2890 // join report an interface back out. This isn't possible but happens | |
| 2891 // because the type system doesn't interact well with interfaces. | |
| 2892 if (ftip != NULL && ktip != NULL && | |
| 2893 ftip->is_loaded() && ftip->klass()->is_interface() && | |
| 2894 ktip->is_loaded() && !ktip->klass()->is_interface()) { | |
| 2895 // Happens in a CTW of rt.jar, 320-341, no extra flags | |
|
1335
ae4032fb0a5b
6894807: No ClassCastException for HashAttributeSet constructors if run with -Xcomp
kvn
parents:
1009
diff
changeset
|
2896 assert(!ftip->klass_is_exact(), "interface could not be exact"); |
| 0 | 2897 return ktip->cast_to_ptr_type(ftip->ptr()); |
| 2898 } | |
| 2899 | |
| 2900 return ft; | |
| 2901 } | |
| 2902 | |
| 2903 //------------------------------eq--------------------------------------------- | |
| 2904 // Structural equality check for Type representations | |
| 2905 bool TypeOopPtr::eq( const Type *t ) const { | |
| 2906 const TypeOopPtr *a = (const TypeOopPtr*)t; | |
| 2907 if (_klass_is_exact != a->_klass_is_exact || | |
| 12966 | 2908 _instance_id != a->_instance_id || |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2909 !eq_speculative(a) || |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2910 _inline_depth != a->_inline_depth) return false; |
| 0 | 2911 ciObject* one = const_oop(); |
| 2912 ciObject* two = a->const_oop(); | |
| 2913 if (one == NULL || two == NULL) { | |
| 2914 return (one == two) && TypePtr::eq(t); | |
| 2915 } else { | |
| 2916 return one->equals(two) && TypePtr::eq(t); | |
| 2917 } | |
| 2918 } | |
| 2919 | |
| 2920 //------------------------------hash------------------------------------------- | |
| 2921 // Type-specific hashing function. | |
| 2922 int TypeOopPtr::hash(void) const { | |
| 2923 return | |
| 2924 (const_oop() ? const_oop()->hash() : 0) + | |
| 2925 _klass_is_exact + | |
| 2926 _instance_id + | |
| 12966 | 2927 hash_speculative() + |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2928 _inline_depth + |
| 0 | 2929 TypePtr::hash(); |
| 2930 } | |
| 2931 | |
| 2932 //------------------------------dump2------------------------------------------ | |
| 2933 #ifndef PRODUCT | |
| 2934 void TypeOopPtr::dump2( Dict &d, uint depth, outputStream *st ) const { | |
| 2935 st->print("oopptr:%s", ptr_msg[_ptr]); | |
| 2936 if( _klass_is_exact ) st->print(":exact"); | |
| 2937 if( const_oop() ) st->print(INTPTR_FORMAT, const_oop()); | |
| 2938 switch( _offset ) { | |
| 2939 case OffsetTop: st->print("+top"); break; | |
| 2940 case OffsetBot: st->print("+any"); break; | |
| 2941 case 0: break; | |
| 2942 default: st->print("+%d",_offset); break; | |
| 2943 } | |
| 223 | 2944 if (_instance_id == InstanceTop) |
| 2945 st->print(",iid=top"); | |
| 2946 else if (_instance_id != InstanceBot) | |
| 0 | 2947 st->print(",iid=%d",_instance_id); |
| 12966 | 2948 |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2949 dump_inline_depth(st); |
| 12966 | 2950 dump_speculative(st); |
| 2951 } | |
| 2952 | |
| 2953 /** | |
| 2954 *dump the speculative part of the type | |
| 2955 */ | |
| 2956 void TypeOopPtr::dump_speculative(outputStream *st) const { | |
| 2957 if (_speculative != NULL) { | |
| 2958 st->print(" (speculative="); | |
| 2959 _speculative->dump_on(st); | |
| 2960 st->print(")"); | |
| 2961 } | |
| 0 | 2962 } |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2963 |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2964 void TypeOopPtr::dump_inline_depth(outputStream *st) const { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2965 if (_inline_depth != InlineDepthBottom) { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2966 if (_inline_depth == InlineDepthTop) { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2967 st->print(" (inline_depth=InlineDepthTop)"); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2968 } else { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2969 st->print(" (inline_depth=%d)", _inline_depth); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2970 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2971 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2972 } |
| 0 | 2973 #endif |
| 2974 | |
| 2975 //------------------------------singleton-------------------------------------- | |
| 2976 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple | |
| 2977 // constants | |
| 2978 bool TypeOopPtr::singleton(void) const { | |
| 2979 // detune optimizer to not generate constant oop + constant offset as a constant! | |
| 2980 // TopPTR, Null, AnyNull, Constant are all singletons | |
| 2981 return (_offset == 0) && !below_centerline(_ptr); | |
| 2982 } | |
| 2983 | |
| 2984 //------------------------------add_offset------------------------------------- | |
| 12966 | 2985 const TypePtr *TypeOopPtr::add_offset(intptr_t offset) const { |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2986 return make(_ptr, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth); |
| 12966 | 2987 } |
| 2988 | |
| 2989 /** | |
| 2990 * Return same type without a speculative part | |
| 2991 */ | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2992 const Type* TypeOopPtr::remove_speculative() const { |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2993 if (_speculative == NULL) { |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2994 return this; |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
2995 } |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2996 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2997 return make(_ptr, _offset, _instance_id, NULL, _inline_depth); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2998 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
2999 |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3000 /** |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3001 * Return same type but with a different inline depth (used for speculation) |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3002 * |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3003 * @param depth depth to meet with |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3004 */ |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3005 const TypeOopPtr* TypeOopPtr::with_inline_depth(int depth) const { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3006 if (!UseInlineDepthForSpeculativeTypes) { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3007 return this; |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3008 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3009 return make(_ptr, _offset, _instance_id, _speculative, depth); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3010 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3011 |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3012 /** |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3013 * Check whether new profiling would improve speculative type |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3014 * |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3015 * @param exact_kls class from profiling |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3016 * @param inline_depth inlining depth of profile point |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3017 * |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3018 * @return true if type profile is valuable |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3019 */ |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3020 bool TypeOopPtr::would_improve_type(ciKlass* exact_kls, int inline_depth) const { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3021 // no way to improve an already exact type |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3022 if (klass_is_exact()) { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3023 return false; |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3024 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3025 // no profiling? |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3026 if (exact_kls == NULL) { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3027 return false; |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3028 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3029 // no speculative type or non exact speculative type? |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3030 if (speculative_type() == NULL) { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3031 return true; |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3032 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3033 // If the node already has an exact speculative type keep it, |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3034 // unless it was provided by profiling that is at a deeper |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3035 // inlining level. Profiling at a higher inlining depth is |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3036 // expected to be less accurate. |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3037 if (_speculative->inline_depth() == InlineDepthBottom) { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3038 return false; |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3039 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3040 assert(_speculative->inline_depth() != InlineDepthTop, "can't do the comparison"); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3041 return inline_depth < _speculative->inline_depth(); |
| 0 | 3042 } |
| 3043 | |
| 223 | 3044 //------------------------------meet_instance_id-------------------------------- |
| 3045 int TypeOopPtr::meet_instance_id( int instance_id ) const { | |
| 3046 // Either is 'TOP' instance? Return the other instance! | |
| 3047 if( _instance_id == InstanceTop ) return instance_id; | |
| 3048 if( instance_id == InstanceTop ) return _instance_id; | |
| 3049 // If either is different, return 'BOTTOM' instance | |
| 3050 if( _instance_id != instance_id ) return InstanceBot; | |
| 3051 return _instance_id; | |
| 0 | 3052 } |
| 3053 | |
| 223 | 3054 //------------------------------dual_instance_id-------------------------------- |
| 3055 int TypeOopPtr::dual_instance_id( ) const { | |
| 3056 if( _instance_id == InstanceTop ) return InstanceBot; // Map TOP into BOTTOM | |
| 3057 if( _instance_id == InstanceBot ) return InstanceTop; // Map BOTTOM into TOP | |
| 3058 return _instance_id; // Map everything else into self | |
| 3059 } | |
| 3060 | |
| 12966 | 3061 /** |
| 3062 * meet of the speculative parts of 2 types | |
| 3063 * | |
| 3064 * @param other type to meet with | |
| 3065 */ | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3066 const TypeOopPtr* TypeOopPtr::xmeet_speculative(const TypeOopPtr* other) const { |
| 12966 | 3067 bool this_has_spec = (_speculative != NULL); |
| 3068 bool other_has_spec = (other->speculative() != NULL); | |
| 3069 | |
| 3070 if (!this_has_spec && !other_has_spec) { | |
| 3071 return NULL; | |
| 3072 } | |
| 3073 | |
| 3074 // If we are at a point where control flow meets and one branch has | |
| 3075 // a speculative type and the other has not, we meet the speculative | |
| 3076 // type of one branch with the actual type of the other. If the | |
| 3077 // actual type is exact and the speculative is as well, then the | |
| 3078 // result is a speculative type which is exact and we can continue | |
| 3079 // speculation further. | |
| 3080 const TypeOopPtr* this_spec = _speculative; | |
| 3081 const TypeOopPtr* other_spec = other->speculative(); | |
| 3082 | |
| 3083 if (!this_has_spec) { | |
| 3084 this_spec = this; | |
| 3085 } | |
| 3086 | |
| 3087 if (!other_has_spec) { | |
| 3088 other_spec = other; | |
| 3089 } | |
| 3090 | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3091 return this_spec->meet_speculative(other_spec)->is_oopptr(); |
| 12966 | 3092 } |
| 3093 | |
| 3094 /** | |
| 3095 * dual of the speculative part of the type | |
| 3096 */ | |
| 3097 const TypeOopPtr* TypeOopPtr::dual_speculative() const { | |
| 3098 if (_speculative == NULL) { | |
| 3099 return NULL; | |
| 3100 } | |
| 3101 return _speculative->dual()->is_oopptr(); | |
| 3102 } | |
| 3103 | |
| 3104 /** | |
| 3105 * add offset to the speculative part of the type | |
| 3106 * | |
| 3107 * @param offset offset to add | |
| 3108 */ | |
| 3109 const TypeOopPtr* TypeOopPtr::add_offset_speculative(intptr_t offset) const { | |
| 3110 if (_speculative == NULL) { | |
| 3111 return NULL; | |
| 3112 } | |
| 3113 return _speculative->add_offset(offset)->is_oopptr(); | |
| 3114 } | |
| 3115 | |
| 3116 /** | |
| 3117 * Are the speculative parts of 2 types equal? | |
| 3118 * | |
| 3119 * @param other type to compare this one to | |
| 3120 */ | |
| 3121 bool TypeOopPtr::eq_speculative(const TypeOopPtr* other) const { | |
| 3122 if (_speculative == NULL || other->speculative() == NULL) { | |
| 3123 return _speculative == other->speculative(); | |
| 3124 } | |
| 3125 | |
| 3126 if (_speculative->base() != other->speculative()->base()) { | |
| 3127 return false; | |
| 3128 } | |
| 3129 | |
| 3130 return _speculative->eq(other->speculative()); | |
| 3131 } | |
| 3132 | |
| 3133 /** | |
| 3134 * Hash of the speculative part of the type | |
| 3135 */ | |
| 3136 int TypeOopPtr::hash_speculative() const { | |
| 3137 if (_speculative == NULL) { | |
| 3138 return 0; | |
| 3139 } | |
| 3140 | |
| 3141 return _speculative->hash(); | |
| 3142 } | |
| 3143 | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3144 /** |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3145 * dual of the inline depth for this type (used for speculation) |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3146 */ |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3147 int TypeOopPtr::dual_inline_depth() const { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3148 return -inline_depth(); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3149 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3150 |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3151 /** |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3152 * meet of 2 inline depth (used for speculation) |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3153 * |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3154 * @param depth depth to meet with |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3155 */ |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3156 int TypeOopPtr::meet_inline_depth(int depth) const { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3157 return MAX2(inline_depth(), depth); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3158 } |
| 223 | 3159 |
| 0 | 3160 //============================================================================= |
| 3161 // Convenience common pre-built types. | |
| 3162 const TypeInstPtr *TypeInstPtr::NOTNULL; | |
| 3163 const TypeInstPtr *TypeInstPtr::BOTTOM; | |
| 3164 const TypeInstPtr *TypeInstPtr::MIRROR; | |
| 3165 const TypeInstPtr *TypeInstPtr::MARK; | |
| 3166 const TypeInstPtr *TypeInstPtr::KLASS; | |
| 3167 | |
| 3168 //------------------------------TypeInstPtr------------------------------------- | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3169 TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, bool xk, ciObject* o, int off, int instance_id, const TypeOopPtr* speculative, int inline_depth) |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3170 : TypeOopPtr(InstPtr, ptr, k, xk, o, off, instance_id, speculative, inline_depth), _name(k->name()) { |
| 0 | 3171 assert(k != NULL && |
| 3172 (k->is_loaded() || o == NULL), | |
| 3173 "cannot have constants with non-loaded klass"); | |
| 3174 }; | |
| 3175 | |
| 3176 //------------------------------make------------------------------------------- | |
| 3177 const TypeInstPtr *TypeInstPtr::make(PTR ptr, | |
| 3178 ciKlass* k, | |
| 3179 bool xk, | |
| 3180 ciObject* o, | |
| 3181 int offset, | |
| 12966 | 3182 int instance_id, |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3183 const TypeOopPtr* speculative, |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3184 int inline_depth) { |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
3185 assert( !k->is_loaded() || k->is_instance_klass(), "Must be for instance"); |
| 0 | 3186 // Either const_oop() is NULL or else ptr is Constant |
| 3187 assert( (!o && ptr != Constant) || (o && ptr == Constant), | |
| 3188 "constant pointers must have a value supplied" ); | |
| 3189 // Ptr is never Null | |
| 3190 assert( ptr != Null, "NULL pointers are not typed" ); | |
| 3191 | |
| 247 | 3192 assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed"); |
| 0 | 3193 if (!UseExactTypes) xk = false; |
| 3194 if (ptr == Constant) { | |
| 3195 // Note: This case includes meta-object constants, such as methods. | |
| 3196 xk = true; | |
| 3197 } else if (k->is_loaded()) { | |
| 3198 ciInstanceKlass* ik = k->as_instance_klass(); | |
| 3199 if (!xk && ik->is_final()) xk = true; // no inexact final klass | |
| 3200 if (xk && ik->is_interface()) xk = false; // no exact interface | |
| 3201 } | |
| 3202 | |
| 3203 // Now hash this baby | |
| 3204 TypeInstPtr *result = | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3205 (TypeInstPtr*)(new TypeInstPtr(ptr, k, xk, o ,offset, instance_id, speculative, inline_depth))->hashcons(); |
| 0 | 3206 |
| 3207 return result; | |
| 3208 } | |
| 3209 | |
| 10278 | 3210 /** |
| 3211 * Create constant type for a constant boxed value | |
| 3212 */ | |
| 3213 const Type* TypeInstPtr::get_const_boxed_value() const { | |
| 3214 assert(is_ptr_to_boxed_value(), "should be called only for boxed value"); | |
| 3215 assert((const_oop() != NULL), "should be called only for constant object"); | |
| 3216 ciConstant constant = const_oop()->as_instance()->field_value_by_offset(offset()); | |
| 3217 BasicType bt = constant.basic_type(); | |
| 3218 switch (bt) { | |
| 3219 case T_BOOLEAN: return TypeInt::make(constant.as_boolean()); | |
| 3220 case T_INT: return TypeInt::make(constant.as_int()); | |
| 3221 case T_CHAR: return TypeInt::make(constant.as_char()); | |
| 3222 case T_BYTE: return TypeInt::make(constant.as_byte()); | |
| 3223 case T_SHORT: return TypeInt::make(constant.as_short()); | |
| 3224 case T_FLOAT: return TypeF::make(constant.as_float()); | |
| 3225 case T_DOUBLE: return TypeD::make(constant.as_double()); | |
| 3226 case T_LONG: return TypeLong::make(constant.as_long()); | |
| 3227 default: break; | |
| 3228 } | |
| 3229 fatal(err_msg_res("Invalid boxed value type '%s'", type2name(bt))); | |
| 3230 return NULL; | |
| 3231 } | |
| 0 | 3232 |
| 3233 //------------------------------cast_to_ptr_type------------------------------- | |
| 3234 const Type *TypeInstPtr::cast_to_ptr_type(PTR ptr) const { | |
| 3235 if( ptr == _ptr ) return this; | |
| 3236 // Reconstruct _sig info here since not a problem with later lazy | |
| 3237 // construction, _sig will show up on demand. | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3238 return make(ptr, klass(), klass_is_exact(), const_oop(), _offset, _instance_id, _speculative, _inline_depth); |
| 0 | 3239 } |
| 3240 | |
| 3241 | |
| 3242 //-----------------------------cast_to_exactness------------------------------- | |
| 3243 const Type *TypeInstPtr::cast_to_exactness(bool klass_is_exact) const { | |
| 3244 if( klass_is_exact == _klass_is_exact ) return this; | |
| 3245 if (!UseExactTypes) return this; | |
| 3246 if (!_klass->is_loaded()) return this; | |
| 3247 ciInstanceKlass* ik = _klass->as_instance_klass(); | |
| 3248 if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk | |
| 3249 if( ik->is_interface() ) return this; // cannot set xk | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3250 return make(ptr(), klass(), klass_is_exact, const_oop(), _offset, _instance_id, _speculative, _inline_depth); |
| 0 | 3251 } |
| 3252 | |
| 247 | 3253 //-----------------------------cast_to_instance_id---------------------------- |
| 223 | 3254 const TypeOopPtr *TypeInstPtr::cast_to_instance_id(int instance_id) const { |
| 3255 if( instance_id == _instance_id ) return this; | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3256 return make(_ptr, klass(), _klass_is_exact, const_oop(), _offset, instance_id, _speculative, _inline_depth); |
| 0 | 3257 } |
| 3258 | |
| 3259 //------------------------------xmeet_unloaded--------------------------------- | |
| 3260 // Compute the MEET of two InstPtrs when at least one is unloaded. | |
| 3261 // Assume classes are different since called after check for same name/class-loader | |
| 3262 const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst) const { | |
| 3263 int off = meet_offset(tinst->offset()); | |
| 3264 PTR ptr = meet_ptr(tinst->ptr()); | |
| 992 | 3265 int instance_id = meet_instance_id(tinst->instance_id()); |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3266 const TypeOopPtr* speculative = xmeet_speculative(tinst); |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3267 int depth = meet_inline_depth(tinst->inline_depth()); |
| 0 | 3268 |
| 3269 const TypeInstPtr *loaded = is_loaded() ? this : tinst; | |
| 3270 const TypeInstPtr *unloaded = is_loaded() ? tinst : this; | |
| 3271 if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) { | |
| 3272 // | |
| 3273 // Meet unloaded class with java/lang/Object | |
| 3274 // | |
| 3275 // Meet | |
| 3276 // | Unloaded Class | |
| 3277 // Object | TOP | AnyNull | Constant | NotNull | BOTTOM | | |
| 3278 // =================================================================== | |
| 3279 // TOP | ..........................Unloaded......................| | |
| 3280 // AnyNull | U-AN |................Unloaded......................| | |
| 3281 // Constant | ... O-NN .................................. | O-BOT | | |
| 3282 // NotNull | ... O-NN .................................. | O-BOT | | |
| 3283 // BOTTOM | ........................Object-BOTTOM ..................| | |
| 3284 // | |
| 3285 assert(loaded->ptr() != TypePtr::Null, "insanity check"); | |
| 3286 // | |
| 3287 if( loaded->ptr() == TypePtr::TopPTR ) { return unloaded; } | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3288 else if (loaded->ptr() == TypePtr::AnyNull) { return TypeInstPtr::make(ptr, unloaded->klass(), false, NULL, off, instance_id, speculative, depth); } |
| 0 | 3289 else if (loaded->ptr() == TypePtr::BotPTR ) { return TypeInstPtr::BOTTOM; } |
| 3290 else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) { | |
| 3291 if (unloaded->ptr() == TypePtr::BotPTR ) { return TypeInstPtr::BOTTOM; } | |
| 3292 else { return TypeInstPtr::NOTNULL; } | |
| 3293 } | |
| 3294 else if( unloaded->ptr() == TypePtr::TopPTR ) { return unloaded; } | |
| 3295 | |
| 3296 return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr(); | |
| 3297 } | |
| 3298 | |
| 3299 // Both are unloaded, not the same class, not Object | |
| 3300 // Or meet unloaded with a different loaded class, not java/lang/Object | |
| 3301 if( ptr != TypePtr::BotPTR ) { | |
| 3302 return TypeInstPtr::NOTNULL; | |
| 3303 } | |
| 3304 return TypeInstPtr::BOTTOM; | |
| 3305 } | |
| 3306 | |
| 3307 | |
| 3308 //------------------------------meet------------------------------------------- | |
| 3309 // Compute the MEET of two types. It returns a new Type object. | |
| 12966 | 3310 const Type *TypeInstPtr::xmeet_helper(const Type *t) const { |
| 0 | 3311 // Perform a fast test for common case; meeting the same types together. |
| 3312 if( this == t ) return this; // Meeting same type-rep? | |
| 3313 | |
| 3314 // Current "this->_base" is Pointer | |
| 3315 switch (t->base()) { // switch on original type | |
| 3316 | |
| 3317 case Int: // Mixing ints & oops happens when javac | |
| 3318 case Long: // reuses local variables | |
| 3319 case FloatTop: | |
| 3320 case FloatCon: | |
| 3321 case FloatBot: | |
| 3322 case DoubleTop: | |
| 3323 case DoubleCon: | |
| 3324 case DoubleBot: | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
3325 case NarrowOop: |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
3326 case NarrowKlass: |
| 0 | 3327 case Bottom: // Ye Olde Default |
| 3328 return Type::BOTTOM; | |
| 3329 case Top: | |
| 3330 return this; | |
| 3331 | |
| 3332 default: // All else is a mistake | |
| 3333 typerr(t); | |
| 3334 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
3335 case MetadataPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
3336 case KlassPtr: |
| 0 | 3337 case RawPtr: return TypePtr::BOTTOM; |
| 3338 | |
| 3339 case AryPtr: { // All arrays inherit from Object class | |
| 3340 const TypeAryPtr *tp = t->is_aryptr(); | |
| 3341 int offset = meet_offset(tp->offset()); | |
| 3342 PTR ptr = meet_ptr(tp->ptr()); | |
| 223 | 3343 int instance_id = meet_instance_id(tp->instance_id()); |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3344 const TypeOopPtr* speculative = xmeet_speculative(tp); |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3345 int depth = meet_inline_depth(tp->inline_depth()); |
| 0 | 3346 switch (ptr) { |
| 3347 case TopPTR: | |
| 3348 case AnyNull: // Fall 'down' to dual of object klass | |
| 12966 | 3349 // For instances when a subclass meets a superclass we fall |
| 3350 // below the centerline when the superclass is exact. We need to | |
| 3351 // do the same here. | |
| 3352 if (klass()->equals(ciEnv::current()->Object_klass()) && !klass_is_exact()) { | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3353 return TypeAryPtr::make(ptr, tp->ary(), tp->klass(), tp->klass_is_exact(), offset, instance_id, speculative, depth); |
| 0 | 3354 } else { |
| 3355 // cannot subclass, so the meet has to fall badly below the centerline | |
| 3356 ptr = NotNull; | |
| 223 | 3357 instance_id = InstanceBot; |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3358 return TypeInstPtr::make( ptr, ciEnv::current()->Object_klass(), false, NULL, offset, instance_id, speculative, depth); |
| 0 | 3359 } |
| 3360 case Constant: | |
| 3361 case NotNull: | |
| 3362 case BotPTR: // Fall down to object klass | |
| 3363 // LCA is object_klass, but if we subclass from the top we can do better | |
| 3364 if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull ) | |
| 3365 // If 'this' (InstPtr) is above the centerline and it is Object class | |
| 605 | 3366 // then we can subclass in the Java class hierarchy. |
| 12966 | 3367 // For instances when a subclass meets a superclass we fall |
| 3368 // below the centerline when the superclass is exact. We need | |
| 3369 // to do the same here. | |
| 3370 if (klass()->equals(ciEnv::current()->Object_klass()) && !klass_is_exact()) { | |
| 0 | 3371 // that is, tp's array type is a subtype of my klass |
|
1279
2432acbee618
6930035: C2 type system incorrectly handles case j.l.Object->meet(constant AryPtr)
kvn
parents:
1137
diff
changeset
|
3372 return TypeAryPtr::make(ptr, (ptr == Constant ? tp->const_oop() : NULL), |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3373 tp->ary(), tp->klass(), tp->klass_is_exact(), offset, instance_id, speculative, depth); |
| 0 | 3374 } |
| 3375 } | |
| 3376 // The other case cannot happen, since I cannot be a subtype of an array. | |
| 3377 // The meet falls down to Object class below centerline. | |
| 3378 if( ptr == Constant ) | |
| 3379 ptr = NotNull; | |
| 223 | 3380 instance_id = InstanceBot; |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3381 return make(ptr, ciEnv::current()->Object_klass(), false, NULL, offset, instance_id, speculative, depth); |
| 0 | 3382 default: typerr(t); |
| 3383 } | |
| 3384 } | |
| 3385 | |
| 3386 case OopPtr: { // Meeting to OopPtrs | |
| 3387 // Found a OopPtr type vs self-InstPtr type | |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
827
diff
changeset
|
3388 const TypeOopPtr *tp = t->is_oopptr(); |
| 0 | 3389 int offset = meet_offset(tp->offset()); |
| 3390 PTR ptr = meet_ptr(tp->ptr()); | |
| 3391 switch (tp->ptr()) { | |
| 3392 case TopPTR: | |
| 223 | 3393 case AnyNull: { |
| 3394 int instance_id = meet_instance_id(InstanceTop); | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3395 const TypeOopPtr* speculative = xmeet_speculative(tp); |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3396 int depth = meet_inline_depth(tp->inline_depth()); |
| 0 | 3397 return make(ptr, klass(), klass_is_exact(), |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3398 (ptr == Constant ? const_oop() : NULL), offset, instance_id, speculative, depth); |
| 223 | 3399 } |
| 0 | 3400 case NotNull: |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
827
diff
changeset
|
3401 case BotPTR: { |
|
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
827
diff
changeset
|
3402 int instance_id = meet_instance_id(tp->instance_id()); |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3403 const TypeOopPtr* speculative = xmeet_speculative(tp); |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3404 int depth = meet_inline_depth(tp->inline_depth()); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3405 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth); |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
827
diff
changeset
|
3406 } |
| 0 | 3407 default: typerr(t); |
| 3408 } | |
| 3409 } | |
| 3410 | |
| 3411 case AnyPtr: { // Meeting to AnyPtrs | |
| 3412 // Found an AnyPtr type vs self-InstPtr type | |
| 3413 const TypePtr *tp = t->is_ptr(); | |
| 3414 int offset = meet_offset(tp->offset()); | |
| 3415 PTR ptr = meet_ptr(tp->ptr()); | |
| 3416 switch (tp->ptr()) { | |
| 3417 case Null: | |
| 12966 | 3418 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset); |
| 223 | 3419 // else fall through to AnyNull |
| 0 | 3420 case TopPTR: |
| 223 | 3421 case AnyNull: { |
| 3422 int instance_id = meet_instance_id(InstanceTop); | |
| 12966 | 3423 const TypeOopPtr* speculative = _speculative; |
| 3424 return make(ptr, klass(), klass_is_exact(), | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3425 (ptr == Constant ? const_oop() : NULL), offset, instance_id, speculative, _inline_depth); |
| 223 | 3426 } |
| 0 | 3427 case NotNull: |
| 3428 case BotPTR: | |
| 12966 | 3429 return TypePtr::make(AnyPtr, ptr, offset); |
| 0 | 3430 default: typerr(t); |
| 3431 } | |
| 3432 } | |
| 3433 | |
| 3434 /* | |
| 3435 A-top } | |
| 3436 / | \ } Tops | |
| 3437 B-top A-any C-top } | |
| 3438 | / | \ | } Any-nulls | |
| 3439 B-any | C-any } | |
| 3440 | | | | |
| 3441 B-con A-con C-con } constants; not comparable across classes | |
| 3442 | | | | |
| 3443 B-not | C-not } | |
| 3444 | \ | / | } not-nulls | |
| 3445 B-bot A-not C-bot } | |
| 3446 \ | / } Bottoms | |
| 3447 A-bot } | |
| 3448 */ | |
| 3449 | |
| 3450 case InstPtr: { // Meeting 2 Oops? | |
| 3451 // Found an InstPtr sub-type vs self-InstPtr type | |
| 3452 const TypeInstPtr *tinst = t->is_instptr(); | |
| 3453 int off = meet_offset( tinst->offset() ); | |
| 3454 PTR ptr = meet_ptr( tinst->ptr() ); | |
| 223 | 3455 int instance_id = meet_instance_id(tinst->instance_id()); |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3456 const TypeOopPtr* speculative = xmeet_speculative(tinst); |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3457 int depth = meet_inline_depth(tinst->inline_depth()); |
| 0 | 3458 |
| 3459 // Check for easy case; klasses are equal (and perhaps not loaded!) | |
| 3460 // If we have constants, then we created oops so classes are loaded | |
| 3461 // and we can handle the constants further down. This case handles | |
| 3462 // both-not-loaded or both-loaded classes | |
| 3463 if (ptr != Constant && klass()->equals(tinst->klass()) && klass_is_exact() == tinst->klass_is_exact()) { | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3464 return make(ptr, klass(), klass_is_exact(), NULL, off, instance_id, speculative, depth); |
| 0 | 3465 } |
| 3466 | |
| 3467 // Classes require inspection in the Java klass hierarchy. Must be loaded. | |
| 3468 ciKlass* tinst_klass = tinst->klass(); | |
| 3469 ciKlass* this_klass = this->klass(); | |
| 3470 bool tinst_xk = tinst->klass_is_exact(); | |
| 3471 bool this_xk = this->klass_is_exact(); | |
| 3472 if (!tinst_klass->is_loaded() || !this_klass->is_loaded() ) { | |
| 3473 // One of these classes has not been loaded | |
| 3474 const TypeInstPtr *unloaded_meet = xmeet_unloaded(tinst); | |
| 3475 #ifndef PRODUCT | |
| 3476 if( PrintOpto && Verbose ) { | |
| 3477 tty->print("meet of unloaded classes resulted in: "); unloaded_meet->dump(); tty->cr(); | |
| 3478 tty->print(" this == "); this->dump(); tty->cr(); | |
| 3479 tty->print(" tinst == "); tinst->dump(); tty->cr(); | |
| 3480 } | |
| 3481 #endif | |
| 3482 return unloaded_meet; | |
| 3483 } | |
| 3484 | |
| 3485 // Handle mixing oops and interfaces first. | |
| 12966 | 3486 if( this_klass->is_interface() && !(tinst_klass->is_interface() || |
| 3487 tinst_klass == ciEnv::current()->Object_klass())) { | |
| 0 | 3488 ciKlass *tmp = tinst_klass; // Swap interface around |
| 3489 tinst_klass = this_klass; | |
| 3490 this_klass = tmp; | |
| 3491 bool tmp2 = tinst_xk; | |
| 3492 tinst_xk = this_xk; | |
| 3493 this_xk = tmp2; | |
| 3494 } | |
| 3495 if (tinst_klass->is_interface() && | |
| 3496 !(this_klass->is_interface() || | |
| 3497 // Treat java/lang/Object as an honorary interface, | |
| 3498 // because we need a bottom for the interface hierarchy. | |
| 3499 this_klass == ciEnv::current()->Object_klass())) { | |
| 3500 // Oop meets interface! | |
| 3501 | |
| 3502 // See if the oop subtypes (implements) interface. | |
| 3503 ciKlass *k; | |
| 3504 bool xk; | |
| 3505 if( this_klass->is_subtype_of( tinst_klass ) ) { | |
| 3506 // Oop indeed subtypes. Now keep oop or interface depending | |
| 3507 // on whether we are both above the centerline or either is | |
| 3508 // below the centerline. If we are on the centerline | |
| 3509 // (e.g., Constant vs. AnyNull interface), use the constant. | |
| 3510 k = below_centerline(ptr) ? tinst_klass : this_klass; | |
| 3511 // If we are keeping this_klass, keep its exactness too. | |
| 3512 xk = below_centerline(ptr) ? tinst_xk : this_xk; | |
| 3513 } else { // Does not implement, fall to Object | |
| 3514 // Oop does not implement interface, so mixing falls to Object | |
| 3515 // just like the verifier does (if both are above the | |
| 3516 // centerline fall to interface) | |
| 3517 k = above_centerline(ptr) ? tinst_klass : ciEnv::current()->Object_klass(); | |
| 3518 xk = above_centerline(ptr) ? tinst_xk : false; | |
| 3519 // Watch out for Constant vs. AnyNull interface. | |
| 3520 if (ptr == Constant) ptr = NotNull; // forget it was a constant | |
| 247 | 3521 instance_id = InstanceBot; |
| 0 | 3522 } |
| 3523 ciObject* o = NULL; // the Constant value, if any | |
| 3524 if (ptr == Constant) { | |
| 3525 // Find out which constant. | |
| 3526 o = (this_klass == klass()) ? const_oop() : tinst->const_oop(); | |
| 3527 } | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3528 return make(ptr, k, xk, o, off, instance_id, speculative, depth); |
| 0 | 3529 } |
| 3530 | |
| 3531 // Either oop vs oop or interface vs interface or interface vs Object | |
| 3532 | |
| 3533 // !!! Here's how the symmetry requirement breaks down into invariants: | |
| 3534 // If we split one up & one down AND they subtype, take the down man. | |
| 3535 // If we split one up & one down AND they do NOT subtype, "fall hard". | |
| 3536 // If both are up and they subtype, take the subtype class. | |
| 3537 // If both are up and they do NOT subtype, "fall hard". | |
| 3538 // If both are down and they subtype, take the supertype class. | |
| 3539 // If both are down and they do NOT subtype, "fall hard". | |
| 3540 // Constants treated as down. | |
| 3541 | |
| 3542 // Now, reorder the above list; observe that both-down+subtype is also | |
| 3543 // "fall hard"; "fall hard" becomes the default case: | |
| 3544 // If we split one up & one down AND they subtype, take the down man. | |
| 3545 // If both are up and they subtype, take the subtype class. | |
| 3546 | |
| 3547 // If both are down and they subtype, "fall hard". | |
| 3548 // If both are down and they do NOT subtype, "fall hard". | |
| 3549 // If both are up and they do NOT subtype, "fall hard". | |
| 3550 // If we split one up & one down AND they do NOT subtype, "fall hard". | |
| 3551 | |
| 3552 // If a proper subtype is exact, and we return it, we return it exactly. | |
| 3553 // If a proper supertype is exact, there can be no subtyping relationship! | |
| 3554 // If both types are equal to the subtype, exactness is and-ed below the | |
| 3555 // centerline and or-ed above it. (N.B. Constants are always exact.) | |
| 3556 | |
| 3557 // Check for subtyping: | |
| 3558 ciKlass *subtype = NULL; | |
| 3559 bool subtype_exact = false; | |
| 3560 if( tinst_klass->equals(this_klass) ) { | |
| 3561 subtype = this_klass; | |
| 3562 subtype_exact = below_centerline(ptr) ? (this_xk & tinst_xk) : (this_xk | tinst_xk); | |
| 3563 } else if( !tinst_xk && this_klass->is_subtype_of( tinst_klass ) ) { | |
| 3564 subtype = this_klass; // Pick subtyping class | |
| 3565 subtype_exact = this_xk; | |
| 3566 } else if( !this_xk && tinst_klass->is_subtype_of( this_klass ) ) { | |
| 3567 subtype = tinst_klass; // Pick subtyping class | |
| 3568 subtype_exact = tinst_xk; | |
| 3569 } | |
| 3570 | |
| 3571 if( subtype ) { | |
| 3572 if( above_centerline(ptr) ) { // both are up? | |
| 3573 this_klass = tinst_klass = subtype; | |
| 3574 this_xk = tinst_xk = subtype_exact; | |
| 3575 } else if( above_centerline(this ->_ptr) && !above_centerline(tinst->_ptr) ) { | |
| 3576 this_klass = tinst_klass; // tinst is down; keep down man | |
| 3577 this_xk = tinst_xk; | |
| 3578 } else if( above_centerline(tinst->_ptr) && !above_centerline(this ->_ptr) ) { | |
| 3579 tinst_klass = this_klass; // this is down; keep down man | |
| 3580 tinst_xk = this_xk; | |
| 3581 } else { | |
| 3582 this_xk = subtype_exact; // either they are equal, or we'll do an LCA | |
| 3583 } | |
| 3584 } | |
| 3585 | |
| 3586 // Check for classes now being equal | |
| 3587 if (tinst_klass->equals(this_klass)) { | |
| 3588 // If the klasses are equal, the constants may still differ. Fall to | |
| 3589 // NotNull if they do (neither constant is NULL; that is a special case | |
| 3590 // handled elsewhere). | |
| 3591 ciObject* o = NULL; // Assume not constant when done | |
| 3592 ciObject* this_oop = const_oop(); | |
| 3593 ciObject* tinst_oop = tinst->const_oop(); | |
| 3594 if( ptr == Constant ) { | |
| 3595 if (this_oop != NULL && tinst_oop != NULL && | |
| 3596 this_oop->equals(tinst_oop) ) | |
| 3597 o = this_oop; | |
| 3598 else if (above_centerline(this ->_ptr)) | |
| 3599 o = tinst_oop; | |
| 3600 else if (above_centerline(tinst ->_ptr)) | |
| 3601 o = this_oop; | |
| 3602 else | |
| 3603 ptr = NotNull; | |
| 3604 } | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3605 return make(ptr, this_klass, this_xk, o, off, instance_id, speculative, depth); |
| 0 | 3606 } // Else classes are not equal |
| 3607 | |
| 3608 // Since klasses are different, we require a LCA in the Java | |
| 3609 // class hierarchy - which means we have to fall to at least NotNull. | |
| 3610 if( ptr == TopPTR || ptr == AnyNull || ptr == Constant ) | |
| 3611 ptr = NotNull; | |
| 247 | 3612 instance_id = InstanceBot; |
| 0 | 3613 |
| 3614 // Now we find the LCA of Java classes | |
| 3615 ciKlass* k = this_klass->least_common_ancestor(tinst_klass); | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3616 return make(ptr, k, false, NULL, off, instance_id, speculative, depth); |
| 0 | 3617 } // End of case InstPtr |
| 3618 | |
| 3619 } // End of switch | |
| 3620 return this; // Return the double constant | |
| 3621 } | |
| 3622 | |
| 3623 | |
| 3624 //------------------------java_mirror_type-------------------------------------- | |
| 3625 ciType* TypeInstPtr::java_mirror_type() const { | |
| 3626 // must be a singleton type | |
| 3627 if( const_oop() == NULL ) return NULL; | |
| 3628 | |
| 3629 // must be of type java.lang.Class | |
| 3630 if( klass() != ciEnv::current()->Class_klass() ) return NULL; | |
| 3631 | |
| 3632 return const_oop()->as_instance()->java_mirror_type(); | |
| 3633 } | |
| 3634 | |
| 3635 | |
| 3636 //------------------------------xdual------------------------------------------ | |
| 3637 // Dual: do NOT dual on klasses. This means I do NOT understand the Java | |
| 605 | 3638 // inheritance mechanism. |
| 0 | 3639 const Type *TypeInstPtr::xdual() const { |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3640 return new TypeInstPtr(dual_ptr(), klass(), klass_is_exact(), const_oop(), dual_offset(), dual_instance_id(), dual_speculative(), dual_inline_depth()); |
| 0 | 3641 } |
| 3642 | |
| 3643 //------------------------------eq--------------------------------------------- | |
| 3644 // Structural equality check for Type representations | |
| 3645 bool TypeInstPtr::eq( const Type *t ) const { | |
| 3646 const TypeInstPtr *p = t->is_instptr(); | |
| 3647 return | |
| 3648 klass()->equals(p->klass()) && | |
| 3649 TypeOopPtr::eq(p); // Check sub-type stuff | |
| 3650 } | |
| 3651 | |
| 3652 //------------------------------hash------------------------------------------- | |
| 3653 // Type-specific hashing function. | |
| 3654 int TypeInstPtr::hash(void) const { | |
| 3655 int hash = klass()->hash() + TypeOopPtr::hash(); | |
| 3656 return hash; | |
| 3657 } | |
| 3658 | |
| 3659 //------------------------------dump2------------------------------------------ | |
| 3660 // Dump oop Type | |
| 3661 #ifndef PRODUCT | |
| 3662 void TypeInstPtr::dump2( Dict &d, uint depth, outputStream *st ) const { | |
| 3663 // Print the name of the klass. | |
| 3664 klass()->print_name_on(st); | |
| 3665 | |
| 3666 switch( _ptr ) { | |
| 3667 case Constant: | |
| 3668 // TO DO: Make CI print the hex address of the underlying oop. | |
| 3669 if (WizardMode || Verbose) { | |
| 3670 const_oop()->print_oop(st); | |
| 3671 } | |
| 3672 case BotPTR: | |
| 3673 if (!WizardMode && !Verbose) { | |
| 3674 if( _klass_is_exact ) st->print(":exact"); | |
| 3675 break; | |
| 3676 } | |
| 3677 case TopPTR: | |
| 3678 case AnyNull: | |
| 3679 case NotNull: | |
| 3680 st->print(":%s", ptr_msg[_ptr]); | |
| 3681 if( _klass_is_exact ) st->print(":exact"); | |
| 3682 break; | |
| 3683 } | |
| 3684 | |
| 3685 if( _offset ) { // Dump offset, if any | |
| 3686 if( _offset == OffsetBot ) st->print("+any"); | |
| 3687 else if( _offset == OffsetTop ) st->print("+unknown"); | |
| 3688 else st->print("+%d", _offset); | |
| 3689 } | |
| 3690 | |
| 3691 st->print(" *"); | |
| 223 | 3692 if (_instance_id == InstanceTop) |
| 3693 st->print(",iid=top"); | |
| 3694 else if (_instance_id != InstanceBot) | |
| 0 | 3695 st->print(",iid=%d",_instance_id); |
| 12966 | 3696 |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3697 dump_inline_depth(st); |
| 12966 | 3698 dump_speculative(st); |
| 0 | 3699 } |
| 3700 #endif | |
| 3701 | |
| 3702 //------------------------------add_offset------------------------------------- | |
| 12966 | 3703 const TypePtr *TypeInstPtr::add_offset(intptr_t offset) const { |
| 3704 return make(_ptr, klass(), klass_is_exact(), const_oop(), xadd_offset(offset), _instance_id, add_offset_speculative(offset)); | |
| 3705 } | |
| 3706 | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3707 const Type *TypeInstPtr::remove_speculative() const { |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3708 if (_speculative == NULL) { |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3709 return this; |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3710 } |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3711 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3712 return make(_ptr, klass(), klass_is_exact(), const_oop(), _offset, _instance_id, NULL, _inline_depth); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3713 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3714 |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3715 const TypeOopPtr *TypeInstPtr::with_inline_depth(int depth) const { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3716 if (!UseInlineDepthForSpeculativeTypes) { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3717 return this; |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3718 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3719 return make(_ptr, klass(), klass_is_exact(), const_oop(), _offset, _instance_id, _speculative, depth); |
| 0 | 3720 } |
| 3721 | |
| 3722 //============================================================================= | |
| 3723 // Convenience common pre-built types. | |
| 3724 const TypeAryPtr *TypeAryPtr::RANGE; | |
| 3725 const TypeAryPtr *TypeAryPtr::OOPS; | |
| 163 | 3726 const TypeAryPtr *TypeAryPtr::NARROWOOPS; |
| 0 | 3727 const TypeAryPtr *TypeAryPtr::BYTES; |
| 3728 const TypeAryPtr *TypeAryPtr::SHORTS; | |
| 3729 const TypeAryPtr *TypeAryPtr::CHARS; | |
| 3730 const TypeAryPtr *TypeAryPtr::INTS; | |
| 3731 const TypeAryPtr *TypeAryPtr::LONGS; | |
| 3732 const TypeAryPtr *TypeAryPtr::FLOATS; | |
| 3733 const TypeAryPtr *TypeAryPtr::DOUBLES; | |
| 3734 | |
| 3735 //------------------------------make------------------------------------------- | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3736 const TypeAryPtr *TypeAryPtr::make(PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth) { |
| 0 | 3737 assert(!(k == NULL && ary->_elem->isa_int()), |
| 3738 "integral arrays must be pre-equipped with a class"); | |
| 3739 if (!xk) xk = ary->ary_must_be_exact(); | |
| 247 | 3740 assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed"); |
| 0 | 3741 if (!UseExactTypes) xk = (ptr == Constant); |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3742 return (TypeAryPtr*)(new TypeAryPtr(ptr, NULL, ary, k, xk, offset, instance_id, false, speculative, inline_depth))->hashcons(); |
| 0 | 3743 } |
| 3744 | |
| 3745 //------------------------------make------------------------------------------- | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3746 const TypeAryPtr *TypeAryPtr::make(PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, int offset, int instance_id, const TypeOopPtr* speculative, int inline_depth, bool is_autobox_cache) { |
| 0 | 3747 assert(!(k == NULL && ary->_elem->isa_int()), |
| 3748 "integral arrays must be pre-equipped with a class"); | |
| 3749 assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" ); | |
| 3750 if (!xk) xk = (o != NULL) || ary->ary_must_be_exact(); | |
| 247 | 3751 assert(instance_id <= 0 || xk || !UseExactTypes, "instances are always exactly typed"); |
| 0 | 3752 if (!UseExactTypes) xk = (ptr == Constant); |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3753 return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, instance_id, is_autobox_cache, speculative, inline_depth))->hashcons(); |
| 0 | 3754 } |
| 3755 | |
| 3756 //------------------------------cast_to_ptr_type------------------------------- | |
| 3757 const Type *TypeAryPtr::cast_to_ptr_type(PTR ptr) const { | |
| 3758 if( ptr == _ptr ) return this; | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3759 return make(ptr, const_oop(), _ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth); |
| 0 | 3760 } |
| 3761 | |
| 3762 | |
| 3763 //-----------------------------cast_to_exactness------------------------------- | |
| 3764 const Type *TypeAryPtr::cast_to_exactness(bool klass_is_exact) const { | |
| 3765 if( klass_is_exact == _klass_is_exact ) return this; | |
| 3766 if (!UseExactTypes) return this; | |
| 3767 if (_ary->ary_must_be_exact()) return this; // cannot clear xk | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3768 return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _instance_id, _speculative, _inline_depth); |
| 0 | 3769 } |
| 3770 | |
| 247 | 3771 //-----------------------------cast_to_instance_id---------------------------- |
| 223 | 3772 const TypeOopPtr *TypeAryPtr::cast_to_instance_id(int instance_id) const { |
| 3773 if( instance_id == _instance_id ) return this; | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3774 return make(_ptr, const_oop(), _ary, klass(), _klass_is_exact, _offset, instance_id, _speculative, _inline_depth); |
| 0 | 3775 } |
| 3776 | |
| 3777 //-----------------------------narrow_size_type------------------------------- | |
| 3778 // Local cache for arrayOopDesc::max_array_length(etype), | |
| 3779 // which is kind of slow (and cached elsewhere by other users). | |
| 3780 static jint max_array_length_cache[T_CONFLICT+1]; | |
| 3781 static jint max_array_length(BasicType etype) { | |
| 3782 jint& cache = max_array_length_cache[etype]; | |
| 3783 jint res = cache; | |
| 3784 if (res == 0) { | |
| 3785 switch (etype) { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
3786 case T_NARROWOOP: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
3787 etype = T_OBJECT; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
3788 break; |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
3789 case T_NARROWKLASS: |
| 0 | 3790 case T_CONFLICT: |
| 3791 case T_ILLEGAL: | |
| 3792 case T_VOID: | |
| 3793 etype = T_BYTE; // will produce conservatively high value | |
| 3794 } | |
| 3795 cache = res = arrayOopDesc::max_array_length(etype); | |
| 3796 } | |
| 3797 return res; | |
| 3798 } | |
| 3799 | |
| 3800 // Narrow the given size type to the index range for the given array base type. | |
| 3801 // Return NULL if the resulting int type becomes empty. | |
|
366
8261ee795323
6711100: 64bit fastdebug server vm crashes with assert(_base == Int,"Not an Int")
rasbold
parents:
306
diff
changeset
|
3802 const TypeInt* TypeAryPtr::narrow_size_type(const TypeInt* size) const { |
| 0 | 3803 jint hi = size->_hi; |
| 3804 jint lo = size->_lo; | |
| 3805 jint min_lo = 0; | |
|
366
8261ee795323
6711100: 64bit fastdebug server vm crashes with assert(_base == Int,"Not an Int")
rasbold
parents:
306
diff
changeset
|
3806 jint max_hi = max_array_length(elem()->basic_type()); |
| 0 | 3807 //if (index_not_size) --max_hi; // type of a valid array index, FTR |
| 3808 bool chg = false; | |
| 10278 | 3809 if (lo < min_lo) { |
| 3810 lo = min_lo; | |
| 3811 if (size->is_con()) { | |
| 3812 hi = lo; | |
| 3813 } | |
| 3814 chg = true; | |
| 3815 } | |
| 3816 if (hi > max_hi) { | |
| 3817 hi = max_hi; | |
| 3818 if (size->is_con()) { | |
| 3819 lo = hi; | |
| 3820 } | |
| 3821 chg = true; | |
| 3822 } | |
| 605 | 3823 // Negative length arrays will produce weird intermediate dead fast-path code |
| 0 | 3824 if (lo > hi) |
|
366
8261ee795323
6711100: 64bit fastdebug server vm crashes with assert(_base == Int,"Not an Int")
rasbold
parents:
306
diff
changeset
|
3825 return TypeInt::ZERO; |
| 0 | 3826 if (!chg) |
| 3827 return size; | |
| 3828 return TypeInt::make(lo, hi, Type::WidenMin); | |
| 3829 } | |
| 3830 | |
| 3831 //-------------------------------cast_to_size---------------------------------- | |
| 3832 const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const { | |
| 3833 assert(new_size != NULL, ""); | |
|
366
8261ee795323
6711100: 64bit fastdebug server vm crashes with assert(_base == Int,"Not an Int")
rasbold
parents:
306
diff
changeset
|
3834 new_size = narrow_size_type(new_size); |
| 0 | 3835 if (new_size == size()) return this; |
|
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3836 const TypeAry* new_ary = TypeAry::make(elem(), new_size, is_stable()); |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3837 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id, _speculative, _inline_depth); |
| 0 | 3838 } |
| 3839 | |
| 3840 | |
|
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3841 //------------------------------cast_to_stable--------------------------------- |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3842 const TypeAryPtr* TypeAryPtr::cast_to_stable(bool stable, int stable_dimension) const { |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3843 if (stable_dimension <= 0 || (stable_dimension == 1 && stable == this->is_stable())) |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3844 return this; |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3845 |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3846 const Type* elem = this->elem(); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3847 const TypePtr* elem_ptr = elem->make_ptr(); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3848 |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3849 if (stable_dimension > 1 && elem_ptr != NULL && elem_ptr->isa_aryptr()) { |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3850 // If this is widened from a narrow oop, TypeAry::make will re-narrow it. |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3851 elem = elem_ptr = elem_ptr->is_aryptr()->cast_to_stable(stable, stable_dimension - 1); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3852 } |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3853 |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3854 const TypeAry* new_ary = TypeAry::make(elem, size(), stable); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3855 |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3856 return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset, _instance_id); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3857 } |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3858 |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3859 //-----------------------------stable_dimension-------------------------------- |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3860 int TypeAryPtr::stable_dimension() const { |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3861 if (!is_stable()) return 0; |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3862 int dim = 1; |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3863 const TypePtr* elem_ptr = elem()->make_ptr(); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3864 if (elem_ptr != NULL && elem_ptr->isa_aryptr()) |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3865 dim += elem_ptr->is_aryptr()->stable_dimension(); |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3866 return dim; |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3867 } |
|
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3868 |
| 0 | 3869 //------------------------------eq--------------------------------------------- |
| 3870 // Structural equality check for Type representations | |
| 3871 bool TypeAryPtr::eq( const Type *t ) const { | |
| 3872 const TypeAryPtr *p = t->is_aryptr(); | |
| 3873 return | |
| 3874 _ary == p->_ary && // Check array | |
| 3875 TypeOopPtr::eq(p); // Check sub-parts | |
| 3876 } | |
| 3877 | |
| 3878 //------------------------------hash------------------------------------------- | |
| 3879 // Type-specific hashing function. | |
| 3880 int TypeAryPtr::hash(void) const { | |
| 3881 return (intptr_t)_ary + TypeOopPtr::hash(); | |
| 3882 } | |
| 3883 | |
| 3884 //------------------------------meet------------------------------------------- | |
| 3885 // Compute the MEET of two types. It returns a new Type object. | |
| 12966 | 3886 const Type *TypeAryPtr::xmeet_helper(const Type *t) const { |
| 0 | 3887 // Perform a fast test for common case; meeting the same types together. |
| 3888 if( this == t ) return this; // Meeting same type-rep? | |
| 3889 // Current "this->_base" is Pointer | |
| 3890 switch (t->base()) { // switch on original type | |
| 3891 | |
| 3892 // Mixing ints & oops happens when javac reuses local variables | |
| 3893 case Int: | |
| 3894 case Long: | |
| 3895 case FloatTop: | |
| 3896 case FloatCon: | |
| 3897 case FloatBot: | |
| 3898 case DoubleTop: | |
| 3899 case DoubleCon: | |
| 3900 case DoubleBot: | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
3901 case NarrowOop: |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
3902 case NarrowKlass: |
| 0 | 3903 case Bottom: // Ye Olde Default |
| 3904 return Type::BOTTOM; | |
| 3905 case Top: | |
| 3906 return this; | |
| 3907 | |
| 3908 default: // All else is a mistake | |
| 3909 typerr(t); | |
| 3910 | |
| 3911 case OopPtr: { // Meeting to OopPtrs | |
| 3912 // Found a OopPtr type vs self-AryPtr type | |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
827
diff
changeset
|
3913 const TypeOopPtr *tp = t->is_oopptr(); |
| 0 | 3914 int offset = meet_offset(tp->offset()); |
| 3915 PTR ptr = meet_ptr(tp->ptr()); | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3916 int depth = meet_inline_depth(tp->inline_depth()); |
| 0 | 3917 switch (tp->ptr()) { |
| 3918 case TopPTR: | |
| 223 | 3919 case AnyNull: { |
| 3920 int instance_id = meet_instance_id(InstanceTop); | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3921 const TypeOopPtr* speculative = xmeet_speculative(tp); |
| 223 | 3922 return make(ptr, (ptr == Constant ? const_oop() : NULL), |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3923 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth); |
| 223 | 3924 } |
| 0 | 3925 case BotPTR: |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
827
diff
changeset
|
3926 case NotNull: { |
|
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
827
diff
changeset
|
3927 int instance_id = meet_instance_id(tp->instance_id()); |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3928 const TypeOopPtr* speculative = xmeet_speculative(tp); |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3929 return TypeOopPtr::make(ptr, offset, instance_id, speculative, depth); |
|
958
c7e94e8fff43
6880053: assert(alloc_obj->as_CheckCastPP()->type() != TypeInstPtr::NOTNULL)
kvn
parents:
827
diff
changeset
|
3930 } |
| 0 | 3931 default: ShouldNotReachHere(); |
| 3932 } | |
| 3933 } | |
| 3934 | |
| 3935 case AnyPtr: { // Meeting two AnyPtrs | |
| 3936 // Found an AnyPtr type vs self-AryPtr type | |
| 3937 const TypePtr *tp = t->is_ptr(); | |
| 3938 int offset = meet_offset(tp->offset()); | |
| 3939 PTR ptr = meet_ptr(tp->ptr()); | |
| 3940 switch (tp->ptr()) { | |
| 3941 case TopPTR: | |
| 3942 return this; | |
| 3943 case BotPTR: | |
| 3944 case NotNull: | |
| 3945 return TypePtr::make(AnyPtr, ptr, offset); | |
| 3946 case Null: | |
| 3947 if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset); | |
| 223 | 3948 // else fall through to AnyNull |
| 3949 case AnyNull: { | |
| 3950 int instance_id = meet_instance_id(InstanceTop); | |
| 12966 | 3951 const TypeOopPtr* speculative = _speculative; |
| 3952 return make(ptr, (ptr == Constant ? const_oop() : NULL), | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3953 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, _inline_depth); |
| 223 | 3954 } |
| 0 | 3955 default: ShouldNotReachHere(); |
| 3956 } | |
| 3957 } | |
| 3958 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
3959 case MetadataPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
3960 case KlassPtr: |
| 0 | 3961 case RawPtr: return TypePtr::BOTTOM; |
| 3962 | |
| 3963 case AryPtr: { // Meeting 2 references? | |
| 3964 const TypeAryPtr *tap = t->is_aryptr(); | |
| 3965 int off = meet_offset(tap->offset()); | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3966 const TypeAry *tary = _ary->meet_speculative(tap->_ary)->is_ary(); |
| 0 | 3967 PTR ptr = meet_ptr(tap->ptr()); |
| 223 | 3968 int instance_id = meet_instance_id(tap->instance_id()); |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
3969 const TypeOopPtr* speculative = xmeet_speculative(tap); |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
3970 int depth = meet_inline_depth(tap->inline_depth()); |
| 0 | 3971 ciKlass* lazy_klass = NULL; |
| 3972 if (tary->_elem->isa_int()) { | |
| 3973 // Integral array element types have irrelevant lattice relations. | |
| 3974 // It is the klass that determines array layout, not the element type. | |
| 3975 if (_klass == NULL) | |
| 3976 lazy_klass = tap->_klass; | |
| 3977 else if (tap->_klass == NULL || tap->_klass == _klass) { | |
| 3978 lazy_klass = _klass; | |
| 3979 } else { | |
| 3980 // Something like byte[int+] meets char[int+]. | |
| 3981 // This must fall to bottom, not (int[-128..65535])[int+]. | |
| 247 | 3982 instance_id = InstanceBot; |
|
12190
edb5ab0f3fe5
8001107: @Stable annotation for constant folding of lazily evaluated variables
vlivanov
parents:
10278
diff
changeset
|
3983 tary = TypeAry::make(Type::BOTTOM, tary->_size, tary->_stable); |
| 0 | 3984 } |
| 2351 | 3985 } else // Non integral arrays. |
| 14228 | 3986 // Must fall to bottom if exact klasses in upper lattice |
| 3987 // are not equal or super klass is exact. | |
| 3988 if ((above_centerline(ptr) || ptr == Constant) && klass() != tap->klass() && | |
| 3989 // meet with top[] and bottom[] are processed further down: | |
| 3990 tap->_klass != NULL && this->_klass != NULL && | |
| 3991 // both are exact and not equal: | |
| 3992 ((tap->_klass_is_exact && this->_klass_is_exact) || | |
| 3993 // 'tap' is exact and super or unrelated: | |
| 3994 (tap->_klass_is_exact && !tap->klass()->is_subtype_of(klass())) || | |
| 3995 // 'this' is exact and super or unrelated: | |
| 3996 (this->_klass_is_exact && !klass()->is_subtype_of(tap->klass())))) { | |
|
22943
2163da41681e
8075587: Compilation of constant array containing different sub classes crashes the JVM
roland
parents:
20360
diff
changeset
|
3997 if (above_centerline(ptr)) { |
|
2163da41681e
8075587: Compilation of constant array containing different sub classes crashes the JVM
roland
parents:
20360
diff
changeset
|
3998 tary = TypeAry::make(Type::BOTTOM, tary->_size, tary->_stable); |
|
2163da41681e
8075587: Compilation of constant array containing different sub classes crashes the JVM
roland
parents:
20360
diff
changeset
|
3999 } |
| 12966 | 4000 return make(NotNull, NULL, tary, lazy_klass, false, off, InstanceBot); |
| 0 | 4001 } |
| 2351 | 4002 |
|
1765
114e6b93e9e1
6980978: assert(mt == t->xmeet(this)) failed: meet not commutative
kvn
parents:
1761
diff
changeset
|
4003 bool xk = false; |
| 0 | 4004 switch (tap->ptr()) { |
| 4005 case AnyNull: | |
| 4006 case TopPTR: | |
| 4007 // Compute new klass on demand, do not use tap->_klass | |
| 12966 | 4008 if (below_centerline(this->_ptr)) { |
| 4009 xk = this->_klass_is_exact; | |
| 4010 } else { | |
| 4011 xk = (tap->_klass_is_exact | this->_klass_is_exact); | |
| 4012 } | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4013 return make(ptr, const_oop(), tary, lazy_klass, xk, off, instance_id, speculative, depth); |
| 0 | 4014 case Constant: { |
| 4015 ciObject* o = const_oop(); | |
| 4016 if( _ptr == Constant ) { | |
| 4017 if( tap->const_oop() != NULL && !o->equals(tap->const_oop()) ) { | |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
958
diff
changeset
|
4018 xk = (klass() == tap->klass()); |
| 0 | 4019 ptr = NotNull; |
| 4020 o = NULL; | |
| 247 | 4021 instance_id = InstanceBot; |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
958
diff
changeset
|
4022 } else { |
|
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
958
diff
changeset
|
4023 xk = true; |
| 0 | 4024 } |
| 12966 | 4025 } else if(above_centerline(_ptr)) { |
| 0 | 4026 o = tap->const_oop(); |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
958
diff
changeset
|
4027 xk = true; |
|
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
958
diff
changeset
|
4028 } else { |
|
1765
114e6b93e9e1
6980978: assert(mt == t->xmeet(this)) failed: meet not commutative
kvn
parents:
1761
diff
changeset
|
4029 // Only precise for identical arrays |
|
114e6b93e9e1
6980978: assert(mt == t->xmeet(this)) failed: meet not commutative
kvn
parents:
1761
diff
changeset
|
4030 xk = this->_klass_is_exact && (klass() == tap->klass()); |
| 0 | 4031 } |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4032 return TypeAryPtr::make(ptr, o, tary, lazy_klass, xk, off, instance_id, speculative, depth); |
| 0 | 4033 } |
| 4034 case NotNull: | |
| 4035 case BotPTR: | |
| 4036 // Compute new klass on demand, do not use tap->_klass | |
| 4037 if (above_centerline(this->_ptr)) | |
| 4038 xk = tap->_klass_is_exact; | |
| 4039 else xk = (tap->_klass_is_exact & this->_klass_is_exact) && | |
| 4040 (klass() == tap->klass()); // Only precise for identical arrays | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4041 return TypeAryPtr::make(ptr, NULL, tary, lazy_klass, xk, off, instance_id, speculative, depth); |
| 0 | 4042 default: ShouldNotReachHere(); |
| 4043 } | |
| 4044 } | |
| 4045 | |
| 4046 // All arrays inherit from Object class | |
| 4047 case InstPtr: { | |
| 4048 const TypeInstPtr *tp = t->is_instptr(); | |
| 4049 int offset = meet_offset(tp->offset()); | |
| 4050 PTR ptr = meet_ptr(tp->ptr()); | |
| 223 | 4051 int instance_id = meet_instance_id(tp->instance_id()); |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
4052 const TypeOopPtr* speculative = xmeet_speculative(tp); |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4053 int depth = meet_inline_depth(tp->inline_depth()); |
| 0 | 4054 switch (ptr) { |
| 4055 case TopPTR: | |
| 4056 case AnyNull: // Fall 'down' to dual of object klass | |
| 12966 | 4057 // For instances when a subclass meets a superclass we fall |
| 4058 // below the centerline when the superclass is exact. We need to | |
| 4059 // do the same here. | |
| 4060 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && !tp->klass_is_exact()) { | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4061 return TypeAryPtr::make(ptr, _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth); |
| 0 | 4062 } else { |
| 4063 // cannot subclass, so the meet has to fall badly below the centerline | |
| 4064 ptr = NotNull; | |
| 223 | 4065 instance_id = InstanceBot; |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4066 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), false, NULL,offset, instance_id, speculative, depth); |
| 0 | 4067 } |
| 4068 case Constant: | |
| 4069 case NotNull: | |
| 4070 case BotPTR: // Fall down to object klass | |
| 4071 // LCA is object_klass, but if we subclass from the top we can do better | |
| 4072 if (above_centerline(tp->ptr())) { | |
| 4073 // If 'tp' is above the centerline and it is Object class | |
| 605 | 4074 // then we can subclass in the Java class hierarchy. |
| 12966 | 4075 // For instances when a subclass meets a superclass we fall |
| 4076 // below the centerline when the superclass is exact. We need | |
| 4077 // to do the same here. | |
| 4078 if (tp->klass()->equals(ciEnv::current()->Object_klass()) && !tp->klass_is_exact()) { | |
| 0 | 4079 // that is, my array type is a subtype of 'tp' klass |
| 12966 | 4080 return make(ptr, (ptr == Constant ? const_oop() : NULL), |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4081 _ary, _klass, _klass_is_exact, offset, instance_id, speculative, depth); |
| 0 | 4082 } |
| 4083 } | |
| 4084 // The other case cannot happen, since t cannot be a subtype of an array. | |
| 4085 // The meet falls down to Object class below centerline. | |
| 4086 if( ptr == Constant ) | |
| 4087 ptr = NotNull; | |
| 223 | 4088 instance_id = InstanceBot; |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4089 return TypeInstPtr::make(ptr, ciEnv::current()->Object_klass(), false, NULL,offset, instance_id, speculative, depth); |
| 0 | 4090 default: typerr(t); |
| 4091 } | |
| 4092 } | |
| 4093 } | |
| 4094 return this; // Lint noise | |
| 4095 } | |
| 4096 | |
| 4097 //------------------------------xdual------------------------------------------ | |
| 4098 // Dual: compute field-by-field dual | |
| 4099 const Type *TypeAryPtr::xdual() const { | |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4100 return new TypeAryPtr(dual_ptr(), _const_oop, _ary->dual()->is_ary(),_klass, _klass_is_exact, dual_offset(), dual_instance_id(), is_autobox_cache(), dual_speculative(), dual_inline_depth()); |
| 0 | 4101 } |
| 4102 | |
|
820
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
4103 //----------------------interface_vs_oop--------------------------------------- |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
4104 #ifdef ASSERT |
|
23293
071a85b9e631
Fix interface_vs_oop assertion logic for array types
Tom Rodriguez <tom.rodriguez@oracle.com>
parents:
23286
diff
changeset
|
4105 bool TypeAryPtr::interface_vs_oop_helper(const Type *t) const { |
|
820
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
4106 const TypeAryPtr* t_aryptr = t->isa_aryptr(); |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
4107 if (t_aryptr) { |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
4108 return _ary->interface_vs_oop(t_aryptr->_ary); |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
4109 } |
|
23293
071a85b9e631
Fix interface_vs_oop assertion logic for array types
Tom Rodriguez <tom.rodriguez@oracle.com>
parents:
23286
diff
changeset
|
4110 return Type::interface_vs_oop_helper(t); |
|
820
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
4111 } |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
4112 #endif |
|
915cc9c5ebc6
6837094: False positive for "meet not symmetric" failure
kvn
parents:
628
diff
changeset
|
4113 |
| 0 | 4114 //------------------------------dump2------------------------------------------ |
| 4115 #ifndef PRODUCT | |
| 4116 void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const { | |
| 4117 _ary->dump2(d,depth,st); | |
| 4118 switch( _ptr ) { | |
| 4119 case Constant: | |
| 4120 const_oop()->print(st); | |
| 4121 break; | |
| 4122 case BotPTR: | |
| 4123 if (!WizardMode && !Verbose) { | |
| 4124 if( _klass_is_exact ) st->print(":exact"); | |
| 4125 break; | |
| 4126 } | |
| 4127 case TopPTR: | |
| 4128 case AnyNull: | |
| 4129 case NotNull: | |
| 4130 st->print(":%s", ptr_msg[_ptr]); | |
| 4131 if( _klass_is_exact ) st->print(":exact"); | |
| 4132 break; | |
| 4133 } | |
| 4134 | |
|
64
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
0
diff
changeset
|
4135 if( _offset != 0 ) { |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
0
diff
changeset
|
4136 int header_size = objArrayOopDesc::header_size() * wordSize; |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
0
diff
changeset
|
4137 if( _offset == OffsetTop ) st->print("+undefined"); |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
0
diff
changeset
|
4138 else if( _offset == OffsetBot ) st->print("+any"); |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
0
diff
changeset
|
4139 else if( _offset < header_size ) st->print("+%d", _offset); |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
0
diff
changeset
|
4140 else { |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
0
diff
changeset
|
4141 BasicType basic_elem_type = elem()->basic_type(); |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
0
diff
changeset
|
4142 int array_base = arrayOopDesc::base_offset_in_bytes(basic_elem_type); |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
0
diff
changeset
|
4143 int elem_size = type2aelembytes(basic_elem_type); |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
0
diff
changeset
|
4144 st->print("[%d]", (_offset - array_base)/elem_size); |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
0
diff
changeset
|
4145 } |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
0
diff
changeset
|
4146 } |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
0
diff
changeset
|
4147 st->print(" *"); |
| 223 | 4148 if (_instance_id == InstanceTop) |
| 4149 st->print(",iid=top"); | |
| 4150 else if (_instance_id != InstanceBot) | |
| 0 | 4151 st->print(",iid=%d",_instance_id); |
| 12966 | 4152 |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4153 dump_inline_depth(st); |
| 12966 | 4154 dump_speculative(st); |
| 0 | 4155 } |
| 4156 #endif | |
| 4157 | |
| 4158 bool TypeAryPtr::empty(void) const { | |
| 4159 if (_ary->empty()) return true; | |
| 4160 return TypeOopPtr::empty(); | |
| 4161 } | |
| 4162 | |
| 4163 //------------------------------add_offset------------------------------------- | |
| 12966 | 4164 const TypePtr *TypeAryPtr::add_offset(intptr_t offset) const { |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4165 return make(_ptr, _const_oop, _ary, _klass, _klass_is_exact, xadd_offset(offset), _instance_id, add_offset_speculative(offset), _inline_depth); |
| 12966 | 4166 } |
| 4167 | |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
4168 const Type *TypeAryPtr::remove_speculative() const { |
|
17731
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4169 if (_speculative == NULL) { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4170 return this; |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4171 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4172 assert(_inline_depth == InlineDepthTop || _inline_depth == InlineDepthBottom, "non speculative type shouldn't have inline depth"); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4173 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, NULL, _inline_depth); |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4174 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4175 |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4176 const TypeOopPtr *TypeAryPtr::with_inline_depth(int depth) const { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4177 if (!UseInlineDepthForSpeculativeTypes) { |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4178 return this; |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4179 } |
|
62825ea7e51f
8031754: Type speculation should favor profile data from outermost inlined method
roland
parents:
17726
diff
changeset
|
4180 return make(_ptr, _const_oop, _ary->remove_speculative()->is_ary(), _klass, _klass_is_exact, _offset, _instance_id, _speculative, depth); |
| 12966 | 4181 } |
| 0 | 4182 |
| 4183 //============================================================================= | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4184 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4185 //------------------------------hash------------------------------------------- |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4186 // Type-specific hashing function. |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4187 int TypeNarrowPtr::hash(void) const { |
|
827
bf3489cc0aa0
6856025: assert(_base >= OopPtr && _base <= KlassPtr,"Not a Java pointer")
never
parents:
820
diff
changeset
|
4188 return _ptrtype->hash() + 7; |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4189 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4190 |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4191 bool TypeNarrowPtr::singleton(void) const { // TRUE if type is a singleton |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4192 return _ptrtype->singleton(); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4193 } |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4194 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4195 bool TypeNarrowPtr::empty(void) const { |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4196 return _ptrtype->empty(); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4197 } |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4198 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4199 intptr_t TypeNarrowPtr::get_con() const { |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4200 return _ptrtype->get_con(); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4201 } |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4202 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4203 bool TypeNarrowPtr::eq( const Type *t ) const { |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4204 const TypeNarrowPtr* tc = isa_same_narrowptr(t); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4205 if (tc != NULL) { |
|
827
bf3489cc0aa0
6856025: assert(_base >= OopPtr && _base <= KlassPtr,"Not a Java pointer")
never
parents:
820
diff
changeset
|
4206 if (_ptrtype->base() != tc->_ptrtype->base()) { |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4207 return false; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4208 } |
|
827
bf3489cc0aa0
6856025: assert(_base >= OopPtr && _base <= KlassPtr,"Not a Java pointer")
never
parents:
820
diff
changeset
|
4209 return tc->_ptrtype->eq(_ptrtype); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4210 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4211 return false; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4212 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4213 |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4214 const Type *TypeNarrowPtr::xdual() const { // Compute dual right now. |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4215 const TypePtr* odual = _ptrtype->dual()->is_ptr(); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4216 return make_same_narrowptr(odual); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4217 } |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4218 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4219 |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
4220 const Type *TypeNarrowPtr::filter_helper(const Type *kills, bool include_speculative) const { |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4221 if (isa_same_narrowptr(kills)) { |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
4222 const Type* ft =_ptrtype->filter_helper(is_same_narrowptr(kills)->_ptrtype, include_speculative); |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4223 if (ft->empty()) |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4224 return Type::TOP; // Canonical empty value |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4225 if (ft->isa_ptr()) { |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4226 return make_hash_same_narrowptr(ft->isa_ptr()); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4227 } |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4228 return ft; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4229 } else if (kills->isa_ptr()) { |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
4230 const Type* ft = _ptrtype->join_helper(kills, include_speculative); |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4231 if (ft->empty()) |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4232 return Type::TOP; // Canonical empty value |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4233 return ft; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4234 } else { |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4235 return Type::TOP; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4236 } |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4237 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4238 |
|
293
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
247
diff
changeset
|
4239 //------------------------------xmeet------------------------------------------ |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4240 // Compute the MEET of two types. It returns a new Type object. |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4241 const Type *TypeNarrowPtr::xmeet( const Type *t ) const { |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4242 // Perform a fast test for common case; meeting the same types together. |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4243 if( this == t ) return this; // Meeting same type-rep? |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4244 |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4245 if (t->base() == base()) { |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4246 const Type* result = _ptrtype->xmeet(t->make_ptr()); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4247 if (result->isa_ptr()) { |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4248 return make_hash_same_narrowptr(result->is_ptr()); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4249 } |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4250 return result; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4251 } |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4252 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4253 // Current "this->_base" is NarrowKlass or NarrowOop |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4254 switch (t->base()) { // switch on original type |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4255 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4256 case Int: // Mixing ints & oops happens when javac |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4257 case Long: // reuses local variables |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4258 case FloatTop: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4259 case FloatCon: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4260 case FloatBot: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4261 case DoubleTop: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4262 case DoubleCon: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4263 case DoubleBot: |
|
293
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
247
diff
changeset
|
4264 case AnyPtr: |
|
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
247
diff
changeset
|
4265 case RawPtr: |
|
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
247
diff
changeset
|
4266 case OopPtr: |
|
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
247
diff
changeset
|
4267 case InstPtr: |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4268 case AryPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4269 case MetadataPtr: |
|
293
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
247
diff
changeset
|
4270 case KlassPtr: |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4271 case NarrowOop: |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4272 case NarrowKlass: |
|
293
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
247
diff
changeset
|
4273 |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4274 case Bottom: // Ye Olde Default |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4275 return Type::BOTTOM; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4276 case Top: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4277 return this; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4278 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4279 default: // All else is a mistake |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4280 typerr(t); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4281 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4282 } // End of switch |
|
293
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
247
diff
changeset
|
4283 |
|
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
247
diff
changeset
|
4284 return this; |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4285 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4286 |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4287 #ifndef PRODUCT |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4288 void TypeNarrowPtr::dump2( Dict & d, uint depth, outputStream *st ) const { |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4289 _ptrtype->dump2(d, depth, st); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4290 } |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4291 #endif |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4292 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4293 const TypeNarrowOop *TypeNarrowOop::BOTTOM; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4294 const TypeNarrowOop *TypeNarrowOop::NULL_PTR; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4295 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4296 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4297 const TypeNarrowOop* TypeNarrowOop::make(const TypePtr* type) { |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4298 return (const TypeNarrowOop*)(new TypeNarrowOop(type))->hashcons(); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4299 } |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4300 |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4301 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4302 #ifndef PRODUCT |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4303 void TypeNarrowOop::dump2( Dict & d, uint depth, outputStream *st ) const { |
| 417 | 4304 st->print("narrowoop: "); |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4305 TypeNarrowPtr::dump2(d, depth, st); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4306 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4307 #endif |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4308 |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4309 const TypeNarrowKlass *TypeNarrowKlass::NULL_PTR; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4310 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4311 const TypeNarrowKlass* TypeNarrowKlass::make(const TypePtr* type) { |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4312 return (const TypeNarrowKlass*)(new TypeNarrowKlass(type))->hashcons(); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4313 } |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4314 |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4315 #ifndef PRODUCT |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4316 void TypeNarrowKlass::dump2( Dict & d, uint depth, outputStream *st ) const { |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4317 st->print("narrowklass: "); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4318 TypeNarrowPtr::dump2(d, depth, st); |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4319 } |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4320 #endif |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4321 |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4322 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4323 //------------------------------eq--------------------------------------------- |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4324 // Structural equality check for Type representations |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4325 bool TypeMetadataPtr::eq( const Type *t ) const { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4326 const TypeMetadataPtr *a = (const TypeMetadataPtr*)t; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4327 ciMetadata* one = metadata(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4328 ciMetadata* two = a->metadata(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4329 if (one == NULL || two == NULL) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4330 return (one == two) && TypePtr::eq(t); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4331 } else { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4332 return one->equals(two) && TypePtr::eq(t); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4333 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4334 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4335 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4336 //------------------------------hash------------------------------------------- |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4337 // Type-specific hashing function. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4338 int TypeMetadataPtr::hash(void) const { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4339 return |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4340 (metadata() ? metadata()->hash() : 0) + |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4341 TypePtr::hash(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4342 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4343 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4344 //------------------------------singleton-------------------------------------- |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4345 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4346 // constants |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4347 bool TypeMetadataPtr::singleton(void) const { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4348 // detune optimizer to not generate constant metadta + constant offset as a constant! |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4349 // TopPTR, Null, AnyNull, Constant are all singletons |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4350 return (_offset == 0) && !below_centerline(_ptr); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4351 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4352 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4353 //------------------------------add_offset------------------------------------- |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4354 const TypePtr *TypeMetadataPtr::add_offset( intptr_t offset ) const { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4355 return make( _ptr, _metadata, xadd_offset(offset)); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4356 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4357 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4358 //-----------------------------filter------------------------------------------ |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4359 // Do not allow interface-vs.-noninterface joins to collapse to top. |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
4360 const Type *TypeMetadataPtr::filter_helper(const Type *kills, bool include_speculative) const { |
|
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
4361 const TypeMetadataPtr* ft = join_helper(kills, include_speculative)->isa_metadataptr(); |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4362 if (ft == NULL || ft->empty()) |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4363 return Type::TOP; // Canonical empty value |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4364 return ft; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4365 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4366 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4367 //------------------------------get_con---------------------------------------- |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4368 intptr_t TypeMetadataPtr::get_con() const { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4369 assert( _ptr == Null || _ptr == Constant, "" ); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4370 assert( _offset >= 0, "" ); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4371 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4372 if (_offset != 0) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4373 // After being ported to the compiler interface, the compiler no longer |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4374 // directly manipulates the addresses of oops. Rather, it only has a pointer |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4375 // to a handle at compile time. This handle is embedded in the generated |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4376 // code and dereferenced at the time the nmethod is made. Until that time, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4377 // it is not reasonable to do arithmetic with the addresses of oops (we don't |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4378 // have access to the addresses!). This does not seem to currently happen, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4379 // but this assertion here is to help prevent its occurence. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4380 tty->print_cr("Found oop constant with non-zero offset"); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4381 ShouldNotReachHere(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4382 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4383 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4384 return (intptr_t)metadata()->constant_encoding(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4385 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4386 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4387 //------------------------------cast_to_ptr_type------------------------------- |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4388 const Type *TypeMetadataPtr::cast_to_ptr_type(PTR ptr) const { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4389 if( ptr == _ptr ) return this; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4390 return make(ptr, metadata(), _offset); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4391 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4392 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4393 //------------------------------meet------------------------------------------- |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4394 // Compute the MEET of two types. It returns a new Type object. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4395 const Type *TypeMetadataPtr::xmeet( const Type *t ) const { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4396 // Perform a fast test for common case; meeting the same types together. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4397 if( this == t ) return this; // Meeting same type-rep? |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4398 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4399 // Current "this->_base" is OopPtr |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4400 switch (t->base()) { // switch on original type |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4401 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4402 case Int: // Mixing ints & oops happens when javac |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4403 case Long: // reuses local variables |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4404 case FloatTop: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4405 case FloatCon: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4406 case FloatBot: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4407 case DoubleTop: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4408 case DoubleCon: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4409 case DoubleBot: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4410 case NarrowOop: |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4411 case NarrowKlass: |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4412 case Bottom: // Ye Olde Default |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4413 return Type::BOTTOM; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4414 case Top: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4415 return this; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4416 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4417 default: // All else is a mistake |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4418 typerr(t); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4419 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4420 case AnyPtr: { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4421 // Found an AnyPtr type vs self-OopPtr type |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4422 const TypePtr *tp = t->is_ptr(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4423 int offset = meet_offset(tp->offset()); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4424 PTR ptr = meet_ptr(tp->ptr()); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4425 switch (tp->ptr()) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4426 case Null: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4427 if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4428 // else fall through: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4429 case TopPTR: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4430 case AnyNull: { |
| 17780 | 4431 return make(ptr, _metadata, offset); |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4432 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4433 case BotPTR: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4434 case NotNull: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4435 return TypePtr::make(AnyPtr, ptr, offset); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4436 default: typerr(t); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4437 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4438 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4439 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4440 case RawPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4441 case KlassPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4442 case OopPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4443 case InstPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4444 case AryPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4445 return TypePtr::BOTTOM; // Oop meet raw is not well defined |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4446 |
| 6728 | 4447 case MetadataPtr: { |
| 4448 const TypeMetadataPtr *tp = t->is_metadataptr(); | |
| 4449 int offset = meet_offset(tp->offset()); | |
| 4450 PTR tptr = tp->ptr(); | |
| 4451 PTR ptr = meet_ptr(tptr); | |
| 4452 ciMetadata* md = (tptr == TopPTR) ? metadata() : tp->metadata(); | |
| 4453 if (tptr == TopPTR || _ptr == TopPTR || | |
| 4454 metadata()->equals(tp->metadata())) { | |
| 4455 return make(ptr, md, offset); | |
| 4456 } | |
| 4457 // metadata is different | |
| 4458 if( ptr == Constant ) { // Cannot be equal constants, so... | |
| 4459 if( tptr == Constant && _ptr != Constant) return t; | |
| 4460 if( _ptr == Constant && tptr != Constant) return this; | |
| 4461 ptr = NotNull; // Fall down in lattice | |
| 4462 } | |
| 4463 return make(ptr, NULL, offset); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4464 break; |
| 6728 | 4465 } |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4466 } // End of switch |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4467 return this; // Return the double constant |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4468 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4469 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4470 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4471 //------------------------------xdual------------------------------------------ |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4472 // Dual of a pure metadata pointer. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4473 const Type *TypeMetadataPtr::xdual() const { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4474 return new TypeMetadataPtr(dual_ptr(), metadata(), dual_offset()); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4475 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4476 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4477 //------------------------------dump2------------------------------------------ |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4478 #ifndef PRODUCT |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4479 void TypeMetadataPtr::dump2( Dict &d, uint depth, outputStream *st ) const { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4480 st->print("metadataptr:%s", ptr_msg[_ptr]); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4481 if( metadata() ) st->print(INTPTR_FORMAT, metadata()); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4482 switch( _offset ) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4483 case OffsetTop: st->print("+top"); break; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4484 case OffsetBot: st->print("+any"); break; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4485 case 0: break; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4486 default: st->print("+%d",_offset); break; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4487 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4488 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4489 #endif |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4490 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4491 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4492 //============================================================================= |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4493 // Convenience common pre-built type. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4494 const TypeMetadataPtr *TypeMetadataPtr::BOTTOM; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4495 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4496 TypeMetadataPtr::TypeMetadataPtr(PTR ptr, ciMetadata* metadata, int offset): |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4497 TypePtr(MetadataPtr, ptr, offset), _metadata(metadata) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4498 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4499 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4500 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethod* m) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4501 return make(Constant, m, 0); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4502 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4503 const TypeMetadataPtr* TypeMetadataPtr::make(ciMethodData* m) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4504 return make(Constant, m, 0); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4505 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4506 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4507 //------------------------------make------------------------------------------- |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4508 // Create a meta data constant |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4509 const TypeMetadataPtr *TypeMetadataPtr::make(PTR ptr, ciMetadata* m, int offset) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4510 assert(m == NULL || !m->is_klass(), "wrong type"); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4511 return (TypeMetadataPtr*)(new TypeMetadataPtr(ptr, m, offset))->hashcons(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4512 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4513 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4514 |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4515 //============================================================================= |
| 0 | 4516 // Convenience common pre-built types. |
| 4517 | |
| 4518 // Not-null object klass or below | |
| 4519 const TypeKlassPtr *TypeKlassPtr::OBJECT; | |
| 4520 const TypeKlassPtr *TypeKlassPtr::OBJECT_OR_NULL; | |
| 4521 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4522 //------------------------------TypeKlassPtr----------------------------------- |
| 0 | 4523 TypeKlassPtr::TypeKlassPtr( PTR ptr, ciKlass* klass, int offset ) |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4524 : TypePtr(KlassPtr, ptr, offset), _klass(klass), _klass_is_exact(ptr == Constant) { |
| 0 | 4525 } |
| 4526 | |
| 4527 //------------------------------make------------------------------------------- | |
| 4528 // ptr to klass 'k', if Constant, or possibly to a sub-klass if not a Constant | |
| 4529 const TypeKlassPtr *TypeKlassPtr::make( PTR ptr, ciKlass* k, int offset ) { | |
| 4530 assert( k != NULL, "Expect a non-NULL klass"); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4531 assert(k->is_instance_klass() || k->is_array_klass(), "Incorrect type of klass oop"); |
| 0 | 4532 TypeKlassPtr *r = |
| 4533 (TypeKlassPtr*)(new TypeKlassPtr(ptr, k, offset))->hashcons(); | |
| 4534 | |
| 4535 return r; | |
| 4536 } | |
| 4537 | |
| 4538 //------------------------------eq--------------------------------------------- | |
| 4539 // Structural equality check for Type representations | |
| 4540 bool TypeKlassPtr::eq( const Type *t ) const { | |
| 4541 const TypeKlassPtr *p = t->is_klassptr(); | |
| 4542 return | |
| 4543 klass()->equals(p->klass()) && | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4544 TypePtr::eq(p); |
| 0 | 4545 } |
| 4546 | |
| 4547 //------------------------------hash------------------------------------------- | |
| 4548 // Type-specific hashing function. | |
| 4549 int TypeKlassPtr::hash(void) const { | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4550 return klass()->hash() + TypePtr::hash(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4551 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4552 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4553 //------------------------------singleton-------------------------------------- |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4554 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4555 // constants |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4556 bool TypeKlassPtr::singleton(void) const { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4557 // detune optimizer to not generate constant klass + constant offset as a constant! |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4558 // TopPTR, Null, AnyNull, Constant are all singletons |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4559 return (_offset == 0) && !below_centerline(_ptr); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4560 } |
| 0 | 4561 |
|
13014
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4562 // Do not allow interface-vs.-noninterface joins to collapse to top. |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
4563 const Type *TypeKlassPtr::filter_helper(const Type *kills, bool include_speculative) const { |
|
13014
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4564 // logic here mirrors the one from TypeOopPtr::filter. See comments |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4565 // there. |
|
14383
5ec7dace41a6
8027422: assert(_gvn.type(obj)->higher_equal(tjp)) failed: cast_up is no longer needed
roland
parents:
14228
diff
changeset
|
4566 const Type* ft = join_helper(kills, include_speculative); |
|
13014
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4567 const TypeKlassPtr* ftkp = ft->isa_klassptr(); |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4568 const TypeKlassPtr* ktkp = kills->isa_klassptr(); |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4569 |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4570 if (ft->empty()) { |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4571 if (!empty() && ktkp != NULL && ktkp->klass()->is_loaded() && ktkp->klass()->is_interface()) |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4572 return kills; // Uplift to interface |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4573 |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4574 return Type::TOP; // Canonical empty value |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4575 } |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4576 |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4577 // Interface klass type could be exact in opposite to interface type, |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4578 // return it here instead of incorrect Constant ptr J/L/Object (6894807). |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4579 if (ftkp != NULL && ktkp != NULL && |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4580 ftkp->is_loaded() && ftkp->klass()->is_interface() && |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4581 !ftkp->klass_is_exact() && // Keep exact interface klass |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4582 ktkp->is_loaded() && !ktkp->klass()->is_interface()) { |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4583 return ktkp->cast_to_ptr_type(ftkp->ptr()); |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4584 } |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4585 |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4586 return ft; |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4587 } |
|
6c2f07d1495f
8027140: Assertion in compiler when running bigapps/Kitchensink/stability
roland
parents:
12972
diff
changeset
|
4588 |
| 1761 | 4589 //----------------------compute_klass------------------------------------------ |
| 4590 // Compute the defining klass for this class | |
| 4591 ciKlass* TypeAryPtr::compute_klass(DEBUG_ONLY(bool verify)) const { | |
| 4592 // Compute _klass based on element type. | |
| 0 | 4593 ciKlass* k_ary = NULL; |
| 4594 const TypeInstPtr *tinst; | |
| 4595 const TypeAryPtr *tary; | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4596 const Type* el = elem(); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4597 if (el->isa_narrowoop()) { |
|
221
1e026f8da827
6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents:
183
diff
changeset
|
4598 el = el->make_ptr(); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4599 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4600 |
| 0 | 4601 // Get element klass |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4602 if ((tinst = el->isa_instptr()) != NULL) { |
| 0 | 4603 // Compute array klass from element klass |
| 4604 k_ary = ciObjArrayKlass::make(tinst->klass()); | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4605 } else if ((tary = el->isa_aryptr()) != NULL) { |
| 0 | 4606 // Compute array klass from element klass |
| 4607 ciKlass* k_elem = tary->klass(); | |
| 4608 // If element type is something like bottom[], k_elem will be null. | |
| 4609 if (k_elem != NULL) | |
| 4610 k_ary = ciObjArrayKlass::make(k_elem); | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4611 } else if ((el->base() == Type::Top) || |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4612 (el->base() == Type::Bottom)) { |
| 0 | 4613 // element type of Bottom occurs from meet of basic type |
| 4614 // and object; Top occurs when doing join on Bottom. | |
| 4615 // Leave k_ary at NULL. | |
| 4616 } else { | |
| 4617 // Cannot compute array klass directly from basic type, | |
| 4618 // since subtypes of TypeInt all have basic type T_INT. | |
| 1761 | 4619 #ifdef ASSERT |
| 4620 if (verify && el->isa_int()) { | |
| 4621 // Check simple cases when verifying klass. | |
| 4622 BasicType bt = T_ILLEGAL; | |
| 4623 if (el == TypeInt::BYTE) { | |
| 4624 bt = T_BYTE; | |
| 4625 } else if (el == TypeInt::SHORT) { | |
| 4626 bt = T_SHORT; | |
| 4627 } else if (el == TypeInt::CHAR) { | |
| 4628 bt = T_CHAR; | |
| 4629 } else if (el == TypeInt::INT) { | |
| 4630 bt = T_INT; | |
| 4631 } else { | |
| 4632 return _klass; // just return specified klass | |
| 4633 } | |
| 4634 return ciTypeArrayKlass::make(bt); | |
| 4635 } | |
| 4636 #endif | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4637 assert(!el->isa_int(), |
| 0 | 4638 "integral arrays must be pre-equipped with a class"); |
| 4639 // Compute array klass directly from basic type | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
64
diff
changeset
|
4640 k_ary = ciTypeArrayKlass::make(el->basic_type()); |
| 0 | 4641 } |
| 1761 | 4642 return k_ary; |
| 4643 } | |
| 4644 | |
| 4645 //------------------------------klass------------------------------------------ | |
| 4646 // Return the defining klass for this class | |
| 4647 ciKlass* TypeAryPtr::klass() const { | |
| 4648 if( _klass ) return _klass; // Return cached value, if possible | |
| 4649 | |
| 4650 // Oops, need to compute _klass and cache it | |
| 4651 ciKlass* k_ary = compute_klass(); | |
| 0 | 4652 |
|
2354
83f08886981c
7026631: field _klass is incorrectly set for dual type of TypeAryPtr::OOPS
kvn
parents:
2351
diff
changeset
|
4653 if( this != TypeAryPtr::OOPS && this->dual() != TypeAryPtr::OOPS ) { |
| 0 | 4654 // The _klass field acts as a cache of the underlying |
| 4655 // ciKlass for this array type. In order to set the field, | |
| 4656 // we need to cast away const-ness. | |
| 4657 // | |
| 4658 // IMPORTANT NOTE: we *never* set the _klass field for the | |
| 4659 // type TypeAryPtr::OOPS. This Type is shared between all | |
| 4660 // active compilations. However, the ciKlass which represents | |
| 4661 // this Type is *not* shared between compilations, so caching | |
| 4662 // this value would result in fetching a dangling pointer. | |
| 4663 // | |
| 4664 // Recomputing the underlying ciKlass for each request is | |
| 4665 // a bit less efficient than caching, but calls to | |
| 4666 // TypeAryPtr::OOPS->klass() are not common enough to matter. | |
| 4667 ((TypeAryPtr*)this)->_klass = k_ary; | |
| 163 | 4668 if (UseCompressedOops && k_ary != NULL && k_ary->is_obj_array_klass() && |
| 4669 _offset != 0 && _offset != arrayOopDesc::length_offset_in_bytes()) { | |
| 4670 ((TypeAryPtr*)this)->_is_ptr_to_narrowoop = true; | |
| 4671 } | |
| 4672 } | |
| 0 | 4673 return k_ary; |
| 4674 } | |
| 4675 | |
| 4676 | |
| 4677 //------------------------------add_offset------------------------------------- | |
| 4678 // Access internals of klass object | |
|
306
af945ba2e739
6741738: TypePtr::add_offset() set incorrect offset when the add overflows
kvn
parents:
293
diff
changeset
|
4679 const TypePtr *TypeKlassPtr::add_offset( intptr_t offset ) const { |
| 0 | 4680 return make( _ptr, klass(), xadd_offset(offset) ); |
| 4681 } | |
| 4682 | |
| 4683 //------------------------------cast_to_ptr_type------------------------------- | |
| 4684 const Type *TypeKlassPtr::cast_to_ptr_type(PTR ptr) const { | |
|
557
465813e0303a
6794939: assert(_base == OopPtr,"subclass must override cast_to_ptr_type")
kvn
parents:
555
diff
changeset
|
4685 assert(_base == KlassPtr, "subclass must override cast_to_ptr_type"); |
| 0 | 4686 if( ptr == _ptr ) return this; |
| 4687 return make(ptr, _klass, _offset); | |
| 4688 } | |
| 4689 | |
| 4690 | |
| 4691 //-----------------------------cast_to_exactness------------------------------- | |
| 4692 const Type *TypeKlassPtr::cast_to_exactness(bool klass_is_exact) const { | |
| 4693 if( klass_is_exact == _klass_is_exact ) return this; | |
| 4694 if (!UseExactTypes) return this; | |
| 4695 return make(klass_is_exact ? Constant : NotNull, _klass, _offset); | |
| 4696 } | |
| 4697 | |
| 4698 | |
| 4699 //-----------------------------as_instance_type-------------------------------- | |
| 4700 // Corresponding type for an instance of the given class. | |
| 4701 // It will be NotNull, and exact if and only if the klass type is exact. | |
| 4702 const TypeOopPtr* TypeKlassPtr::as_instance_type() const { | |
| 4703 ciKlass* k = klass(); | |
| 4704 bool xk = klass_is_exact(); | |
| 4705 //return TypeInstPtr::make(TypePtr::NotNull, k, xk, NULL, 0); | |
| 4706 const TypeOopPtr* toop = TypeOopPtr::make_from_klass_raw(k); | |
|
8760
96ef09c26978
8009166: [parfait] Null pointer deference in hotspot/src/share/vm/opto/type.cpp
morris
parents:
7623
diff
changeset
|
4707 guarantee(toop != NULL, "need type for given klass"); |
| 0 | 4708 toop = toop->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr(); |
| 4709 return toop->cast_to_exactness(xk)->is_oopptr(); | |
| 4710 } | |
| 4711 | |
| 4712 | |
| 4713 //------------------------------xmeet------------------------------------------ | |
| 4714 // Compute the MEET of two types, return a new Type object. | |
| 4715 const Type *TypeKlassPtr::xmeet( const Type *t ) const { | |
| 4716 // Perform a fast test for common case; meeting the same types together. | |
| 4717 if( this == t ) return this; // Meeting same type-rep? | |
| 4718 | |
| 4719 // Current "this->_base" is Pointer | |
| 4720 switch (t->base()) { // switch on original type | |
| 4721 | |
| 4722 case Int: // Mixing ints & oops happens when javac | |
| 4723 case Long: // reuses local variables | |
| 4724 case FloatTop: | |
| 4725 case FloatCon: | |
| 4726 case FloatBot: | |
| 4727 case DoubleTop: | |
| 4728 case DoubleCon: | |
| 4729 case DoubleBot: | |
|
293
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
247
diff
changeset
|
4730 case NarrowOop: |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6735
diff
changeset
|
4731 case NarrowKlass: |
| 0 | 4732 case Bottom: // Ye Olde Default |
| 4733 return Type::BOTTOM; | |
| 4734 case Top: | |
| 4735 return this; | |
| 4736 | |
| 4737 default: // All else is a mistake | |
| 4738 typerr(t); | |
| 4739 | |
| 4740 case AnyPtr: { // Meeting to AnyPtrs | |
| 4741 // Found an AnyPtr type vs self-KlassPtr type | |
| 4742 const TypePtr *tp = t->is_ptr(); | |
| 4743 int offset = meet_offset(tp->offset()); | |
| 4744 PTR ptr = meet_ptr(tp->ptr()); | |
| 4745 switch (tp->ptr()) { | |
| 4746 case TopPTR: | |
| 4747 return this; | |
| 4748 case Null: | |
| 4749 if( ptr == Null ) return TypePtr::make( AnyPtr, ptr, offset ); | |
| 4750 case AnyNull: | |
| 4751 return make( ptr, klass(), offset ); | |
| 4752 case BotPTR: | |
| 4753 case NotNull: | |
| 4754 return TypePtr::make(AnyPtr, ptr, offset); | |
| 4755 default: typerr(t); | |
| 4756 } | |
| 4757 } | |
| 4758 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4759 case RawPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4760 case MetadataPtr: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4761 case OopPtr: |
| 0 | 4762 case AryPtr: // Meet with AryPtr |
| 4763 case InstPtr: // Meet with InstPtr | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4764 return TypePtr::BOTTOM; |
| 0 | 4765 |
| 4766 // | |
| 4767 // A-top } | |
| 4768 // / | \ } Tops | |
| 4769 // B-top A-any C-top } | |
| 4770 // | / | \ | } Any-nulls | |
| 4771 // B-any | C-any } | |
| 4772 // | | | | |
| 4773 // B-con A-con C-con } constants; not comparable across classes | |
| 4774 // | | | | |
| 4775 // B-not | C-not } | |
| 4776 // | \ | / | } not-nulls | |
| 4777 // B-bot A-not C-bot } | |
| 4778 // \ | / } Bottoms | |
| 4779 // A-bot } | |
| 4780 // | |
| 4781 | |
| 4782 case KlassPtr: { // Meet two KlassPtr types | |
| 4783 const TypeKlassPtr *tkls = t->is_klassptr(); | |
| 4784 int off = meet_offset(tkls->offset()); | |
| 4785 PTR ptr = meet_ptr(tkls->ptr()); | |
| 4786 | |
| 4787 // Check for easy case; klasses are equal (and perhaps not loaded!) | |
| 4788 // If we have constants, then we created oops so classes are loaded | |
| 4789 // and we can handle the constants further down. This case handles | |
| 4790 // not-loaded classes | |
| 4791 if( ptr != Constant && tkls->klass()->equals(klass()) ) { | |
| 4792 return make( ptr, klass(), off ); | |
| 4793 } | |
| 4794 | |
| 4795 // Classes require inspection in the Java klass hierarchy. Must be loaded. | |
| 4796 ciKlass* tkls_klass = tkls->klass(); | |
| 4797 ciKlass* this_klass = this->klass(); | |
| 4798 assert( tkls_klass->is_loaded(), "This class should have been loaded."); | |
| 4799 assert( this_klass->is_loaded(), "This class should have been loaded."); | |
| 4800 | |
| 4801 // If 'this' type is above the centerline and is a superclass of the | |
| 4802 // other, we can treat 'this' as having the same type as the other. | |
| 4803 if ((above_centerline(this->ptr())) && | |
| 4804 tkls_klass->is_subtype_of(this_klass)) { | |
| 4805 this_klass = tkls_klass; | |
| 4806 } | |
| 4807 // If 'tinst' type is above the centerline and is a superclass of the | |
| 4808 // other, we can treat 'tinst' as having the same type as the other. | |
| 4809 if ((above_centerline(tkls->ptr())) && | |
| 4810 this_klass->is_subtype_of(tkls_klass)) { | |
| 4811 tkls_klass = this_klass; | |
| 4812 } | |
| 4813 | |
| 4814 // Check for classes now being equal | |
| 4815 if (tkls_klass->equals(this_klass)) { | |
| 4816 // If the klasses are equal, the constants may still differ. Fall to | |
| 4817 // NotNull if they do (neither constant is NULL; that is a special case | |
| 4818 // handled elsewhere). | |
| 4819 if( ptr == Constant ) { | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4820 if (this->_ptr == Constant && tkls->_ptr == Constant && |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4821 this->klass()->equals(tkls->klass())); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4822 else if (above_centerline(this->ptr())); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4823 else if (above_centerline(tkls->ptr())); |
| 0 | 4824 else |
| 4825 ptr = NotNull; | |
| 4826 } | |
| 4827 return make( ptr, this_klass, off ); | |
| 4828 } // Else classes are not equal | |
| 4829 | |
| 4830 // Since klasses are different, we require the LCA in the Java | |
| 4831 // class hierarchy - which means we have to fall to at least NotNull. | |
| 4832 if( ptr == TopPTR || ptr == AnyNull || ptr == Constant ) | |
| 4833 ptr = NotNull; | |
| 4834 // Now we find the LCA of Java classes | |
| 4835 ciKlass* k = this_klass->least_common_ancestor(tkls_klass); | |
| 4836 return make( ptr, k, off ); | |
| 4837 } // End of case KlassPtr | |
| 4838 | |
| 4839 } // End of switch | |
| 4840 return this; // Return the double constant | |
| 4841 } | |
| 4842 | |
| 4843 //------------------------------xdual------------------------------------------ | |
| 4844 // Dual: compute field-by-field dual | |
| 4845 const Type *TypeKlassPtr::xdual() const { | |
| 4846 return new TypeKlassPtr( dual_ptr(), klass(), dual_offset() ); | |
| 4847 } | |
| 4848 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4849 //------------------------------get_con---------------------------------------- |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4850 intptr_t TypeKlassPtr::get_con() const { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4851 assert( _ptr == Null || _ptr == Constant, "" ); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4852 assert( _offset >= 0, "" ); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4853 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4854 if (_offset != 0) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4855 // After being ported to the compiler interface, the compiler no longer |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4856 // directly manipulates the addresses of oops. Rather, it only has a pointer |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4857 // to a handle at compile time. This handle is embedded in the generated |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4858 // code and dereferenced at the time the nmethod is made. Until that time, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4859 // it is not reasonable to do arithmetic with the addresses of oops (we don't |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4860 // have access to the addresses!). This does not seem to currently happen, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4861 // but this assertion here is to help prevent its occurence. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4862 tty->print_cr("Found oop constant with non-zero offset"); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4863 ShouldNotReachHere(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4864 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4865 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4866 return (intptr_t)klass()->constant_encoding(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6198
diff
changeset
|
4867 } |
| 0 | 4868 //------------------------------dump2------------------------------------------ |
| 4869 // Dump Klass Type | |
| 4870 #ifndef PRODUCT | |
| 4871 void TypeKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const { | |
| 4872 switch( _ptr ) { | |
| 4873 case Constant: | |
| 4874 st->print("precise "); | |
| 4875 case NotNull: | |
| 4876 { | |
| 4877 const char *name = klass()->name()->as_utf8(); | |
| 4878 if( name ) { | |
| 4879 st->print("klass %s: " INTPTR_FORMAT, name, klass()); | |
| 4880 } else { | |
| 4881 ShouldNotReachHere(); | |
| 4882 } | |
| 4883 } | |
| 4884 case BotPTR: | |
| 4885 if( !WizardMode && !Verbose && !_klass_is_exact ) break; | |
| 4886 case TopPTR: | |
| 4887 case AnyNull: | |
| 4888 st->print(":%s", ptr_msg[_ptr]); | |
| 4889 if( _klass_is_exact ) st->print(":exact"); | |
| 4890 break; | |
| 4891 } | |
| 4892 | |
| 4893 if( _offset ) { // Dump offset, if any | |
| 4894 if( _offset == OffsetBot ) { st->print("+any"); } | |
| 4895 else if( _offset == OffsetTop ) { st->print("+unknown"); } | |
| 4896 else { st->print("+%d", _offset); } | |
| 4897 } | |
| 4898 | |
| 4899 st->print(" *"); | |
| 4900 } | |
| 4901 #endif | |
| 4902 | |
| 4903 | |
| 4904 | |
| 4905 //============================================================================= | |
| 4906 // Convenience common pre-built types. | |
| 4907 | |
| 4908 //------------------------------make------------------------------------------- | |
| 4909 const TypeFunc *TypeFunc::make( const TypeTuple *domain, const TypeTuple *range ) { | |
| 4910 return (TypeFunc*)(new TypeFunc(domain,range))->hashcons(); | |
| 4911 } | |
| 4912 | |
| 4913 //------------------------------make------------------------------------------- | |
| 4914 const TypeFunc *TypeFunc::make(ciMethod* method) { | |
| 4915 Compile* C = Compile::current(); | |
| 4916 const TypeFunc* tf = C->last_tf(method); // check cache | |
| 4917 if (tf != NULL) return tf; // The hit rate here is almost 50%. | |
| 4918 const TypeTuple *domain; | |
|
1137
97125851f396
6829187: compiler optimizations required for JSR 292
twisti
parents:
1009
diff
changeset
|
4919 if (method->is_static()) { |
| 0 | 4920 domain = TypeTuple::make_domain(NULL, method->signature()); |
| 4921 } else { | |
| 4922 domain = TypeTuple::make_domain(method->holder(), method->signature()); | |
| 4923 } | |
| 4924 const TypeTuple *range = TypeTuple::make_range(method->signature()); | |
| 4925 tf = TypeFunc::make(domain, range); | |
| 4926 C->set_last_tf(method, tf); // fill cache | |
| 4927 return tf; | |
| 4928 } | |
| 4929 | |
| 4930 //------------------------------meet------------------------------------------- | |
| 4931 // Compute the MEET of two types. It returns a new Type object. | |
| 4932 const Type *TypeFunc::xmeet( const Type *t ) const { | |
| 4933 // Perform a fast test for common case; meeting the same types together. | |
| 4934 if( this == t ) return this; // Meeting same type-rep? | |
| 4935 | |
| 4936 // Current "this->_base" is Func | |
| 4937 switch (t->base()) { // switch on original type | |
| 4938 | |
| 4939 case Bottom: // Ye Olde Default | |
| 4940 return t; | |
| 4941 | |
| 4942 default: // All else is a mistake | |
| 4943 typerr(t); | |
| 4944 | |
| 4945 case Top: | |
| 4946 break; | |
| 4947 } | |
| 4948 return this; // Return the double constant | |
| 4949 } | |
| 4950 | |
| 4951 //------------------------------xdual------------------------------------------ | |
| 4952 // Dual: compute field-by-field dual | |
| 4953 const Type *TypeFunc::xdual() const { | |
| 4954 return this; | |
| 4955 } | |
| 4956 | |
| 4957 //------------------------------eq--------------------------------------------- | |
| 4958 // Structural equality check for Type representations | |
| 4959 bool TypeFunc::eq( const Type *t ) const { | |
| 4960 const TypeFunc *a = (const TypeFunc*)t; | |
| 4961 return _domain == a->_domain && | |
| 4962 _range == a->_range; | |
| 4963 } | |
| 4964 | |
| 4965 //------------------------------hash------------------------------------------- | |
| 4966 // Type-specific hashing function. | |
| 4967 int TypeFunc::hash(void) const { | |
| 4968 return (intptr_t)_domain + (intptr_t)_range; | |
| 4969 } | |
| 4970 | |
| 4971 //------------------------------dump2------------------------------------------ | |
| 4972 // Dump Function Type | |
| 4973 #ifndef PRODUCT | |
| 4974 void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const { | |
| 4975 if( _range->_cnt <= Parms ) | |
| 4976 st->print("void"); | |
| 4977 else { | |
| 4978 uint i; | |
| 4979 for (i = Parms; i < _range->_cnt-1; i++) { | |
| 4980 _range->field_at(i)->dump2(d,depth,st); | |
| 4981 st->print("/"); | |
| 4982 } | |
| 4983 _range->field_at(i)->dump2(d,depth,st); | |
| 4984 } | |
| 4985 st->print(" "); | |
| 4986 st->print("( "); | |
| 4987 if( !depth || d[this] ) { // Check for recursive dump | |
| 4988 st->print("...)"); | |
| 4989 return; | |
| 4990 } | |
| 4991 d.Insert((void*)this,(void*)this); // Stop recursion | |
| 4992 if (Parms < _domain->_cnt) | |
| 4993 _domain->field_at(Parms)->dump2(d,depth-1,st); | |
| 4994 for (uint i = Parms+1; i < _domain->_cnt; i++) { | |
| 4995 st->print(", "); | |
| 4996 _domain->field_at(i)->dump2(d,depth-1,st); | |
| 4997 } | |
| 4998 st->print(" )"); | |
| 4999 } | |
| 5000 #endif | |
| 5001 | |
| 5002 //------------------------------singleton-------------------------------------- | |
| 5003 // TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple | |
| 5004 // constants (Ldi nodes). Singletons are integer, float or double constants | |
| 5005 // or a single symbol. | |
| 5006 bool TypeFunc::singleton(void) const { | |
| 5007 return false; // Never a singleton | |
| 5008 } | |
| 5009 | |
| 5010 bool TypeFunc::empty(void) const { | |
| 5011 return false; // Never empty | |
| 5012 } | |
| 5013 | |
| 5014 | |
| 5015 BasicType TypeFunc::return_type() const{ | |
| 5016 if (range()->cnt() == TypeFunc::Parms) { | |
| 5017 return T_VOID; | |
| 5018 } | |
| 5019 return range()->field_at(TypeFunc::Parms)->basic_type(); | |
| 5020 } |