Wed, 28 Aug 2013 11:22:43 +0200
8023597: Optimize G1 barriers code for unsafe load_store
Summary: Avoid loading old values in G1 pre-barriers for inlined unsafe load_store nodes.
Reviewed-by: kvn, tonyp
Contributed-by: Martin Doerr <martin.doerr@sap.com>
duke@435 | 1 | /* |
mikael@4153 | 2 | * Copyright (c) 2005, 2012, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "opto/addnode.hpp" |
stefank@2314 | 27 | #include "opto/callnode.hpp" |
stefank@2314 | 28 | #include "opto/cfgnode.hpp" |
stefank@2314 | 29 | #include "opto/idealKit.hpp" |
stefank@2314 | 30 | #include "opto/runtime.hpp" |
duke@435 | 31 | |
duke@435 | 32 | // Static initialization |
duke@435 | 33 | |
duke@435 | 34 | // This declares the position where vars are kept in the cvstate |
duke@435 | 35 | // For some degree of consistency we use the TypeFunc enum to |
duke@435 | 36 | // soak up spots in the inputs even though we only use early Control |
duke@435 | 37 | // and Memory slots. (So far.) |
duke@435 | 38 | const uint IdealKit::first_var = TypeFunc::Parms + 1; |
duke@435 | 39 | |
duke@435 | 40 | //----------------------------IdealKit----------------------------------------- |
kvn@2726 | 41 | IdealKit::IdealKit(GraphKit* gkit, bool delay_all_transforms, bool has_declarations) : |
kvn@2726 | 42 | _gvn(gkit->gvn()), C(gkit->C) { |
kvn@2726 | 43 | _initial_ctrl = gkit->control(); |
kvn@2726 | 44 | _initial_memory = gkit->merged_memory(); |
kvn@2726 | 45 | _initial_i_o = gkit->i_o(); |
duke@435 | 46 | _delay_all_transforms = delay_all_transforms; |
duke@435 | 47 | _var_ct = 0; |
duke@435 | 48 | _cvstate = NULL; |
duke@435 | 49 | // We can go memory state free or else we need the entire memory state |
kvn@2726 | 50 | assert(_initial_memory == NULL || _initial_memory->Opcode() == Op_MergeMem, "memory must be pre-split"); |
kvn@4868 | 51 | assert(!_gvn.is_IterGVN(), "IdealKit can't be used during Optimize phase"); |
duke@435 | 52 | int init_size = 5; |
duke@435 | 53 | _pending_cvstates = new (C->node_arena()) GrowableArray<Node*>(C->node_arena(), init_size, 0, 0); |
duke@435 | 54 | DEBUG_ONLY(_state = new (C->node_arena()) GrowableArray<int>(C->node_arena(), init_size, 0, 0)); |
kvn@1286 | 55 | if (!has_declarations) { |
kvn@1286 | 56 | declarations_done(); |
kvn@1286 | 57 | } |
duke@435 | 58 | } |
duke@435 | 59 | |
kvn@2726 | 60 | //----------------------------sync_kit----------------------------------------- |
kvn@2726 | 61 | void IdealKit::sync_kit(GraphKit* gkit) { |
kvn@2726 | 62 | set_all_memory(gkit->merged_memory()); |
kvn@2726 | 63 | set_i_o(gkit->i_o()); |
kvn@2726 | 64 | set_ctrl(gkit->control()); |
kvn@2726 | 65 | } |
kvn@2726 | 66 | |
duke@435 | 67 | //-------------------------------if_then------------------------------------- |
duke@435 | 68 | // Create: if(left relop right) |
duke@435 | 69 | // / \ |
duke@435 | 70 | // iffalse iftrue |
duke@435 | 71 | // Push the iffalse cvstate onto the stack. The iftrue becomes the current cvstate. |
duke@435 | 72 | void IdealKit::if_then(Node* left, BoolTest::mask relop, |
duke@435 | 73 | Node* right, float prob, float cnt, bool push_new_state) { |
duke@435 | 74 | assert((state() & (BlockS|LoopS|IfThenS|ElseS)), "bad state for new If"); |
duke@435 | 75 | Node* bol; |
duke@435 | 76 | if (left->bottom_type()->isa_ptr() == NULL) { |
duke@435 | 77 | if (left->bottom_type()->isa_int() != NULL) { |
duke@435 | 78 | bol = Bool(CmpI(left, right), relop); |
duke@435 | 79 | } else { |
duke@435 | 80 | assert(left->bottom_type()->isa_long() != NULL, "what else?"); |
duke@435 | 81 | bol = Bool(CmpL(left, right), relop); |
duke@435 | 82 | } |
duke@435 | 83 | |
duke@435 | 84 | } else { |
duke@435 | 85 | bol = Bool(CmpP(left, right), relop); |
duke@435 | 86 | } |
duke@435 | 87 | // Delay gvn.tranform on if-nodes until construction is finished |
duke@435 | 88 | // to prevent a constant bool input from discarding a control output. |
kvn@4115 | 89 | IfNode* iff = delay_transform(new (C) IfNode(ctrl(), bol, prob, cnt))->as_If(); |
duke@435 | 90 | Node* then = IfTrue(iff); |
duke@435 | 91 | Node* elsen = IfFalse(iff); |
duke@435 | 92 | Node* else_cvstate = copy_cvstate(); |
duke@435 | 93 | else_cvstate->set_req(TypeFunc::Control, elsen); |
duke@435 | 94 | _pending_cvstates->push(else_cvstate); |
duke@435 | 95 | DEBUG_ONLY(if (push_new_state) _state->push(IfThenS)); |
duke@435 | 96 | set_ctrl(then); |
duke@435 | 97 | } |
duke@435 | 98 | |
duke@435 | 99 | //-------------------------------else_------------------------------------- |
duke@435 | 100 | // Pop the else cvstate off the stack, and push the (current) then cvstate. |
duke@435 | 101 | // The else cvstate becomes the current cvstate. |
duke@435 | 102 | void IdealKit::else_() { |
duke@435 | 103 | assert(state() == IfThenS, "bad state for new Else"); |
duke@435 | 104 | Node* else_cvstate = _pending_cvstates->pop(); |
duke@435 | 105 | DEBUG_ONLY(_state->pop()); |
duke@435 | 106 | // save current (then) cvstate for later use at endif |
duke@435 | 107 | _pending_cvstates->push(_cvstate); |
duke@435 | 108 | DEBUG_ONLY(_state->push(ElseS)); |
duke@435 | 109 | _cvstate = else_cvstate; |
duke@435 | 110 | } |
duke@435 | 111 | |
duke@435 | 112 | //-------------------------------end_if------------------------------------- |
duke@435 | 113 | // Merge the "then" and "else" cvstates. |
duke@435 | 114 | // |
kvn@1286 | 115 | // The if_then() pushed a copy of the current state for later use |
duke@435 | 116 | // as the initial state for a future "else" clause. The |
duke@435 | 117 | // current state then became the initial state for the |
duke@435 | 118 | // then clause. If an "else" clause was encountered, it will |
duke@435 | 119 | // pop the top state and use it for it's initial state. |
duke@435 | 120 | // It will also push the current state (the state at the end of |
duke@435 | 121 | // the "then" clause) for latter use at the end_if. |
duke@435 | 122 | // |
duke@435 | 123 | // At the endif, the states are: |
duke@435 | 124 | // 1) else exists a) current state is end of "else" clause |
duke@435 | 125 | // b) top stack state is end of "then" clause |
duke@435 | 126 | // |
duke@435 | 127 | // 2) no else: a) current state is end of "then" clause |
duke@435 | 128 | // b) top stack state is from the "if_then" which |
duke@435 | 129 | // would have been the initial state of the else. |
duke@435 | 130 | // |
duke@435 | 131 | // Merging the states is accomplished by: |
duke@435 | 132 | // 1) make a label for the merge |
duke@435 | 133 | // 2) terminate the current state with a goto to the label |
duke@435 | 134 | // 3) pop the top state from the stack and make it the |
duke@435 | 135 | // current state |
duke@435 | 136 | // 4) bind the label at the current state. Binding a label |
duke@435 | 137 | // terminates the current state with a goto to the |
duke@435 | 138 | // label and makes the label's state the current state. |
duke@435 | 139 | // |
duke@435 | 140 | void IdealKit::end_if() { |
duke@435 | 141 | assert(state() & (IfThenS|ElseS), "bad state for new Endif"); |
duke@435 | 142 | Node* lab = make_label(1); |
duke@435 | 143 | |
duke@435 | 144 | // Node* join_state = _pending_cvstates->pop(); |
duke@435 | 145 | /* merging, join */ |
duke@435 | 146 | goto_(lab); |
duke@435 | 147 | _cvstate = _pending_cvstates->pop(); |
duke@435 | 148 | |
duke@435 | 149 | bind(lab); |
duke@435 | 150 | DEBUG_ONLY(_state->pop()); |
duke@435 | 151 | } |
duke@435 | 152 | |
duke@435 | 153 | //-------------------------------loop------------------------------------- |
duke@435 | 154 | // Create the loop head portion (*) of: |
duke@435 | 155 | // * iv = init |
duke@435 | 156 | // * top: (region node) |
duke@435 | 157 | // * if (iv relop limit) { |
duke@435 | 158 | // loop body |
duke@435 | 159 | // i = i + 1 |
duke@435 | 160 | // goto top |
duke@435 | 161 | // * } else // exits loop |
duke@435 | 162 | // |
duke@435 | 163 | // Pushes the loop top cvstate first, then the else (loop exit) cvstate |
duke@435 | 164 | // onto the stack. |
kvn@2665 | 165 | void IdealKit::loop(GraphKit* gkit, int nargs, IdealVariable& iv, Node* init, BoolTest::mask relop, Node* limit, float prob, float cnt) { |
duke@435 | 166 | assert((state() & (BlockS|LoopS|IfThenS|ElseS)), "bad state for new loop"); |
kvn@2726 | 167 | if (UseLoopPredicate) { |
kvn@2726 | 168 | // Sync IdealKit and graphKit. |
kvn@2726 | 169 | gkit->sync_kit(*this); |
kvn@2726 | 170 | // Add loop predicate. |
kvn@2726 | 171 | gkit->add_predicate(nargs); |
kvn@2726 | 172 | // Update IdealKit memory. |
kvn@2726 | 173 | sync_kit(gkit); |
kvn@2726 | 174 | } |
duke@435 | 175 | set(iv, init); |
duke@435 | 176 | Node* head = make_label(1); |
duke@435 | 177 | bind(head); |
duke@435 | 178 | _pending_cvstates->push(head); // push for use at end_loop |
duke@435 | 179 | _cvstate = copy_cvstate(); |
duke@435 | 180 | if_then(value(iv), relop, limit, prob, cnt, false /* no new state */); |
duke@435 | 181 | DEBUG_ONLY(_state->push(LoopS)); |
duke@435 | 182 | assert(ctrl()->is_IfTrue(), "true branch stays in loop"); |
duke@435 | 183 | assert(_pending_cvstates->top()->in(TypeFunc::Control)->is_IfFalse(), "false branch exits loop"); |
duke@435 | 184 | } |
duke@435 | 185 | |
duke@435 | 186 | //-------------------------------end_loop------------------------------------- |
duke@435 | 187 | // Creates the goto top label. |
duke@435 | 188 | // Expects the else (loop exit) cvstate to be on top of the |
duke@435 | 189 | // stack, and the loop top cvstate to be 2nd. |
duke@435 | 190 | void IdealKit::end_loop() { |
duke@435 | 191 | assert((state() == LoopS), "bad state for new end_loop"); |
duke@435 | 192 | Node* exit = _pending_cvstates->pop(); |
duke@435 | 193 | Node* head = _pending_cvstates->pop(); |
duke@435 | 194 | goto_(head); |
duke@435 | 195 | clear(head); |
duke@435 | 196 | DEBUG_ONLY(_state->pop()); |
duke@435 | 197 | _cvstate = exit; |
duke@435 | 198 | } |
duke@435 | 199 | |
duke@435 | 200 | //-------------------------------make_label------------------------------------- |
duke@435 | 201 | // Creates a label. The number of goto's |
duke@435 | 202 | // must be specified (which should be 1 less than |
duke@435 | 203 | // the number of precedessors.) |
duke@435 | 204 | Node* IdealKit::make_label(int goto_ct) { |
duke@435 | 205 | assert(_cvstate != NULL, "must declare variables before labels"); |
duke@435 | 206 | Node* lab = new_cvstate(); |
duke@435 | 207 | int sz = 1 + goto_ct + 1 /* fall thru */; |
kvn@4115 | 208 | Node* reg = delay_transform(new (C) RegionNode(sz)); |
duke@435 | 209 | lab->init_req(TypeFunc::Control, reg); |
duke@435 | 210 | return lab; |
duke@435 | 211 | } |
duke@435 | 212 | |
duke@435 | 213 | //-------------------------------bind------------------------------------- |
duke@435 | 214 | // Bind a label at the current cvstate by simulating |
duke@435 | 215 | // a goto to the label. |
duke@435 | 216 | void IdealKit::bind(Node* lab) { |
duke@435 | 217 | goto_(lab, true /* bind */); |
duke@435 | 218 | _cvstate = lab; |
duke@435 | 219 | } |
duke@435 | 220 | |
duke@435 | 221 | //-------------------------------goto_------------------------------------- |
duke@435 | 222 | // Make the current cvstate a predecessor of the label, |
duke@435 | 223 | // creating phi's to merge values. If bind is true and |
duke@435 | 224 | // this is not the last control edge, then ensure that |
duke@435 | 225 | // all live values have phis created. Used to create phis |
duke@435 | 226 | // at loop-top regions. |
duke@435 | 227 | void IdealKit::goto_(Node* lab, bool bind) { |
duke@435 | 228 | Node* reg = lab->in(TypeFunc::Control); |
duke@435 | 229 | // find next empty slot in region |
duke@435 | 230 | uint slot = 1; |
duke@435 | 231 | while (slot < reg->req() && reg->in(slot) != NULL) slot++; |
duke@435 | 232 | assert(slot < reg->req(), "too many gotos"); |
duke@435 | 233 | // If this is last predecessor, then don't force phi creation |
duke@435 | 234 | if (slot == reg->req() - 1) bind = false; |
duke@435 | 235 | reg->init_req(slot, ctrl()); |
duke@435 | 236 | assert(first_var + _var_ct == _cvstate->req(), "bad _cvstate size"); |
duke@435 | 237 | for (uint i = first_var; i < _cvstate->req(); i++) { |
duke@435 | 238 | |
duke@435 | 239 | // l is the value of var reaching the label. Could be a single value |
duke@435 | 240 | // reaching the label, or a phi that merges multiples values reaching |
duke@435 | 241 | // the label. The latter is true if the label's input: in(..) is |
duke@435 | 242 | // a phi whose control input is the region node for the label. |
duke@435 | 243 | |
duke@435 | 244 | Node* l = lab->in(i); |
duke@435 | 245 | // Get the current value of the var |
duke@435 | 246 | Node* m = _cvstate->in(i); |
duke@435 | 247 | // If the var went unused no need for a phi |
duke@435 | 248 | if (m == NULL) { |
duke@435 | 249 | continue; |
duke@435 | 250 | } else if (l == NULL || m == l) { |
duke@435 | 251 | // Only one unique value "m" is known to reach this label so a phi |
duke@435 | 252 | // is not yet necessary unless: |
duke@435 | 253 | // the label is being bound and all predecessors have not been seen, |
duke@435 | 254 | // in which case "bind" will be true. |
duke@435 | 255 | if (bind) { |
duke@435 | 256 | m = promote_to_phi(m, reg); |
duke@435 | 257 | } |
duke@435 | 258 | // Record the phi/value used for this var in the label's cvstate |
duke@435 | 259 | lab->set_req(i, m); |
duke@435 | 260 | } else { |
duke@435 | 261 | // More than one value for the variable reaches this label so |
duke@435 | 262 | // a create a phi if one does not already exist. |
duke@435 | 263 | if (!was_promoted_to_phi(l, reg)) { |
duke@435 | 264 | l = promote_to_phi(l, reg); |
duke@435 | 265 | lab->set_req(i, l); |
duke@435 | 266 | } |
duke@435 | 267 | // Record in the phi, the var's value from the current state |
duke@435 | 268 | l->set_req(slot, m); |
duke@435 | 269 | } |
duke@435 | 270 | } |
duke@435 | 271 | do_memory_merge(_cvstate, lab); |
duke@435 | 272 | stop(); |
duke@435 | 273 | } |
duke@435 | 274 | |
duke@435 | 275 | //-----------------------------promote_to_phi----------------------------------- |
duke@435 | 276 | Node* IdealKit::promote_to_phi(Node* n, Node* reg) { |
duke@435 | 277 | assert(!was_promoted_to_phi(n, reg), "n already promoted to phi on this region"); |
duke@435 | 278 | // Get a conservative type for the phi |
duke@435 | 279 | const BasicType bt = n->bottom_type()->basic_type(); |
duke@435 | 280 | const Type* ct = Type::get_const_basic_type(bt); |
duke@435 | 281 | return delay_transform(PhiNode::make(reg, n, ct)); |
duke@435 | 282 | } |
duke@435 | 283 | |
kvn@1286 | 284 | //-----------------------------declarations_done------------------------------- |
kvn@1286 | 285 | void IdealKit::declarations_done() { |
duke@435 | 286 | _cvstate = new_cvstate(); // initialize current cvstate |
duke@435 | 287 | set_ctrl(_initial_ctrl); // initialize control in current cvstate |
duke@435 | 288 | set_all_memory(_initial_memory);// initialize memory in current cvstate |
kvn@2726 | 289 | set_i_o(_initial_i_o); // initialize i_o in current cvstate |
duke@435 | 290 | DEBUG_ONLY(_state->push(BlockS)); |
duke@435 | 291 | } |
duke@435 | 292 | |
duke@435 | 293 | //-----------------------------transform----------------------------------- |
duke@435 | 294 | Node* IdealKit::transform(Node* n) { |
duke@435 | 295 | if (_delay_all_transforms) { |
duke@435 | 296 | return delay_transform(n); |
duke@435 | 297 | } else { |
kvn@4002 | 298 | n = gvn().transform(n); |
kvn@4868 | 299 | C->record_for_igvn(n); |
kvn@4002 | 300 | return n; |
duke@435 | 301 | } |
duke@435 | 302 | } |
duke@435 | 303 | |
duke@435 | 304 | //-----------------------------delay_transform----------------------------------- |
duke@435 | 305 | Node* IdealKit::delay_transform(Node* n) { |
kvn@4868 | 306 | // Delay transform until IterativeGVN |
kvn@4868 | 307 | gvn().set_type(n, n->bottom_type()); |
kvn@4868 | 308 | C->record_for_igvn(n); |
duke@435 | 309 | return n; |
duke@435 | 310 | } |
duke@435 | 311 | |
duke@435 | 312 | //-----------------------------new_cvstate----------------------------------- |
duke@435 | 313 | Node* IdealKit::new_cvstate() { |
duke@435 | 314 | uint sz = _var_ct + first_var; |
kvn@4115 | 315 | return new (C) Node(sz); |
duke@435 | 316 | } |
duke@435 | 317 | |
duke@435 | 318 | //-----------------------------copy_cvstate----------------------------------- |
duke@435 | 319 | Node* IdealKit::copy_cvstate() { |
duke@435 | 320 | Node* ns = new_cvstate(); |
duke@435 | 321 | for (uint i = 0; i < ns->req(); i++) ns->init_req(i, _cvstate->in(i)); |
duke@435 | 322 | // We must clone memory since it will be updated as we do stores. |
duke@435 | 323 | ns->set_req(TypeFunc::Memory, MergeMemNode::make(C, ns->in(TypeFunc::Memory))); |
duke@435 | 324 | return ns; |
duke@435 | 325 | } |
duke@435 | 326 | |
duke@435 | 327 | //-----------------------------clear----------------------------------- |
duke@435 | 328 | void IdealKit::clear(Node* m) { |
duke@435 | 329 | for (uint i = 0; i < m->req(); i++) m->set_req(i, NULL); |
duke@435 | 330 | } |
duke@435 | 331 | |
duke@435 | 332 | //-----------------------------IdealVariable---------------------------- |
duke@435 | 333 | IdealVariable::IdealVariable(IdealKit &k) { |
duke@435 | 334 | k.declare(this); |
duke@435 | 335 | } |
duke@435 | 336 | |
duke@435 | 337 | Node* IdealKit::memory(uint alias_idx) { |
duke@435 | 338 | MergeMemNode* mem = merged_memory(); |
duke@435 | 339 | Node* p = mem->memory_at(alias_idx); |
kvn@4868 | 340 | _gvn.set_type(p, Type::MEMORY); // must be mapped |
duke@435 | 341 | return p; |
duke@435 | 342 | } |
duke@435 | 343 | |
duke@435 | 344 | void IdealKit::set_memory(Node* mem, uint alias_idx) { |
duke@435 | 345 | merged_memory()->set_memory_at(alias_idx, mem); |
duke@435 | 346 | } |
duke@435 | 347 | |
duke@435 | 348 | //----------------------------- make_load ---------------------------- |
duke@435 | 349 | Node* IdealKit::load(Node* ctl, |
duke@435 | 350 | Node* adr, |
duke@435 | 351 | const Type* t, |
duke@435 | 352 | BasicType bt, |
duke@435 | 353 | int adr_idx, |
duke@435 | 354 | bool require_atomic_access) { |
duke@435 | 355 | |
duke@435 | 356 | assert(adr_idx != Compile::AliasIdxTop, "use other make_load factory" ); |
duke@435 | 357 | const TypePtr* adr_type = NULL; // debug-mode-only argument |
duke@435 | 358 | debug_only(adr_type = C->get_adr_type(adr_idx)); |
duke@435 | 359 | Node* mem = memory(adr_idx); |
duke@435 | 360 | Node* ld; |
duke@435 | 361 | if (require_atomic_access && bt == T_LONG) { |
duke@435 | 362 | ld = LoadLNode::make_atomic(C, ctl, mem, adr, adr_type, t); |
duke@435 | 363 | } else { |
coleenp@548 | 364 | ld = LoadNode::make(_gvn, ctl, mem, adr, adr_type, t, bt); |
duke@435 | 365 | } |
duke@435 | 366 | return transform(ld); |
duke@435 | 367 | } |
duke@435 | 368 | |
duke@435 | 369 | Node* IdealKit::store(Node* ctl, Node* adr, Node *val, BasicType bt, |
duke@435 | 370 | int adr_idx, |
duke@435 | 371 | bool require_atomic_access) { |
duke@435 | 372 | assert(adr_idx != Compile::AliasIdxTop, "use other store_to_memory factory" ); |
duke@435 | 373 | const TypePtr* adr_type = NULL; |
duke@435 | 374 | debug_only(adr_type = C->get_adr_type(adr_idx)); |
duke@435 | 375 | Node *mem = memory(adr_idx); |
duke@435 | 376 | Node* st; |
duke@435 | 377 | if (require_atomic_access && bt == T_LONG) { |
duke@435 | 378 | st = StoreLNode::make_atomic(C, ctl, mem, adr, adr_type, val); |
duke@435 | 379 | } else { |
coleenp@548 | 380 | st = StoreNode::make(_gvn, ctl, mem, adr, adr_type, val, bt); |
duke@435 | 381 | } |
duke@435 | 382 | st = transform(st); |
duke@435 | 383 | set_memory(st, adr_idx); |
duke@435 | 384 | |
duke@435 | 385 | return st; |
duke@435 | 386 | } |
duke@435 | 387 | |
duke@435 | 388 | // Card mark store. Must be ordered so that it will come after the store of |
duke@435 | 389 | // the oop. |
cfang@1420 | 390 | Node* IdealKit::storeCM(Node* ctl, Node* adr, Node *val, Node* oop_store, int oop_adr_idx, |
duke@435 | 391 | BasicType bt, |
duke@435 | 392 | int adr_idx) { |
duke@435 | 393 | assert(adr_idx != Compile::AliasIdxTop, "use other store_to_memory factory" ); |
duke@435 | 394 | const TypePtr* adr_type = NULL; |
duke@435 | 395 | debug_only(adr_type = C->get_adr_type(adr_idx)); |
duke@435 | 396 | Node *mem = memory(adr_idx); |
duke@435 | 397 | |
duke@435 | 398 | // Add required edge to oop_store, optimizer does not support precedence edges. |
duke@435 | 399 | // Convert required edge to precedence edge before allocation. |
kvn@4115 | 400 | Node* st = new (C) StoreCMNode(ctl, mem, adr, adr_type, val, oop_store, oop_adr_idx); |
duke@435 | 401 | |
duke@435 | 402 | st = transform(st); |
duke@435 | 403 | set_memory(st, adr_idx); |
duke@435 | 404 | |
duke@435 | 405 | return st; |
duke@435 | 406 | } |
duke@435 | 407 | |
duke@435 | 408 | //---------------------------- do_memory_merge -------------------------------- |
duke@435 | 409 | // The memory from one merging cvstate needs to be merged with the memory for another |
duke@435 | 410 | // join cvstate. If the join cvstate doesn't have a merged memory yet then we |
duke@435 | 411 | // can just copy the state from the merging cvstate |
duke@435 | 412 | |
duke@435 | 413 | // Merge one slow path into the rest of memory. |
duke@435 | 414 | void IdealKit::do_memory_merge(Node* merging, Node* join) { |
duke@435 | 415 | |
duke@435 | 416 | // Get the region for the join state |
duke@435 | 417 | Node* join_region = join->in(TypeFunc::Control); |
duke@435 | 418 | assert(join_region != NULL, "join region must exist"); |
kvn@2726 | 419 | if (join->in(TypeFunc::I_O) == NULL ) { |
kvn@2726 | 420 | join->set_req(TypeFunc::I_O, merging->in(TypeFunc::I_O)); |
kvn@2726 | 421 | } |
duke@435 | 422 | if (join->in(TypeFunc::Memory) == NULL ) { |
duke@435 | 423 | join->set_req(TypeFunc::Memory, merging->in(TypeFunc::Memory)); |
duke@435 | 424 | return; |
duke@435 | 425 | } |
duke@435 | 426 | |
duke@435 | 427 | // The control flow for merging must have already been attached to the join region |
duke@435 | 428 | // we need its index for the phis. |
duke@435 | 429 | uint slot; |
duke@435 | 430 | for (slot = 1; slot < join_region->req() ; slot ++ ) { |
duke@435 | 431 | if (join_region->in(slot) == merging->in(TypeFunc::Control)) break; |
duke@435 | 432 | } |
duke@435 | 433 | assert(slot != join_region->req(), "edge must already exist"); |
duke@435 | 434 | |
duke@435 | 435 | MergeMemNode* join_m = join->in(TypeFunc::Memory)->as_MergeMem(); |
duke@435 | 436 | MergeMemNode* merging_m = merging->in(TypeFunc::Memory)->as_MergeMem(); |
duke@435 | 437 | |
duke@435 | 438 | // join_m should be an ancestor mergemem of merging |
duke@435 | 439 | // Slow path memory comes from the current map (which is from a slow call) |
duke@435 | 440 | // Fast path/null path memory comes from the call's input |
duke@435 | 441 | |
duke@435 | 442 | // Merge the other fast-memory inputs with the new slow-default memory. |
duke@435 | 443 | // for (MergeMemStream mms(merged_memory(), fast_mem->as_MergeMem()); mms.next_non_empty2(); ) { |
duke@435 | 444 | for (MergeMemStream mms(join_m, merging_m); mms.next_non_empty2(); ) { |
duke@435 | 445 | Node* join_slice = mms.force_memory(); |
duke@435 | 446 | Node* merging_slice = mms.memory2(); |
duke@435 | 447 | if (join_slice != merging_slice) { |
duke@435 | 448 | PhiNode* phi; |
duke@435 | 449 | // bool new_phi = false; |
duke@435 | 450 | // Is the phi for this slice one that we created for this join region or simply |
duke@435 | 451 | // one we copied? If it is ours then add |
duke@435 | 452 | if (join_slice->is_Phi() && join_slice->as_Phi()->region() == join_region) { |
duke@435 | 453 | phi = join_slice->as_Phi(); |
duke@435 | 454 | } else { |
duke@435 | 455 | // create the phi with join_slice filling supplying memory for all of the |
duke@435 | 456 | // control edges to the join region |
duke@435 | 457 | phi = PhiNode::make(join_region, join_slice, Type::MEMORY, mms.adr_type(C)); |
duke@435 | 458 | phi = (PhiNode*) delay_transform(phi); |
duke@435 | 459 | // gvn().set_type(phi, Type::MEMORY); |
duke@435 | 460 | // new_phi = true; |
duke@435 | 461 | } |
duke@435 | 462 | // Now update the phi with the slice for the merging slice |
duke@435 | 463 | phi->set_req(slot, merging_slice/* slow_path, slow_slice */); |
duke@435 | 464 | // this updates join_m with the phi |
duke@435 | 465 | mms.set_memory(phi); |
duke@435 | 466 | } |
duke@435 | 467 | } |
kvn@2726 | 468 | |
kvn@2726 | 469 | Node* join_io = join->in(TypeFunc::I_O); |
kvn@2726 | 470 | Node* merging_io = merging->in(TypeFunc::I_O); |
kvn@2726 | 471 | if (join_io != merging_io) { |
kvn@2726 | 472 | PhiNode* phi; |
kvn@2726 | 473 | if (join_io->is_Phi() && join_io->as_Phi()->region() == join_region) { |
kvn@2726 | 474 | phi = join_io->as_Phi(); |
kvn@2726 | 475 | } else { |
kvn@2726 | 476 | phi = PhiNode::make(join_region, join_io, Type::ABIO); |
kvn@2726 | 477 | phi = (PhiNode*) delay_transform(phi); |
kvn@2726 | 478 | join->set_req(TypeFunc::I_O, phi); |
kvn@2726 | 479 | } |
kvn@2726 | 480 | phi->set_req(slot, merging_io); |
kvn@2726 | 481 | } |
duke@435 | 482 | } |
duke@435 | 483 | |
duke@435 | 484 | |
duke@435 | 485 | //----------------------------- make_call ---------------------------- |
duke@435 | 486 | // Trivial runtime call |
duke@435 | 487 | void IdealKit::make_leaf_call(const TypeFunc *slow_call_type, |
duke@435 | 488 | address slow_call, |
duke@435 | 489 | const char *leaf_name, |
duke@435 | 490 | Node* parm0, |
duke@435 | 491 | Node* parm1, |
kvn@2726 | 492 | Node* parm2, |
kvn@2726 | 493 | Node* parm3) { |
duke@435 | 494 | |
duke@435 | 495 | // We only handle taking in RawMem and modifying RawMem |
duke@435 | 496 | const TypePtr* adr_type = TypeRawPtr::BOTTOM; |
duke@435 | 497 | uint adr_idx = C->get_alias_index(adr_type); |
duke@435 | 498 | |
duke@435 | 499 | // Slow-path leaf call |
kvn@4115 | 500 | CallNode *call = (CallNode*)new (C) CallLeafNode( slow_call_type, slow_call, leaf_name, adr_type); |
duke@435 | 501 | |
duke@435 | 502 | // Set fixed predefined input arguments |
duke@435 | 503 | call->init_req( TypeFunc::Control, ctrl() ); |
duke@435 | 504 | call->init_req( TypeFunc::I_O , top() ) ; // does no i/o |
duke@435 | 505 | // Narrow memory as only memory input |
duke@435 | 506 | call->init_req( TypeFunc::Memory , memory(adr_idx)); |
duke@435 | 507 | call->init_req( TypeFunc::FramePtr, top() /* frameptr() */ ); |
duke@435 | 508 | call->init_req( TypeFunc::ReturnAdr, top() ); |
duke@435 | 509 | |
duke@435 | 510 | if (parm0 != NULL) call->init_req(TypeFunc::Parms+0, parm0); |
duke@435 | 511 | if (parm1 != NULL) call->init_req(TypeFunc::Parms+1, parm1); |
duke@435 | 512 | if (parm2 != NULL) call->init_req(TypeFunc::Parms+2, parm2); |
kvn@2726 | 513 | if (parm3 != NULL) call->init_req(TypeFunc::Parms+3, parm3); |
duke@435 | 514 | |
duke@435 | 515 | // Node *c = _gvn.transform(call); |
duke@435 | 516 | call = (CallNode *) _gvn.transform(call); |
duke@435 | 517 | Node *c = call; // dbx gets confused with call call->dump() |
duke@435 | 518 | |
duke@435 | 519 | // Slow leaf call has no side-effects, sets few values |
duke@435 | 520 | |
kvn@4115 | 521 | set_ctrl(transform( new (C) ProjNode(call,TypeFunc::Control) )); |
duke@435 | 522 | |
duke@435 | 523 | // Make memory for the call |
kvn@4115 | 524 | Node* mem = _gvn.transform( new (C) ProjNode(call, TypeFunc::Memory) ); |
duke@435 | 525 | |
duke@435 | 526 | // Set the RawPtr memory state only. |
duke@435 | 527 | set_memory(mem, adr_idx); |
duke@435 | 528 | |
duke@435 | 529 | assert(C->alias_type(call->adr_type()) == C->alias_type(adr_type), |
duke@435 | 530 | "call node must be constructed correctly"); |
duke@435 | 531 | } |
kvn@2726 | 532 | |
kvn@2726 | 533 | |
kvn@2726 | 534 | void IdealKit::make_leaf_call_no_fp(const TypeFunc *slow_call_type, |
kvn@2726 | 535 | address slow_call, |
kvn@2726 | 536 | const char *leaf_name, |
kvn@2726 | 537 | const TypePtr* adr_type, |
kvn@2726 | 538 | Node* parm0, |
kvn@2726 | 539 | Node* parm1, |
kvn@2726 | 540 | Node* parm2, |
kvn@2726 | 541 | Node* parm3) { |
kvn@2726 | 542 | |
kvn@2726 | 543 | // We only handle taking in RawMem and modifying RawMem |
kvn@2726 | 544 | uint adr_idx = C->get_alias_index(adr_type); |
kvn@2726 | 545 | |
kvn@2726 | 546 | // Slow-path leaf call |
kvn@4115 | 547 | CallNode *call = (CallNode*)new (C) CallLeafNoFPNode( slow_call_type, slow_call, leaf_name, adr_type); |
kvn@2726 | 548 | |
kvn@2726 | 549 | // Set fixed predefined input arguments |
kvn@2726 | 550 | call->init_req( TypeFunc::Control, ctrl() ); |
kvn@2726 | 551 | call->init_req( TypeFunc::I_O , top() ) ; // does no i/o |
kvn@2726 | 552 | // Narrow memory as only memory input |
kvn@2726 | 553 | call->init_req( TypeFunc::Memory , memory(adr_idx)); |
kvn@2726 | 554 | call->init_req( TypeFunc::FramePtr, top() /* frameptr() */ ); |
kvn@2726 | 555 | call->init_req( TypeFunc::ReturnAdr, top() ); |
kvn@2726 | 556 | |
kvn@2726 | 557 | if (parm0 != NULL) call->init_req(TypeFunc::Parms+0, parm0); |
kvn@2726 | 558 | if (parm1 != NULL) call->init_req(TypeFunc::Parms+1, parm1); |
kvn@2726 | 559 | if (parm2 != NULL) call->init_req(TypeFunc::Parms+2, parm2); |
kvn@2726 | 560 | if (parm3 != NULL) call->init_req(TypeFunc::Parms+3, parm3); |
kvn@2726 | 561 | |
kvn@2726 | 562 | // Node *c = _gvn.transform(call); |
kvn@2726 | 563 | call = (CallNode *) _gvn.transform(call); |
kvn@2726 | 564 | Node *c = call; // dbx gets confused with call call->dump() |
kvn@2726 | 565 | |
kvn@2726 | 566 | // Slow leaf call has no side-effects, sets few values |
kvn@2726 | 567 | |
kvn@4115 | 568 | set_ctrl(transform( new (C) ProjNode(call,TypeFunc::Control) )); |
kvn@2726 | 569 | |
kvn@2726 | 570 | // Make memory for the call |
kvn@4115 | 571 | Node* mem = _gvn.transform( new (C) ProjNode(call, TypeFunc::Memory) ); |
kvn@2726 | 572 | |
kvn@2726 | 573 | // Set the RawPtr memory state only. |
kvn@2726 | 574 | set_memory(mem, adr_idx); |
kvn@2726 | 575 | |
kvn@2726 | 576 | assert(C->alias_type(call->adr_type()) == C->alias_type(adr_type), |
kvn@2726 | 577 | "call node must be constructed correctly"); |
kvn@2726 | 578 | } |