1 /*
2 * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
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 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "opto/callnode.hpp"
26 #include "opto/cfgnode.hpp"
27 #include "opto/matcher.hpp"
28 #include "opto/mathexactnode.hpp"
29 #include "opto/multnode.hpp"
30 #include "opto/opcodes.hpp"
31 #include "opto/phaseX.hpp"
32 #include "opto/regmask.hpp"
33 #include "opto/type.hpp"
34 #include "utilities/vmError.hpp"
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 or null if not found
46 ProjNode* MultiNode::proj_out_or_null(uint which_proj) const {
47 assert((Opcode() != Op_If && Opcode() != Op_RangeCheck) || which_proj == (uint)true || which_proj == (uint)false, "must be 1 or 0");
48 assert(number_of_projs(which_proj) <= 1, "only when there's a single projection");
49 ProjNode* proj = find_first(which_proj);
50 assert(proj == nullptr || (Opcode() != Op_If && Opcode() != Op_RangeCheck) || proj->Opcode() == (which_proj ? Op_IfTrue : Op_IfFalse),
51 "incorrect projection node at If/RangeCheck: IfTrue on false path or IfFalse on true path");
52 return proj;
53 }
54
55 ProjNode* MultiNode::proj_out_or_null(uint which_proj, bool is_io_use) const {
56 assert(number_of_projs(which_proj, is_io_use) <= 1, "only when there's a single projection");
57 return find_first(which_proj, is_io_use);
58 }
59
60 template<class Callback> ProjNode* MultiNode::apply_to_projs(Callback callback, uint which_proj, bool is_io_use) const {
61 auto filter = [&](ProjNode* proj) {
62 if (proj->_is_io_use == is_io_use && callback(proj) == BREAK_AND_RETURN_CURRENT_PROJ) {
135 n->is_CallStaticJava() && n->as_CallStaticJava()->is_boxing_method()) {
136 // The result of autoboxing is always non-null on normal path.
137 t = t->join_speculative(TypePtr::NOTNULL);
138 }
139 return t;
140 }
141
142 const Type *ProjNode::bottom_type() const {
143 if (in(0) == nullptr) return Type::TOP;
144 return proj_type(in(0)->bottom_type());
145 }
146
147 const TypePtr *ProjNode::adr_type() const {
148 if (bottom_type() == Type::MEMORY) {
149 // in(0) might be a narrow MemBar; otherwise we will report TypePtr::BOTTOM
150 Node* ctrl = in(0);
151 if (ctrl->Opcode() == Op_Tuple) {
152 // Jumping over Tuples: the i-th projection of a Tuple is the i-th input of the Tuple.
153 ctrl = ctrl->in(_con);
154 }
155 if (ctrl == nullptr) return nullptr; // node is dead
156 const TypePtr* adr_type = ctrl->adr_type();
157 #ifdef ASSERT
158 if (!VMError::is_error_reported() && !Node::in_dump())
159 assert(adr_type != nullptr, "source must have adr_type");
160 #endif
161 return adr_type;
162 }
163 assert(bottom_type()->base() != Type::Memory, "no other memories?");
164 return nullptr;
165 }
166
167 bool ProjNode::pinned() const { return in(0)->pinned(); }
168 #ifndef PRODUCT
169 void ProjNode::dump_spec(outputStream *st) const { st->print("#%d",_con); if(_is_io_use) st->print(" (i_o_use)");}
170
171 void ProjNode::dump_compact_spec(outputStream *st) const {
172 for (DUIterator i = this->outs(); this->has_out(i); i++) {
173 Node* o = this->out(i);
174 if (not_a_node(o)) {
175 st->print("[?]");
|
1 /*
2 * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
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 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "opto/callnode.hpp"
26 #include "opto/cfgnode.hpp"
27 #include "opto/matcher.hpp"
28 #include "opto/mathexactnode.hpp"
29 #include "opto/multnode.hpp"
30 #include "opto/opcodes.hpp"
31 #include "opto/phaseX.hpp"
32 #include "opto/regmask.hpp"
33 #include "opto/type.hpp"
34 #include "utilities/vmError.hpp"
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, const RegMask* mask) { return proj->clone(); }
43
44 //------------------------------proj_out---------------------------------------
45 // Get a named projection or null if not found
46 ProjNode* MultiNode::proj_out_or_null(uint which_proj) const {
47 assert((Opcode() != Op_If && Opcode() != Op_RangeCheck) || which_proj == (uint)true || which_proj == (uint)false, "must be 1 or 0");
48 assert(number_of_projs(which_proj) <= 1, "only when there's a single projection");
49 ProjNode* proj = find_first(which_proj);
50 assert(proj == nullptr || (Opcode() != Op_If && Opcode() != Op_RangeCheck) || proj->Opcode() == (which_proj ? Op_IfTrue : Op_IfFalse),
51 "incorrect projection node at If/RangeCheck: IfTrue on false path or IfFalse on true path");
52 return proj;
53 }
54
55 ProjNode* MultiNode::proj_out_or_null(uint which_proj, bool is_io_use) const {
56 assert(number_of_projs(which_proj, is_io_use) <= 1, "only when there's a single projection");
57 return find_first(which_proj, is_io_use);
58 }
59
60 template<class Callback> ProjNode* MultiNode::apply_to_projs(Callback callback, uint which_proj, bool is_io_use) const {
61 auto filter = [&](ProjNode* proj) {
62 if (proj->_is_io_use == is_io_use && callback(proj) == BREAK_AND_RETURN_CURRENT_PROJ) {
135 n->is_CallStaticJava() && n->as_CallStaticJava()->is_boxing_method()) {
136 // The result of autoboxing is always non-null on normal path.
137 t = t->join_speculative(TypePtr::NOTNULL);
138 }
139 return t;
140 }
141
142 const Type *ProjNode::bottom_type() const {
143 if (in(0) == nullptr) return Type::TOP;
144 return proj_type(in(0)->bottom_type());
145 }
146
147 const TypePtr *ProjNode::adr_type() const {
148 if (bottom_type() == Type::MEMORY) {
149 // in(0) might be a narrow MemBar; otherwise we will report TypePtr::BOTTOM
150 Node* ctrl = in(0);
151 if (ctrl->Opcode() == Op_Tuple) {
152 // Jumping over Tuples: the i-th projection of a Tuple is the i-th input of the Tuple.
153 ctrl = ctrl->in(_con);
154 }
155 // node is dead or we are in the process of removing a dead subgraph
156 if (ctrl == nullptr || ctrl->is_top()) {
157 return nullptr;
158 }
159 const TypePtr* adr_type = ctrl->adr_type();
160 #ifdef ASSERT
161 if (!VMError::is_error_reported() && !Node::in_dump())
162 assert(adr_type != nullptr, "source must have adr_type");
163 #endif
164 return adr_type;
165 }
166 assert(bottom_type()->base() != Type::Memory, "no other memories?");
167 return nullptr;
168 }
169
170 bool ProjNode::pinned() const { return in(0)->pinned(); }
171 #ifndef PRODUCT
172 void ProjNode::dump_spec(outputStream *st) const { st->print("#%d",_con); if(_is_io_use) st->print(" (i_o_use)");}
173
174 void ProjNode::dump_compact_spec(outputStream *st) const {
175 for (DUIterator i = this->outs(); this->has_out(i); i++) {
176 Node* o = this->out(i);
177 if (not_a_node(o)) {
178 st->print("[?]");
|