Mercurial > hg > truffle
annotate src/share/vm/opto/multnode.cpp @ 17480:1b46c3672650
Merge
author | kizune |
---|---|
date | Fri, 13 Dec 2013 22:13:52 +0400 |
parents | 3213ba4d3dff |
children | de6a9e811145 |
rev | line source |
---|---|
0 | 1 /* |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
1972
diff
changeset
|
2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
10278 | 26 #include "opto/callnode.hpp" |
12956
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
27 #include "opto/cfgnode.hpp" |
1972 | 28 #include "opto/matcher.hpp" |
12323 | 29 #include "opto/mathexactnode.hpp" |
1972 | 30 #include "opto/multnode.hpp" |
31 #include "opto/opcodes.hpp" | |
32 #include "opto/phaseX.hpp" | |
33 #include "opto/regmask.hpp" | |
34 #include "opto/type.hpp" | |
0 | 35 |
36 //============================================================================= | |
37 //------------------------------MultiNode-------------------------------------- | |
38 const RegMask &MultiNode::out_RegMask() const { | |
39 return RegMask::Empty; | |
40 } | |
41 | |
42 Node *MultiNode::match( const ProjNode *proj, const Matcher *m ) { return proj->clone(); } | |
43 | |
44 //------------------------------proj_out--------------------------------------- | |
45 // Get a named projection | |
46 ProjNode* MultiNode::proj_out(uint which_proj) const { | |
47 assert(Opcode() != Op_If || which_proj == (uint)true || which_proj == (uint)false, "must be 1 or 0"); | |
48 assert(Opcode() != Op_If || outcnt() == 2, "bad if #1"); | |
49 for( DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++ ) { | |
50 Node *p = fast_out(i); | |
12323 | 51 if (p->is_Proj()) { |
52 ProjNode *proj = p->as_Proj(); | |
53 if (proj->_con == which_proj) { | |
54 assert(Opcode() != Op_If || proj->Opcode() == (which_proj?Op_IfTrue:Op_IfFalse), "bad if #2"); | |
55 return proj; | |
56 } | |
57 } else if (p->is_FlagsProj()) { | |
58 FlagsProjNode *proj = p->as_FlagsProj(); | |
59 if (proj->_con == which_proj) { | |
60 return proj; | |
61 } | |
62 } else { | |
0 | 63 assert(p == this && this->is_Start(), "else must be proj"); |
64 continue; | |
65 } | |
66 } | |
67 return NULL; | |
68 } | |
69 | |
70 //============================================================================= | |
71 //------------------------------ProjNode--------------------------------------- | |
72 uint ProjNode::hash() const { | |
73 // only one input | |
74 return (uintptr_t)in(TypeFunc::Control) + (_con << 1) + (_is_io_use ? 1 : 0); | |
75 } | |
76 uint ProjNode::cmp( const Node &n ) const { return _con == ((ProjNode&)n)._con && ((ProjNode&)n)._is_io_use == _is_io_use; } | |
77 uint ProjNode::size_of() const { return sizeof(ProjNode); } | |
78 | |
79 // Test if we propagate interesting control along this projection | |
80 bool ProjNode::is_CFG() const { | |
81 Node *def = in(0); | |
82 return (_con == TypeFunc::Control && def->is_CFG()); | |
83 } | |
84 | |
10278 | 85 const Type* ProjNode::proj_type(const Type* t) const { |
86 if (t == Type::TOP) { | |
87 return Type::TOP; | |
88 } | |
89 if (t == Type::BOTTOM) { | |
90 return Type::BOTTOM; | |
91 } | |
92 t = t->is_tuple()->field_at(_con); | |
93 Node* n = in(0); | |
94 if ((_con == TypeFunc::Parms) && | |
95 n->is_CallStaticJava() && n->as_CallStaticJava()->is_boxing_method()) { | |
96 // The result of autoboxing is always non-null on normal path. | |
97 t = t->join(TypePtr::NOTNULL); | |
98 } | |
99 return t; | |
100 } | |
101 | |
0 | 102 const Type *ProjNode::bottom_type() const { |
10278 | 103 if (in(0) == NULL) return Type::TOP; |
104 return proj_type(in(0)->bottom_type()); | |
0 | 105 } |
106 | |
107 const TypePtr *ProjNode::adr_type() const { | |
108 if (bottom_type() == Type::MEMORY) { | |
109 // in(0) might be a narrow MemBar; otherwise we will report TypePtr::BOTTOM | |
110 const TypePtr* adr_type = in(0)->adr_type(); | |
111 #ifdef ASSERT | |
112 if (!is_error_reported() && !Node::in_dump()) | |
113 assert(adr_type != NULL, "source must have adr_type"); | |
114 #endif | |
115 return adr_type; | |
116 } | |
117 assert(bottom_type()->base() != Type::Memory, "no other memories?"); | |
118 return NULL; | |
119 } | |
120 | |
121 bool ProjNode::pinned() const { return in(0)->pinned(); } | |
122 #ifndef PRODUCT | |
123 void ProjNode::dump_spec(outputStream *st) const { st->print("#%d",_con); if(_is_io_use) st->print(" (i_o_use)");} | |
124 #endif | |
125 | |
126 //----------------------------check_con---------------------------------------- | |
127 void ProjNode::check_con() const { | |
128 Node* n = in(0); | |
129 if (n == NULL) return; // should be assert, but NodeHash makes bogons | |
130 if (n->is_Mach()) return; // mach. projs. are not type-safe | |
131 if (n->is_Start()) return; // alas, starts can have mach. projs. also | |
132 if (_con == SCMemProjNode::SCMEMPROJCON ) return; | |
133 const Type* t = n->bottom_type(); | |
134 if (t == Type::TOP) return; // multi is dead | |
135 assert(_con < t->is_tuple()->cnt(), "ProjNode::_con must be in range"); | |
136 } | |
137 | |
138 //------------------------------Value------------------------------------------ | |
139 const Type *ProjNode::Value( PhaseTransform *phase ) const { | |
10278 | 140 if (in(0) == NULL) return Type::TOP; |
141 return proj_type(phase->type(in(0))); | |
0 | 142 } |
143 | |
144 //------------------------------out_RegMask------------------------------------ | |
145 // Pass the buck uphill | |
146 const RegMask &ProjNode::out_RegMask() const { | |
147 return RegMask::Empty; | |
148 } | |
149 | |
150 //------------------------------ideal_reg-------------------------------------- | |
151 uint ProjNode::ideal_reg() const { | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
1972
diff
changeset
|
152 return bottom_type()->ideal_reg(); |
0 | 153 } |
12956
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
154 |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
155 //-------------------------------is_uncommon_trap_proj---------------------------- |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
156 // Return true if proj is the form of "proj->[region->..]call_uct" |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
157 bool ProjNode::is_uncommon_trap_proj(Deoptimization::DeoptReason reason) { |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
158 int path_limit = 10; |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
159 Node* out = this; |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
160 for (int ct = 0; ct < path_limit; ct++) { |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
161 out = out->unique_ctrl_out(); |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
162 if (out == NULL) |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
163 return false; |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
164 if (out->is_CallStaticJava()) { |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
165 int req = out->as_CallStaticJava()->uncommon_trap_request(); |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
166 if (req != 0) { |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
167 Deoptimization::DeoptReason trap_reason = Deoptimization::trap_request_reason(req); |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
168 if (trap_reason == reason || reason == Deoptimization::Reason_none) { |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
169 return true; |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
170 } |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
171 } |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
172 return false; // don't do further after call |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
173 } |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
174 if (out->Opcode() != Op_Region) |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
175 return false; |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
176 } |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
177 return false; |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
178 } |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
179 |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
180 //-------------------------------is_uncommon_trap_if_pattern------------------------- |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
181 // Return true for "if(test)-> proj -> ... |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
182 // | |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
183 // V |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
184 // other_proj->[region->..]call_uct" |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
185 // |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
186 // "must_reason_predicate" means the uct reason must be Reason_predicate |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
187 bool ProjNode::is_uncommon_trap_if_pattern(Deoptimization::DeoptReason reason) { |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
188 Node *in0 = in(0); |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
189 if (!in0->is_If()) return false; |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
190 // Variation of a dead If node. |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
191 if (in0->outcnt() < 2) return false; |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
192 IfNode* iff = in0->as_If(); |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
193 |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
194 // we need "If(Conv2B(Opaque1(...)))" pattern for reason_predicate |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
195 if (reason != Deoptimization::Reason_none) { |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
196 if (iff->in(1)->Opcode() != Op_Conv2B || |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
197 iff->in(1)->in(1)->Opcode() != Op_Opaque1) { |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
198 return false; |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
199 } |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
200 } |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
201 |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
202 ProjNode* other_proj = iff->proj_out(1-_con)->as_Proj(); |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
203 if (other_proj->is_uncommon_trap_proj(reason)) { |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
204 assert(reason == Deoptimization::Reason_none || |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
205 Compile::current()->is_predicate_opaq(iff->in(1)->in(1)), "should be on the list"); |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
206 return true; |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
207 } |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
208 return false; |
3213ba4d3dff
8024069: replace_in_map() should operate on parent maps
roland
parents:
12323
diff
changeset
|
209 } |