1 /*
2 * Copyright (c) 1997, 2023, 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 "precompiled.hpp"
26 #include "memory/allocation.inline.hpp"
27 #include "opto/callnode.hpp"
28 #include "opto/cfgnode.hpp"
29 #include "opto/phaseX.hpp"
30 #include "opto/regmask.hpp"
31 #include "opto/rootnode.hpp"
32 #include "opto/subnode.hpp"
33 #include "opto/type.hpp"
34 #include "code/SCCache.hpp"
35
36 //------------------------------Ideal------------------------------------------
37 // Remove dead inputs
38 Node *RootNode::Ideal(PhaseGVN *phase, bool can_reshape) {
39 bool modified = false;
40 for( uint i = 1; i < req(); i++ ) { // For all inputs
41 // Check for and remove dead inputs
42 if( phase->type(in(i)) == Type::TOP ) {
43 del_req(i--); // Delete TOP inputs
44 modified = true;
45 }
46 }
47
48 // I used to do tail-splitting in the Ideal graph here, but it does not
49 // work. The tail-splitting forces values live into the Return to be
50 // ready at a point which dominates the split returns. This forces Stores
51 // to be hoisted high. The "proper" fix would be to split Stores down
52 // each path, but this makes the split unprofitable. If we want to do this
53 // optimization, it needs to be done after allocation so we can count all
54 // the instructions needing to be cloned in the cost metric.
55
56 // There used to be a spoof here for caffeine marks which completely
57 // eliminated very simple self-recursion recursions, but it's not worth it.
58 // Deep inlining of self-calls gets nearly all of the same benefits.
59 // If we want to get the rest of the win later, we should pattern match
60 // simple recursive call trees to closed-form solutions.
61
62 return modified ? this : nullptr;
63 }
64
65 //=============================================================================
66 HaltNode::HaltNode(Node* ctrl, Node* frameptr, const char* halt_reason, bool reachable)
67 : Node(TypeFunc::Parms), _halt_reason(halt_reason), _reachable(reachable) {
68 init_class_id(Class_Halt);
69 Node* top = Compile::current()->top();
70 init_req(TypeFunc::Control, ctrl );
71 init_req(TypeFunc::I_O, top);
72 init_req(TypeFunc::Memory, top);
73 init_req(TypeFunc::FramePtr, frameptr );
74 init_req(TypeFunc::ReturnAdr,top);
75 SCCache::add_C_string(halt_reason);
76 }
77
78 const Type *HaltNode::bottom_type() const { return Type::BOTTOM; }
79 uint HaltNode::size_of() const { return sizeof(*this); }
80
81 //------------------------------Ideal------------------------------------------
82 Node *HaltNode::Ideal(PhaseGVN *phase, bool can_reshape) {
83 return remove_dead_region(phase, can_reshape) ? this : nullptr;
84 }
85
86 //------------------------------Value------------------------------------------
87 const Type* HaltNode::Value(PhaseGVN* phase) const {
88 return ( phase->type(in(TypeFunc::Control)) == Type::TOP)
89 ? Type::TOP
90 : Type::BOTTOM;
91 }
92
93 const RegMask &HaltNode::out_RegMask() const {
94 return RegMask::Empty;
95 }