annotate src/hotspot/share/opto/loopUnswitch.cpp @ 52592:1ecc914fb707

8210829: Modularize allocations in C2 Reviewed-by: kvn, roland
author rkennke
date Wed, 19 Sep 2018 21:31:33 +0200
parents f913f6dba2d3
children 3ebf58dbf5d8
rev   line source
duke@1 1 /*
mikael@13963 2 * Copyright (c) 2006, 2012, Oracle and/or its affiliates. All rights reserved.
duke@1 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@1 4 *
duke@1 5 * This code is free software; you can redistribute it and/or modify it
duke@1 6 * under the terms of the GNU General Public License version 2 only, as
duke@1 7 * published by the Free Software Foundation.
duke@1 8 *
duke@1 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@1 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@1 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@1 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@1 13 * accompanied this code).
duke@1 14 *
duke@1 15 * You should have received a copy of the GNU General Public License version
duke@1 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@1 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@1 18 *
trims@5547 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@5547 20 * or visit www.oracle.com if you need additional information or have any
trims@5547 21 * questions.
duke@1 22 *
duke@1 23 */
duke@1 24
stefank@7397 25 #include "precompiled.hpp"
stefank@7397 26 #include "memory/allocation.inline.hpp"
stefank@7397 27 #include "opto/connode.hpp"
morris@23528 28 #include "opto/convertnode.hpp"
stefank@7397 29 #include "opto/loopnode.hpp"
morris@23528 30 #include "opto/opaquenode.hpp"
stefank@7397 31 #include "opto/rootnode.hpp"
duke@1 32
duke@1 33 //================= Loop Unswitching =====================
duke@1 34 //
duke@1 35 // orig: transformed:
duke@1 36 // if (invariant-test) then
kvn@9101 37 // predicate predicate
duke@1 38 // loop loop
duke@1 39 // stmt1 stmt1
duke@1 40 // if (invariant-test) then stmt2
duke@1 41 // stmt2 stmt4
duke@1 42 // else endloop
duke@1 43 // stmt3 else
kvn@9101 44 // endif predicate [clone]
kvn@9101 45 // stmt4 loop [clone]
kvn@9101 46 // endloop stmt1 [clone]
kvn@9101 47 // stmt3
duke@1 48 // stmt4 [clone]
duke@1 49 // endloop
duke@1 50 // endif
duke@1 51 //
duke@1 52 // Note: the "else" clause may be empty
duke@1 53
duke@1 54 //------------------------------policy_unswitching-----------------------------
duke@1 55 // Return TRUE or FALSE if the loop should be unswitched
duke@1 56 // (ie. clone loop with an invariant test that does not exit the loop)
duke@1 57 bool IdealLoopTree::policy_unswitching( PhaseIdealLoop *phase ) const {
duke@1 58 if( !LoopUnswitching ) {
duke@1 59 return false;
duke@1 60 }
rasbold@355 61 if (!_head->is_Loop()) {
rasbold@355 62 return false;
rasbold@355 63 }
kvn@31772 64
kvn@31772 65 // check for vectorized loops, any unswitching was already applied
kvn@31772 66 if (_head->is_CountedLoop() && _head->as_CountedLoop()->do_unroll_only()) {
kvn@31772 67 return false;
kvn@31772 68 }
kvn@31772 69
vlivanov@27707 70 int nodes_left = phase->C->max_node_limit() - phase->C->live_nodes();
vlivanov@27707 71 if ((int)(2 * _body.size()) > nodes_left) {
duke@1 72 return false; // Too speculative if running low on nodes.
duke@1 73 }
duke@1 74 LoopNode* head = _head->as_Loop();
duke@1 75 if (head->unswitch_count() + 1 > head->unswitch_max()) {
duke@1 76 return false;
duke@1 77 }
duke@1 78 return phase->find_unswitching_candidate(this) != NULL;
duke@1 79 }
duke@1 80
duke@1 81 //------------------------------find_unswitching_candidate-----------------------------
duke@1 82 // Find candidate "if" for unswitching
duke@1 83 IfNode* PhaseIdealLoop::find_unswitching_candidate(const IdealLoopTree *loop) const {
duke@1 84
duke@1 85 // Find first invariant test that doesn't exit the loop
duke@1 86 LoopNode *head = loop->_head->as_Loop();
duke@1 87 IfNode* unswitch_iff = NULL;
duke@1 88 Node* n = head->in(LoopNode::LoopBackControl);
duke@1 89 while (n != head) {
duke@1 90 Node* n_dom = idom(n);
duke@1 91 if (n->is_Region()) {
duke@1 92 if (n_dom->is_If()) {
duke@1 93 IfNode* iff = n_dom->as_If();
duke@1 94 if (iff->in(1)->is_Bool()) {
duke@1 95 BoolNode* bol = iff->in(1)->as_Bool();
duke@1 96 if (bol->in(1)->is_Cmp()) {
duke@1 97 // If condition is invariant and not a loop exit,
duke@1 98 // then found reason to unswitch.
duke@1 99 if (loop->is_invariant(bol) && !loop->is_loop_exit(iff)) {
duke@1 100 unswitch_iff = iff;
duke@1 101 }
duke@1 102 }
duke@1 103 }
duke@1 104 }
duke@1 105 }
duke@1 106 n = n_dom;
duke@1 107 }
duke@1 108 return unswitch_iff;
duke@1 109 }
duke@1 110
duke@1 111 //------------------------------do_unswitching-----------------------------
duke@1 112 // Clone loop with an invariant test (that does not exit) and
duke@1 113 // insert a clone of the test that selects which version to
duke@1 114 // execute.
duke@1 115 void PhaseIdealLoop::do_unswitching (IdealLoopTree *loop, Node_List &old_new) {
duke@1 116
duke@1 117 // Find first invariant test that doesn't exit the loop
duke@1 118 LoopNode *head = loop->_head->as_Loop();
duke@1 119
duke@1 120 IfNode* unswitch_iff = find_unswitching_candidate((const IdealLoopTree *)loop);
duke@1 121 assert(unswitch_iff != NULL, "should be at least one");
duke@1 122
kvn@8732 123 #ifndef PRODUCT
kvn@8732 124 if (TraceLoopOpts) {
kvn@8732 125 tty->print("Unswitch %d ", head->unswitch_count()+1);
kvn@8732 126 loop->dump_head();
kvn@8732 127 }
kvn@8732 128 #endif
kvn@8732 129
duke@1 130 // Need to revert back to normal loop
duke@1 131 if (head->is_CountedLoop() && !head->as_CountedLoop()->is_normal_loop()) {
duke@1 132 head->as_CountedLoop()->set_normal_loop();
duke@1 133 }
duke@1 134
roland@48361 135 ProjNode* proj_true = create_slow_version_of_loop(loop, old_new, unswitch_iff->Opcode(), CloneIncludesStripMined);
duke@1 136
kvn@9101 137 #ifdef ASSERT
kvn@9101 138 Node* uniqc = proj_true->unique_ctrl_out();
roland@48361 139 Node* entry = head->skip_strip_mined()->in(LoopNode::EntryControl);
kvn@9101 140 Node* predicate = find_predicate(entry);
roland@51257 141 if (predicate != NULL) {
roland@51257 142 entry = skip_loop_predicates(entry);
roland@51257 143 }
zmajo@37287 144 if (predicate != NULL && UseLoopPredicate) {
kvn@9446 145 // We may have two predicates, find first.
roland@51257 146 Node* n = find_predicate(entry);
roland@51257 147 if (n != NULL) {
roland@51257 148 predicate = n;
roland@51257 149 entry = skip_loop_predicates(entry);
roland@51257 150 }
roland@51257 151 }
roland@51257 152 if (predicate != NULL && UseProfiledLoopPredicate) {
roland@51257 153 entry = find_predicate(entry);
kvn@9446 154 if (entry != NULL) predicate = entry;
kvn@9446 155 }
kvn@9101 156 if (predicate != NULL) predicate = predicate->in(0);
kvn@9101 157 assert(proj_true->is_IfTrue() &&
roland@48361 158 (predicate == NULL && uniqc == head && !head->is_strip_mined() ||
roland@48361 159 predicate == NULL && uniqc == head->in(LoopNode::EntryControl) && head->is_strip_mined() ||
kvn@9101 160 predicate != NULL && uniqc == predicate), "by construction");
kvn@9101 161 #endif
duke@1 162 // Increment unswitch count
duke@1 163 LoopNode* head_clone = old_new[head->_idx]->as_Loop();
duke@1 164 int nct = head->unswitch_count() + 1;
duke@1 165 head->set_unswitch_count(nct);
duke@1 166 head_clone->set_unswitch_count(nct);
duke@1 167
duke@1 168 // Add test to new "if" outside of loop
duke@1 169 IfNode* invar_iff = proj_true->in(0)->as_If();
duke@1 170 Node* invar_iff_c = invar_iff->in(0);
duke@1 171 BoolNode* bol = unswitch_iff->in(1)->as_Bool();
duke@1 172 invar_iff->set_req(1, bol);
duke@1 173 invar_iff->_prob = unswitch_iff->_prob;
duke@1 174
duke@1 175 ProjNode* proj_false = invar_iff->proj_out(0)->as_Proj();
duke@1 176
twisti@2131 177 // Hoist invariant casts out of each loop to the appropriate
duke@1 178 // control projection.
duke@1 179
duke@1 180 Node_List worklist;
duke@1 181
duke@1 182 for (DUIterator_Fast imax, i = unswitch_iff->fast_outs(imax); i < imax; i++) {
duke@1 183 ProjNode* proj= unswitch_iff->fast_out(i)->as_Proj();
duke@1 184 // Copy to a worklist for easier manipulation
duke@1 185 for (DUIterator_Fast jmax, j = proj->fast_outs(jmax); j < jmax; j++) {
duke@1 186 Node* use = proj->fast_out(j);
duke@1 187 if (use->Opcode() == Op_CheckCastPP && loop->is_invariant(use->in(1))) {
duke@1 188 worklist.push(use);
duke@1 189 }
duke@1 190 }
duke@1 191 ProjNode* invar_proj = invar_iff->proj_out(proj->_con)->as_Proj();
duke@1 192 while (worklist.size() > 0) {
duke@1 193 Node* use = worklist.pop();
duke@1 194 Node* nuse = use->clone();
duke@1 195 nuse->set_req(0, invar_proj);
kvn@12958 196 _igvn.replace_input_of(use, 1, nuse);
duke@1 197 register_new_node(nuse, invar_proj);
duke@1 198 // Same for the clone
duke@1 199 Node* use_clone = old_new[use->_idx];
kvn@12958 200 _igvn.replace_input_of(use_clone, 1, nuse);
duke@1 201 }
duke@1 202 }
duke@1 203
duke@1 204 // Hardwire the control paths in the loops into if(true) and if(false)
kvn@12958 205 _igvn.rehash_node_delayed(unswitch_iff);
duke@1 206 short_circuit_if(unswitch_iff, proj_true);
duke@1 207
duke@1 208 IfNode* unswitch_iff_clone = old_new[unswitch_iff->_idx]->as_If();
kvn@12958 209 _igvn.rehash_node_delayed(unswitch_iff_clone);
duke@1 210 short_circuit_if(unswitch_iff_clone, proj_false);
duke@1 211
duke@1 212 // Reoptimize loops
duke@1 213 loop->record_for_igvn();
duke@1 214 for(int i = loop->_body.size() - 1; i >= 0 ; i--) {
duke@1 215 Node *n = loop->_body[i];
duke@1 216 Node *n_clone = old_new[n->_idx];
duke@1 217 _igvn._worklist.push(n_clone);
duke@1 218 }
duke@1 219
duke@1 220 #ifndef PRODUCT
duke@1 221 if (TraceLoopUnswitching) {
duke@1 222 tty->print_cr("Loop unswitching orig: %d @ %d new: %d @ %d",
duke@1 223 head->_idx, unswitch_iff->_idx,
duke@1 224 old_new[head->_idx]->_idx, unswitch_iff_clone->_idx);
duke@1 225 }
duke@1 226 #endif
duke@1 227
duke@1 228 C->set_major_progress();
duke@1 229 }
duke@1 230
duke@1 231 //-------------------------create_slow_version_of_loop------------------------
duke@1 232 // Create a slow version of the loop by cloning the loop
duke@1 233 // and inserting an if to select fast-slow versions.
duke@1 234 // Return control projection of the entry to the fast version.
duke@1 235 ProjNode* PhaseIdealLoop::create_slow_version_of_loop(IdealLoopTree *loop,
roland@34164 236 Node_List &old_new,
roland@48361 237 int opcode,
roland@48361 238 CloneLoopMode mode) {
duke@1 239 LoopNode* head = loop->_head->as_Loop();
kvn@9446 240 bool counted_loop = head->is_CountedLoop();
roland@48361 241 Node* entry = head->skip_strip_mined()->in(LoopNode::EntryControl);
kvn@12958 242 _igvn.rehash_node_delayed(entry);
duke@1 243 IdealLoopTree* outer_loop = loop->_parent;
duke@1 244
roland@48361 245 head->verify_strip_mined(1);
roland@48361 246
duke@1 247 Node *cont = _igvn.intcon(1);
duke@1 248 set_ctrl(cont, C->root());
thartmann@24923 249 Node* opq = new Opaque1Node(C, cont);
duke@1 250 register_node(opq, outer_loop, entry, dom_depth(entry));
thartmann@24923 251 Node *bol = new Conv2BNode(opq);
duke@1 252 register_node(bol, outer_loop, entry, dom_depth(entry));
roland@34164 253 IfNode* iff = (opcode == Op_RangeCheck) ? new RangeCheckNode(entry, bol, PROB_MAX, COUNT_UNKNOWN) :
roland@34164 254 new IfNode(entry, bol, PROB_MAX, COUNT_UNKNOWN);
duke@1 255 register_node(iff, outer_loop, entry, dom_depth(entry));
thartmann@24923 256 ProjNode* iffast = new IfTrueNode(iff);
duke@1 257 register_node(iffast, outer_loop, iff, dom_depth(iff));
thartmann@24923 258 ProjNode* ifslow = new IfFalseNode(iff);
duke@1 259 register_node(ifslow, outer_loop, iff, dom_depth(iff));
duke@1 260
duke@1 261 // Clone the loop body. The clone becomes the fast loop. The
kvn@9101 262 // original pre-header will (illegally) have 3 control users
kvn@9101 263 // (old & new loops & new if).
roland@48361 264 clone_loop(loop, old_new, dom_depth(head->skip_strip_mined()), mode, iff);
duke@1 265 assert(old_new[head->_idx]->is_Loop(), "" );
duke@1 266
duke@1 267 // Fast (true) control
kvn@9446 268 Node* iffast_pred = clone_loop_predicates(entry, iffast, !counted_loop);
duke@1 269
duke@1 270 // Slow (false) control
kvn@10258 271 Node* ifslow_pred = clone_loop_predicates(entry, ifslow, !counted_loop);
roland@48361 272
roland@48361 273 Node* l = head->skip_strip_mined();
roland@48361 274 _igvn.replace_input_of(l, LoopNode::EntryControl, iffast_pred);
roland@48361 275 set_idom(l, iffast_pred, dom_depth(l));
roland@48361 276 LoopNode* slow_l = old_new[head->_idx]->as_Loop()->skip_strip_mined();
roland@48361 277 _igvn.replace_input_of(slow_l, LoopNode::EntryControl, ifslow_pred);
roland@48361 278 set_idom(slow_l, ifslow_pred, dom_depth(l));
duke@1 279
duke@1 280 recompute_dom_depth();
duke@1 281
duke@1 282 return iffast;
duke@1 283 }
iveresov@33166 284
iveresov@33166 285 LoopNode* PhaseIdealLoop::create_reserve_version_of_loop(IdealLoopTree *loop, CountedLoopReserveKit* lk) {
iveresov@33166 286 Node_List old_new;
iveresov@33166 287 LoopNode* head = loop->_head->as_Loop();
iveresov@33166 288 bool counted_loop = head->is_CountedLoop();
roland@48361 289 Node* entry = head->skip_strip_mined()->in(LoopNode::EntryControl);
iveresov@33166 290 _igvn.rehash_node_delayed(entry);
roland@48361 291 IdealLoopTree* outer_loop = head->is_strip_mined() ? loop->_parent->_parent : loop->_parent;
iveresov@33166 292
iveresov@33166 293 ConINode* const_1 = _igvn.intcon(1);
iveresov@33166 294 set_ctrl(const_1, C->root());
iveresov@33166 295 IfNode* iff = new IfNode(entry, const_1, PROB_MAX, COUNT_UNKNOWN);
iveresov@33166 296 register_node(iff, outer_loop, entry, dom_depth(entry));
iveresov@33166 297 ProjNode* iffast = new IfTrueNode(iff);
iveresov@33166 298 register_node(iffast, outer_loop, iff, dom_depth(iff));
iveresov@33166 299 ProjNode* ifslow = new IfFalseNode(iff);
iveresov@33166 300 register_node(ifslow, outer_loop, iff, dom_depth(iff));
iveresov@33166 301
iveresov@33166 302 // Clone the loop body. The clone becomes the fast loop. The
iveresov@33166 303 // original pre-header will (illegally) have 3 control users
iveresov@33166 304 // (old & new loops & new if).
roland@48361 305 clone_loop(loop, old_new, dom_depth(head), CloneIncludesStripMined, iff);
iveresov@33166 306 assert(old_new[head->_idx]->is_Loop(), "" );
iveresov@33166 307
iveresov@33166 308 LoopNode* slow_head = old_new[head->_idx]->as_Loop();
iveresov@33166 309
iveresov@33166 310 #ifndef PRODUCT
iveresov@33166 311 if (TraceLoopOpts) {
iveresov@33166 312 tty->print_cr("PhaseIdealLoop::create_reserve_version_of_loop:");
iveresov@33166 313 tty->print("\t iff = %d, ", iff->_idx); iff->dump();
iveresov@33166 314 tty->print("\t iffast = %d, ", iffast->_idx); iffast->dump();
iveresov@33166 315 tty->print("\t ifslow = %d, ", ifslow->_idx); ifslow->dump();
iveresov@33166 316 tty->print("\t before replace_input_of: head = %d, ", head->_idx); head->dump();
iveresov@33166 317 tty->print("\t before replace_input_of: slow_head = %d, ", slow_head->_idx); slow_head->dump();
iveresov@33166 318 }
iveresov@33166 319 #endif
iveresov@33166 320
iveresov@33166 321 // Fast (true) control
roland@48361 322 _igvn.replace_input_of(head->skip_strip_mined(), LoopNode::EntryControl, iffast);
iveresov@33166 323 // Slow (false) control
roland@48361 324 _igvn.replace_input_of(slow_head->skip_strip_mined(), LoopNode::EntryControl, ifslow);
iveresov@33166 325
iveresov@33166 326 recompute_dom_depth();
iveresov@33166 327
iveresov@33166 328 lk->set_iff(iff);
iveresov@33166 329
iveresov@33166 330 #ifndef PRODUCT
iveresov@33166 331 if (TraceLoopOpts ) {
iveresov@33166 332 tty->print("\t after replace_input_of: head = %d, ", head->_idx); head->dump();
iveresov@33166 333 tty->print("\t after replace_input_of: slow_head = %d, ", slow_head->_idx); slow_head->dump();
iveresov@33166 334 }
iveresov@33166 335 #endif
iveresov@33166 336
iveresov@33166 337 return slow_head->as_Loop();
iveresov@33166 338 }
iveresov@33166 339
iveresov@33166 340 CountedLoopReserveKit::CountedLoopReserveKit(PhaseIdealLoop* phase, IdealLoopTree *loop, bool active = true) :
iveresov@33166 341 _phase(phase),
iveresov@33166 342 _lpt(loop),
iveresov@33166 343 _lp(NULL),
iveresov@33166 344 _iff(NULL),
iveresov@33166 345 _lp_reserved(NULL),
iveresov@33166 346 _has_reserved(false),
iveresov@33166 347 _use_new(false),
iveresov@33166 348 _active(active)
iveresov@33166 349 {
iveresov@33166 350 create_reserve();
iveresov@33166 351 };
iveresov@33166 352
iveresov@33166 353 CountedLoopReserveKit::~CountedLoopReserveKit() {
iveresov@33166 354 if (!_active) {
iveresov@33166 355 return;
iveresov@33166 356 }
iveresov@33166 357
iveresov@33166 358 if (_has_reserved && !_use_new) {
iveresov@33166 359 // intcon(0)->iff-node reverts CF to the reserved copy
iveresov@33166 360 ConINode* const_0 = _phase->_igvn.intcon(0);
iveresov@33166 361 _phase->set_ctrl(const_0, _phase->C->root());
iveresov@33166 362 _iff->set_req(1, const_0);
iveresov@33166 363
iveresov@33166 364 #ifndef PRODUCT
iveresov@33166 365 if (TraceLoopOpts) {
iveresov@33166 366 tty->print_cr("CountedLoopReserveKit::~CountedLoopReserveKit()");
iveresov@33166 367 tty->print("\t discard loop %d and revert to the reserved loop clone %d: ", _lp->_idx, _lp_reserved->_idx);
iveresov@33166 368 _lp_reserved->dump();
iveresov@33166 369 }
iveresov@33166 370 #endif
iveresov@33166 371 }
iveresov@33166 372 }
iveresov@33166 373
iveresov@33166 374 bool CountedLoopReserveKit::create_reserve() {
iveresov@33166 375 if (!_active) {
iveresov@33166 376 return false;
iveresov@33166 377 }
iveresov@33166 378
iveresov@33166 379 if(!_lpt->_head->is_CountedLoop()) {
twisti@34174 380 if (TraceLoopOpts) {
twisti@34174 381 tty->print_cr("CountedLoopReserveKit::create_reserve: %d not counted loop", _lpt->_head->_idx);
twisti@34174 382 }
iveresov@33166 383 return false;
iveresov@33166 384 }
iveresov@33166 385 CountedLoopNode *cl = _lpt->_head->as_CountedLoop();
iveresov@33166 386 if (!cl->is_valid_counted_loop()) {
twisti@34174 387 if (TraceLoopOpts) {
twisti@34174 388 tty->print_cr("CountedLoopReserveKit::create_reserve: %d not valid counted loop", cl->_idx);
twisti@34174 389 }
iveresov@33166 390 return false; // skip malformed counted loop
iveresov@33166 391 }
iveresov@33166 392 if (!cl->is_main_loop()) {
mcberg@38049 393 bool loop_not_canonical = true;
mcberg@38049 394 if (cl->is_post_loop() && (cl->slp_max_unroll() > 0)) {
mcberg@38049 395 loop_not_canonical = false;
twisti@34174 396 }
mcberg@38049 397 // only reject some loop forms
mcberg@38049 398 if (loop_not_canonical) {
mcberg@38049 399 if (TraceLoopOpts) {
mcberg@38049 400 tty->print_cr("CountedLoopReserveKit::create_reserve: %d not canonical loop", cl->_idx);
mcberg@38049 401 }
mcberg@38049 402 return false; // skip normal, pre, and post (conditionally) loops
mcberg@38049 403 }
iveresov@33166 404 }
iveresov@33166 405
iveresov@33166 406 _lp = _lpt->_head->as_Loop();
iveresov@33166 407 _lp_reserved = _phase->create_reserve_version_of_loop(_lpt, this);
iveresov@33166 408
iveresov@33166 409 if (!_lp_reserved->is_CountedLoop()) {
iveresov@33166 410 return false;
iveresov@33166 411 }
iveresov@33166 412
roland@48361 413 Node* ifslow_pred = _lp_reserved->skip_strip_mined()->in(LoopNode::EntryControl);
iveresov@33166 414
iveresov@33166 415 if (!ifslow_pred->is_IfFalse()) {
iveresov@33166 416 return false;
iveresov@33166 417 }
iveresov@33166 418
iveresov@33166 419 Node* iff = ifslow_pred->in(0);
iveresov@33166 420 if (!iff->is_If() || iff != _iff) {
iveresov@33166 421 return false;
iveresov@33166 422 }
iveresov@33166 423
iveresov@33166 424 if (iff->in(1)->Opcode() != Op_ConI) {
iveresov@33166 425 return false;
iveresov@33166 426 }
iveresov@33166 427
iveresov@33166 428 return _has_reserved = true;
iveresov@33166 429 }