|
0
|
1 /*
|
|
|
2 * Copyright 2005-2006 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
|
|
|
20 * CA 95054 USA or visit www.sun.com if you need additional information or
|
|
|
21 * have any questions.
|
|
|
22 *
|
|
|
23 */
|
|
|
24
|
|
|
25 //-----------------------------------------------------------------------------
|
|
|
26 //----------------------------IdealKit-----------------------------------------
|
|
|
27 // Set of utilities for creating control flow and scalar SSA data flow.
|
|
|
28 // Control:
|
|
|
29 // if_then(left, relop, right)
|
|
|
30 // else_ (optional)
|
|
|
31 // end_if
|
|
|
32 // loop(iv variable, initial, relop, limit)
|
|
|
33 // - sets iv to initial for first trip
|
|
|
34 // - exits when relation on limit is true
|
|
|
35 // - the values of initial and limit should be loop invariant
|
|
|
36 // - no increment, must be explicitly coded
|
|
|
37 // - final value of iv is available after end_loop (until dead())
|
|
|
38 // end_loop
|
|
|
39 // make_label(number of gotos)
|
|
|
40 // goto_(label)
|
|
|
41 // bind(label)
|
|
|
42 // Data:
|
|
|
43 // ConI(integer constant) - create an integer constant
|
|
|
44 // set(variable, value) - assignment
|
|
|
45 // value(variable) - reference value
|
|
|
46 // dead(variable) - variable's value is no longer live
|
|
|
47 // increment(variable, value) - increment variable by value
|
|
|
48 // simple operations: AddI, SubI, AndI, LShiftI, etc.
|
|
|
49 // Example:
|
|
|
50 // Node* limit = ??
|
|
|
51 // IdealVariable i(kit), j(kit);
|
|
|
52 // declares_done();
|
|
|
53 // Node* exit = make_label(1); // 1 goto
|
|
|
54 // set(j, ConI(0));
|
|
|
55 // loop(i, ConI(0), BoolTest::lt, limit); {
|
|
|
56 // if_then(value(i), BoolTest::gt, ConI(5)) {
|
|
|
57 // set(j, ConI(1));
|
|
|
58 // goto_(exit); dead(i);
|
|
|
59 // } end_if();
|
|
|
60 // increment(i, ConI(1));
|
|
|
61 // } end_loop(); dead(i);
|
|
|
62 // bind(exit);
|
|
|
63 //
|
|
|
64 // See string_indexOf for a more complete example.
|
|
|
65
|
|
|
66 class IdealKit;
|
|
|
67
|
|
|
68 // Variable definition for IdealKit
|
|
|
69 class IdealVariable: public StackObj {
|
|
|
70 friend class IdealKit;
|
|
|
71 private:
|
|
|
72 int _id;
|
|
|
73 void set_id(int id) { _id = id; }
|
|
|
74 public:
|
|
|
75 IdealVariable(IdealKit &k);
|
|
|
76 int id() { assert(has_id(),"uninitialized id"); return _id; }
|
|
|
77 bool has_id() { return _id >= 0; }
|
|
|
78 };
|
|
|
79
|
|
|
80 class IdealKit: public StackObj {
|
|
|
81 friend class IdealVariable;
|
|
|
82 // The main state (called a cvstate for Control and Variables)
|
|
|
83 // contains both the current values of the variables and the
|
|
|
84 // current set of predecessor control edges. The variable values
|
|
|
85 // are managed via a Node [in(1)..in(_var_ct)], and the predecessor
|
|
|
86 // control edges managed via a RegionNode. The in(0) of the Node
|
|
|
87 // for variables points to the RegionNode for the control edges.
|
|
|
88 protected:
|
|
|
89 Compile * const C;
|
|
|
90 PhaseGVN &_gvn;
|
|
|
91 GrowableArray<Node*>* _pending_cvstates; // stack of cvstates
|
|
|
92 GrowableArray<Node*>* _delay_transform; // delay invoking gvn.transform until drain
|
|
|
93 Node* _cvstate; // current cvstate (control, memory and variables)
|
|
|
94 uint _var_ct; // number of variables
|
|
|
95 bool _delay_all_transforms; // flag forcing all transforms to be delayed
|
|
|
96 Node* _initial_ctrl; // saves initial control until variables declared
|
|
|
97 Node* _initial_memory; // saves initial memory until variables declared
|
|
|
98
|
|
|
99 PhaseGVN& gvn() const { return _gvn; }
|
|
|
100 // Create a new cvstate filled with nulls
|
|
|
101 Node* new_cvstate(); // Create a new cvstate
|
|
|
102 Node* cvstate() { return _cvstate; } // current cvstate
|
|
|
103 Node* copy_cvstate(); // copy current cvstate
|
|
|
104 void set_ctrl(Node* ctrl) { _cvstate->set_req(TypeFunc::Control, ctrl); }
|
|
|
105
|
|
|
106 // Should this assert this is a MergeMem???
|
|
|
107 void set_all_memory(Node* mem){ _cvstate->set_req(TypeFunc::Memory, mem); }
|
|
|
108 void set_memory(Node* mem, uint alias_idx );
|
|
|
109 void do_memory_merge(Node* merging, Node* join);
|
|
|
110 void clear(Node* m); // clear a cvstate
|
|
|
111 void stop() { clear(_cvstate); } // clear current cvstate
|
|
|
112 Node* delay_transform(Node* n);
|
|
|
113 Node* transform(Node* n); // gvn.transform or push node on delay list
|
|
|
114 Node* promote_to_phi(Node* n, Node* reg);// Promote "n" to a phi on region "reg"
|
|
|
115 bool was_promoted_to_phi(Node* n, Node* reg) {
|
|
|
116 return (n->is_Phi() && n->in(0) == reg);
|
|
|
117 }
|
|
|
118 void declare(IdealVariable* v) { v->set_id(_var_ct++); }
|
|
|
119 // This declares the position where vars are kept in the cvstate
|
|
|
120 // For some degree of consistency we use the TypeFunc enum to
|
|
|
121 // soak up spots in the inputs even though we only use early Control
|
|
|
122 // and Memory slots. (So far.)
|
|
|
123 static const uint first_var; // = TypeFunc::Parms + 1;
|
|
|
124
|
|
|
125 #ifdef ASSERT
|
|
|
126 enum State { NullS=0, BlockS=1, LoopS=2, IfThenS=4, ElseS=8, EndifS= 16 };
|
|
|
127 GrowableArray<int>* _state;
|
|
|
128 State state() { return (State)(_state->top()); }
|
|
|
129 #endif
|
|
|
130
|
|
|
131 // Users should not care about slices only MergedMem so no access for them.
|
|
|
132 Node* memory(uint alias_idx);
|
|
|
133
|
|
|
134 public:
|
|
|
135 IdealKit(PhaseGVN &gvn, Node* control, Node* memory, bool delay_all_transforms = false);
|
|
|
136 ~IdealKit() {
|
|
|
137 stop();
|
|
|
138 drain_delay_transform();
|
|
|
139 }
|
|
|
140 // Control
|
|
|
141 Node* ctrl() { return _cvstate->in(TypeFunc::Control); }
|
|
|
142 Node* top() { return C->top(); }
|
|
|
143 MergeMemNode* merged_memory() { return _cvstate->in(TypeFunc::Memory)->as_MergeMem(); }
|
|
|
144 void set(IdealVariable& v, Node* rhs) { _cvstate->set_req(first_var + v.id(), rhs); }
|
|
|
145 Node* value(IdealVariable& v) { return _cvstate->in(first_var + v.id()); }
|
|
|
146 void dead(IdealVariable& v) { set(v, (Node*)NULL); }
|
|
|
147 void if_then(Node* left, BoolTest::mask relop, Node* right,
|
|
|
148 float prob = PROB_FAIR, float cnt = COUNT_UNKNOWN,
|
|
|
149 bool push_new_state = true);
|
|
|
150 void else_();
|
|
|
151 void end_if();
|
|
|
152 void loop(IdealVariable& iv, Node* init, BoolTest::mask cmp, Node* limit,
|
|
|
153 float prob = PROB_LIKELY(0.9), float cnt = COUNT_UNKNOWN);
|
|
|
154 void end_loop();
|
|
|
155 Node* make_label(int goto_ct);
|
|
|
156 void bind(Node* lab);
|
|
|
157 void goto_(Node* lab, bool bind = false);
|
|
|
158 void declares_done();
|
|
|
159 void drain_delay_transform();
|
|
|
160
|
|
|
161 Node* IfTrue(IfNode* iff) { return transform(new (C,1) IfTrueNode(iff)); }
|
|
|
162 Node* IfFalse(IfNode* iff) { return transform(new (C,1) IfFalseNode(iff)); }
|
|
|
163
|
|
|
164 // Data
|
|
|
165 Node* ConI(jint k) { return (Node*)gvn().intcon(k); }
|
|
|
166 Node* makecon(const Type *t) const { return _gvn.makecon(t); }
|
|
|
167
|
|
|
168 Node* AddI(Node* l, Node* r) { return transform(new (C,3) AddINode(l, r)); }
|
|
|
169 Node* SubI(Node* l, Node* r) { return transform(new (C,3) SubINode(l, r)); }
|
|
|
170 Node* AndI(Node* l, Node* r) { return transform(new (C,3) AndINode(l, r)); }
|
|
|
171 Node* MaxI(Node* l, Node* r) { return transform(new (C,3) MaxINode(l, r)); }
|
|
|
172 Node* LShiftI(Node* l, Node* r) { return transform(new (C,3) LShiftINode(l, r)); }
|
|
|
173 Node* CmpI(Node* l, Node* r) { return transform(new (C,3) CmpINode(l, r)); }
|
|
|
174 Node* Bool(Node* cmp, BoolTest::mask relop) { return transform(new (C,2) BoolNode(cmp, relop)); }
|
|
|
175 void increment(IdealVariable& v, Node* j) { set(v, AddI(value(v), j)); }
|
|
|
176 void decrement(IdealVariable& v, Node* j) { set(v, SubI(value(v), j)); }
|
|
|
177
|
|
|
178 Node* CmpL(Node* l, Node* r) { return transform(new (C,3) CmpLNode(l, r)); }
|
|
|
179
|
|
|
180 // TLS
|
|
|
181 Node* thread() { return gvn().transform(new (C, 1) ThreadLocalNode()); }
|
|
|
182
|
|
|
183 // Pointers
|
|
|
184 Node* AddP(Node *base, Node *ptr, Node *off) { return transform(new (C,4) AddPNode(base, ptr, off)); }
|
|
|
185 Node* CmpP(Node* l, Node* r) { return transform(new (C,3) CmpPNode(l, r)); }
|
|
|
186 #ifdef _LP64
|
|
|
187 Node* XorX(Node* l, Node* r) { return transform(new (C,3) XorLNode(l, r)); }
|
|
|
188 #else // _LP64
|
|
|
189 Node* XorX(Node* l, Node* r) { return transform(new (C,3) XorINode(l, r)); }
|
|
|
190 #endif // _LP64
|
|
|
191 Node* URShiftX(Node* l, Node* r) { return transform(new (C,3) URShiftXNode(l, r)); }
|
|
|
192 Node* ConX(jint k) { return (Node*)gvn().MakeConX(k); }
|
|
|
193 Node* CastPX(Node* ctl, Node* p) { return transform(new (C,2) CastP2XNode(ctl, p)); }
|
|
|
194 // Add a fixed offset to a pointer
|
|
|
195 Node* basic_plus_adr(Node* base, Node* ptr, intptr_t offset);
|
|
|
196
|
|
|
197 // Memory operations
|
|
|
198
|
|
|
199 // This is the base version which is given an alias index.
|
|
|
200 Node* load(Node* ctl,
|
|
|
201 Node* adr,
|
|
|
202 const Type* t,
|
|
|
203 BasicType bt,
|
|
|
204 int adr_idx,
|
|
|
205 bool require_atomic_access = false);
|
|
|
206
|
|
|
207 // Return the new StoreXNode
|
|
|
208 Node* store(Node* ctl,
|
|
|
209 Node* adr,
|
|
|
210 Node* val,
|
|
|
211 BasicType bt,
|
|
|
212 int adr_idx,
|
|
|
213 bool require_atomic_access = false);
|
|
|
214
|
|
|
215 // Store a card mark ordered after store_oop
|
|
|
216 Node* storeCM(Node* ctl,
|
|
|
217 Node* adr,
|
|
|
218 Node* val,
|
|
|
219 Node* oop_store,
|
|
|
220 BasicType bt,
|
|
|
221 int adr_idx);
|
|
|
222
|
|
|
223 // Trivial call
|
|
|
224 void make_leaf_call(const TypeFunc *slow_call_type,
|
|
|
225 address slow_call,
|
|
|
226 const char *leaf_name,
|
|
|
227 Node* parm0,
|
|
|
228 Node* parm1 = NULL,
|
|
|
229 Node* parm2 = NULL);
|
|
|
230 };
|
