1 /* 2 * Copyright (c) 2007, 2015, 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 #ifndef SHARE_VM_OPTO_SUPERWORD_HPP 25 #define SHARE_VM_OPTO_SUPERWORD_HPP 26 27 #include "opto/loopnode.hpp" 28 #include "opto/node.hpp" 29 #include "opto/phaseX.hpp" 30 #include "opto/vectornode.hpp" 31 #include "utilities/growableArray.hpp" 32 33 // 34 // S U P E R W O R D T R A N S F O R M 35 // 36 // SuperWords are short, fixed length vectors. 37 // 38 // Algorithm from: 39 // 40 // Exploiting SuperWord Level Parallelism with 41 // Multimedia Instruction Sets 42 // by 43 // Samuel Larsen and Saman Amarasinghe 44 // MIT Laboratory for Computer Science 45 // date 46 // May 2000 47 // published in 48 // ACM SIGPLAN Notices 49 // Proceedings of ACM PLDI '00, Volume 35 Issue 5 50 // 51 // Definition 3.1 A Pack is an n-tuple, <s1, ...,sn>, where 52 // s1,...,sn are independent isomorphic statements in a basic 53 // block. 54 // 55 // Definition 3.2 A PackSet is a set of Packs. 56 // 57 // Definition 3.3 A Pair is a Pack of size two, where the 58 // first statement is considered the left element, and the 59 // second statement is considered the right element. 60 61 class SWPointer; 62 class OrderedPair; 63 64 // ========================= Dependence Graph ===================== 65 66 class DepMem; 67 68 //------------------------------DepEdge--------------------------- 69 // An edge in the dependence graph. The edges incident to a dependence 70 // node are threaded through _next_in for incoming edges and _next_out 71 // for outgoing edges. 72 class DepEdge : public ResourceObj { 73 protected: 74 DepMem* _pred; 75 DepMem* _succ; 76 DepEdge* _next_in; // list of in edges, null terminated 77 DepEdge* _next_out; // list of out edges, null terminated 78 79 public: 80 DepEdge(DepMem* pred, DepMem* succ, DepEdge* next_in, DepEdge* next_out) : 81 _pred(pred), _succ(succ), _next_in(next_in), _next_out(next_out) {} 82 83 DepEdge* next_in() { return _next_in; } 84 DepEdge* next_out() { return _next_out; } 85 DepMem* pred() { return _pred; } 86 DepMem* succ() { return _succ; } 87 88 void print(); 89 }; 90 91 //------------------------------DepMem--------------------------- 92 // A node in the dependence graph. _in_head starts the threaded list of 93 // incoming edges, and _out_head starts the list of outgoing edges. 94 class DepMem : public ResourceObj { 95 protected: 96 Node* _node; // Corresponding ideal node 97 DepEdge* _in_head; // Head of list of in edges, null terminated 98 DepEdge* _out_head; // Head of list of out edges, null terminated 99 100 public: 101 DepMem(Node* node) : _node(node), _in_head(NULL), _out_head(NULL) {} 102 103 Node* node() { return _node; } 104 DepEdge* in_head() { return _in_head; } 105 DepEdge* out_head() { return _out_head; } 106 void set_in_head(DepEdge* hd) { _in_head = hd; } 107 void set_out_head(DepEdge* hd) { _out_head = hd; } 108 109 int in_cnt(); // Incoming edge count 110 int out_cnt(); // Outgoing edge count 111 112 void print(); 113 }; 114 115 //------------------------------DepGraph--------------------------- 116 class DepGraph VALUE_OBJ_CLASS_SPEC { 117 protected: 118 Arena* _arena; 119 GrowableArray<DepMem*> _map; 120 DepMem* _root; 121 DepMem* _tail; 122 123 public: 124 DepGraph(Arena* a) : _arena(a), _map(a, 8, 0, NULL) { 125 _root = new (_arena) DepMem(NULL); 126 _tail = new (_arena) DepMem(NULL); 127 } 128 129 DepMem* root() { return _root; } 130 DepMem* tail() { return _tail; } 131 132 // Return dependence node corresponding to an ideal node 133 DepMem* dep(Node* node) { return _map.at(node->_idx); } 134 135 // Make a new dependence graph node for an ideal node. 136 DepMem* make_node(Node* node); 137 138 // Make a new dependence graph edge dprec->dsucc 139 DepEdge* make_edge(DepMem* dpred, DepMem* dsucc); 140 141 DepEdge* make_edge(Node* pred, Node* succ) { return make_edge(dep(pred), dep(succ)); } 142 DepEdge* make_edge(DepMem* pred, Node* succ) { return make_edge(pred, dep(succ)); } 143 DepEdge* make_edge(Node* pred, DepMem* succ) { return make_edge(dep(pred), succ); } 144 145 void init() { _map.clear(); } // initialize 146 147 void print(Node* n) { dep(n)->print(); } 148 void print(DepMem* d) { d->print(); } 149 }; 150 151 //------------------------------DepPreds--------------------------- 152 // Iterator over predecessors in the dependence graph and 153 // non-memory-graph inputs of ideal nodes. 154 class DepPreds : public StackObj { 155 private: 156 Node* _n; 157 int _next_idx, _end_idx; 158 DepEdge* _dep_next; 159 Node* _current; 160 bool _done; 161 162 public: 163 DepPreds(Node* n, DepGraph& dg); 164 Node* current() { return _current; } 165 bool done() { return _done; } 166 void next(); 167 }; 168 169 //------------------------------DepSuccs--------------------------- 170 // Iterator over successors in the dependence graph and 171 // non-memory-graph outputs of ideal nodes. 172 class DepSuccs : public StackObj { 173 private: 174 Node* _n; 175 int _next_idx, _end_idx; 176 DepEdge* _dep_next; 177 Node* _current; 178 bool _done; 179 180 public: 181 DepSuccs(Node* n, DepGraph& dg); 182 Node* current() { return _current; } 183 bool done() { return _done; } 184 void next(); 185 }; 186 187 188 // ========================= SuperWord ===================== 189 190 // -----------------------------SWNodeInfo--------------------------------- 191 // Per node info needed by SuperWord 192 class SWNodeInfo VALUE_OBJ_CLASS_SPEC { 193 public: 194 int _alignment; // memory alignment for a node 195 int _depth; // Max expression (DAG) depth from block start 196 const Type* _velt_type; // vector element type 197 Node_List* _my_pack; // pack containing this node 198 199 SWNodeInfo() : _alignment(-1), _depth(0), _velt_type(NULL), _my_pack(NULL) {} 200 static const SWNodeInfo initial; 201 }; 202 203 // -----------------------------SuperWord--------------------------------- 204 // Transforms scalar operations into packed (superword) operations. 205 class SuperWord : public ResourceObj { 206 friend class SWPointer; 207 private: 208 PhaseIdealLoop* _phase; 209 Arena* _arena; 210 PhaseIterGVN &_igvn; 211 212 enum consts { top_align = -1, bottom_align = -666 }; 213 214 GrowableArray<Node_List*> _packset; // Packs for the current block 215 216 GrowableArray<int> _bb_idx; // Map from Node _idx to index within block 217 218 GrowableArray<Node*> _block; // Nodes in current block 219 GrowableArray<Node*> _data_entry; // Nodes with all inputs from outside 220 GrowableArray<Node*> _mem_slice_head; // Memory slice head nodes 221 GrowableArray<Node*> _mem_slice_tail; // Memory slice tail nodes 222 GrowableArray<Node*> _iteration_first; // nodes in the generation that has deps from phi 223 GrowableArray<Node*> _iteration_last; // nodes in the generation that has deps to phi 224 GrowableArray<SWNodeInfo> _node_info; // Info needed per node 225 CloneMap& _clone_map; // map of nodes created in cloning 226 227 MemNode* _align_to_ref; // Memory reference that pre-loop will align to 228 229 GrowableArray<OrderedPair> _disjoint_ptrs; // runtime disambiguated pointer pairs 230 231 DepGraph _dg; // Dependence graph 232 233 // Scratch pads 234 VectorSet _visited; // Visited set 235 VectorSet _post_visited; // Post-visited set 236 Node_Stack _n_idx_list; // List of (node,index) pairs 237 GrowableArray<Node*> _nlist; // List of nodes 238 GrowableArray<Node*> _stk; // Stack of nodes 239 240 public: 241 SuperWord(PhaseIdealLoop* phase); 242 243 void transform_loop(IdealLoopTree* lpt, bool do_optimization); 244 245 void unrolling_analysis(int &local_loop_unroll_factor); 246 247 // Accessors for SWPointer 248 PhaseIdealLoop* phase() { return _phase; } 249 IdealLoopTree* lpt() { return _lpt; } 250 PhiNode* iv() { return _iv; } 251 252 bool early_return() { return _early_return; } 253 254 #ifndef PRODUCT 255 bool is_debug() { return _vector_loop_debug > 0; } 256 bool is_trace_alignment() { return (_vector_loop_debug & 2) > 0; } 257 bool is_trace_mem_slice() { return (_vector_loop_debug & 4) > 0; } 258 bool is_trace_loop() { return (_vector_loop_debug & 8) > 0; } 259 bool is_trace_adjacent() { return (_vector_loop_debug & 16) > 0; } 260 #endif 261 bool do_vector_loop() { return _do_vector_loop; } 262 private: 263 IdealLoopTree* _lpt; // Current loop tree node 264 LoopNode* _lp; // Current LoopNode 265 Node* _bb; // Current basic block 266 PhiNode* _iv; // Induction var 267 bool _race_possible; // In cases where SDMU is true 268 bool _early_return; // True if we do not initialize 269 bool _do_vector_loop; // whether to do vectorization/simd style 270 int _num_work_vecs; // Number of non memory vector operations 271 int _num_reductions; // Number of reduction expressions applied 272 int _ii_first; // generation with direct deps from mem phi 273 int _ii_last; // generation with direct deps to mem phi 274 GrowableArray<int> _ii_order; 275 #ifndef PRODUCT 276 uintx _vector_loop_debug; // provide more printing in debug mode 277 #endif 278 279 // Accessors 280 Arena* arena() { return _arena; } 281 282 Node* bb() { return _bb; } 283 void set_bb(Node* bb) { _bb = bb; } 284 285 void set_lpt(IdealLoopTree* lpt) { _lpt = lpt; } 286 287 LoopNode* lp() { return _lp; } 288 void set_lp(LoopNode* lp) { _lp = lp; 289 _iv = lp->as_CountedLoop()->phi()->as_Phi(); } 290 int iv_stride() { return lp()->as_CountedLoop()->stride_con(); } 291 292 int vector_width(Node* n) { 293 BasicType bt = velt_basic_type(n); 294 return MIN2(ABS(iv_stride()), Matcher::max_vector_size(bt)); 295 } 296 int vector_width_in_bytes(Node* n) { 297 BasicType bt = velt_basic_type(n); 298 return vector_width(n)*type2aelembytes(bt); 299 } 300 MemNode* align_to_ref() { return _align_to_ref; } 301 void set_align_to_ref(MemNode* m) { _align_to_ref = m; } 302 303 Node* ctrl(Node* n) const { return _phase->has_ctrl(n) ? _phase->get_ctrl(n) : n; } 304 305 // block accessors 306 bool in_bb(Node* n) { return n != NULL && n->outcnt() > 0 && ctrl(n) == _bb; } 307 int bb_idx(Node* n) { assert(in_bb(n), "must be"); return _bb_idx.at(n->_idx); } 308 void set_bb_idx(Node* n, int i) { _bb_idx.at_put_grow(n->_idx, i); } 309 310 // visited set accessors 311 void visited_clear() { _visited.Clear(); } 312 void visited_set(Node* n) { return _visited.set(bb_idx(n)); } 313 int visited_test(Node* n) { return _visited.test(bb_idx(n)); } 314 int visited_test_set(Node* n) { return _visited.test_set(bb_idx(n)); } 315 void post_visited_clear() { _post_visited.Clear(); } 316 void post_visited_set(Node* n) { return _post_visited.set(bb_idx(n)); } 317 int post_visited_test(Node* n) { return _post_visited.test(bb_idx(n)); } 318 319 // Ensure node_info contains element "i" 320 void grow_node_info(int i) { if (i >= _node_info.length()) _node_info.at_put_grow(i, SWNodeInfo::initial); } 321 322 // memory alignment for a node 323 int alignment(Node* n) { return _node_info.adr_at(bb_idx(n))->_alignment; } 324 void set_alignment(Node* n, int a) { int i = bb_idx(n); grow_node_info(i); _node_info.adr_at(i)->_alignment = a; } 325 326 // Max expression (DAG) depth from beginning of the block for each node 327 int depth(Node* n) { return _node_info.adr_at(bb_idx(n))->_depth; } 328 void set_depth(Node* n, int d) { int i = bb_idx(n); grow_node_info(i); _node_info.adr_at(i)->_depth = d; } 329 330 // vector element type 331 const Type* velt_type(Node* n) { return _node_info.adr_at(bb_idx(n))->_velt_type; } 332 BasicType velt_basic_type(Node* n) { return velt_type(n)->array_element_basic_type(); } 333 void set_velt_type(Node* n, const Type* t) { int i = bb_idx(n); grow_node_info(i); _node_info.adr_at(i)->_velt_type = t; } 334 bool same_velt_type(Node* n1, Node* n2); 335 336 // my_pack 337 Node_List* my_pack(Node* n) { return !in_bb(n) ? NULL : _node_info.adr_at(bb_idx(n))->_my_pack; } 338 void set_my_pack(Node* n, Node_List* p) { int i = bb_idx(n); grow_node_info(i); _node_info.adr_at(i)->_my_pack = p; } 339 340 // CloneMap utilities 341 bool same_origin_idx(Node* a, Node* b) const; 342 bool same_generation(Node* a, Node* b) const; 343 344 // methods 345 346 // Extract the superword level parallelism 347 void SLP_extract(); 348 // Find the adjacent memory references and create pack pairs for them. 349 void find_adjacent_refs(); 350 // Tracing support 351 #ifndef PRODUCT 352 void find_adjacent_refs_trace_1(Node* best_align_to_mem_ref, int best_iv_adjustment); 353 #endif 354 // Find a memory reference to align the loop induction variable to. 355 MemNode* find_align_to_ref(Node_List &memops); 356 // Calculate loop's iv adjustment for this memory ops. 357 int get_iv_adjustment(MemNode* mem); 358 // Can the preloop align the reference to position zero in the vector? 359 bool ref_is_alignable(SWPointer& p); 360 // rebuild the graph so all loads in different iterations of cloned loop become dependant on phi node (in _do_vector_loop only) 361 bool hoist_loads_in_graph(); 362 // Test whether MemNode::Memory dependency to the same load but in the first iteration of this loop is coming from memory phi 363 // Return false if failed 364 Node* find_phi_for_mem_dep(LoadNode* ld); 365 // Return same node but from the first generation. Return 0, if not found 366 Node* first_node(Node* nd); 367 // Return same node as this but from the last generation. Return 0, if not found 368 Node* last_node(Node* n); 369 // Mark nodes belonging to first and last generation 370 // returns first generation index or -1 if vectorization/simd is impossible 371 int mark_generations(); 372 // swapping inputs of commutative instruction (Add or Mul) 373 bool fix_commutative_inputs(Node* gold, Node* fix); 374 // make packs forcefully (in _do_vector_loop only) 375 bool pack_parallel(); 376 // Construct dependency graph. 377 void dependence_graph(); 378 // Return a memory slice (node list) in predecessor order starting at "start" 379 void mem_slice_preds(Node* start, Node* stop, GrowableArray<Node*> &preds); 380 // Can s1 and s2 be in a pack with s1 immediately preceding s2 and s1 aligned at "align" 381 bool stmts_can_pack(Node* s1, Node* s2, int align); 382 // Does s exist in a pack at position pos? 383 bool exists_at(Node* s, uint pos); 384 // Is s1 immediately before s2 in memory? 385 bool are_adjacent_refs(Node* s1, Node* s2); 386 // Are s1 and s2 similar? 387 bool isomorphic(Node* s1, Node* s2); 388 // Is there no data path from s1 to s2 or s2 to s1? 389 bool independent(Node* s1, Node* s2); 390 // Is there a data path between s1 and s2 and both are reductions? 391 bool reduction(Node* s1, Node* s2); 392 // Helper for independent 393 bool independent_path(Node* shallow, Node* deep, uint dp=0); 394 void set_alignment(Node* s1, Node* s2, int align); 395 int data_size(Node* s); 396 // Extend packset by following use->def and def->use links from pack members. 397 void extend_packlist(); 398 // Extend the packset by visiting operand definitions of nodes in pack p 399 bool follow_use_defs(Node_List* p); 400 // Extend the packset by visiting uses of nodes in pack p 401 bool follow_def_uses(Node_List* p); 402 // For extended packsets, ordinally arrange uses packset by major component 403 void order_def_uses(Node_List* p); 404 // Estimate the savings from executing s1 and s2 as a pack 405 int est_savings(Node* s1, Node* s2); 406 int adjacent_profit(Node* s1, Node* s2); 407 int pack_cost(int ct); 408 int unpack_cost(int ct); 409 // Combine packs A and B with A.last == B.first into A.first..,A.last,B.second,..B.last 410 void combine_packs(); 411 // Construct the map from nodes to packs. 412 void construct_my_pack_map(); 413 // Remove packs that are not implemented or not profitable. 414 void filter_packs(); 415 // Adjust the memory graph for the packed operations 416 void schedule(); 417 // Remove "current" from its current position in the memory graph and insert 418 // it after the appropriate insert points (lip or uip); 419 void remove_and_insert(MemNode *current, MemNode *prev, MemNode *lip, Node *uip, Unique_Node_List &schd_before); 420 // Within a store pack, schedule stores together by moving out the sandwiched memory ops according 421 // to dependence info; and within a load pack, move loads down to the last executed load. 422 void co_locate_pack(Node_List* p); 423 // Convert packs into vector node operations 424 void output(); 425 // Create a vector operand for the nodes in pack p for operand: in(opd_idx) 426 Node* vector_opd(Node_List* p, int opd_idx); 427 // Can code be generated for pack p? 428 bool implemented(Node_List* p); 429 // For pack p, are all operands and all uses (with in the block) vector? 430 bool profitable(Node_List* p); 431 // If a use of pack p is not a vector use, then replace the use with an extract operation. 432 void insert_extracts(Node_List* p); 433 // Is use->in(u_idx) a vector use? 434 bool is_vector_use(Node* use, int u_idx); 435 // Construct reverse postorder list of block members 436 bool construct_bb(); 437 // Initialize per node info 438 void initialize_bb(); 439 // Insert n into block after pos 440 void bb_insert_after(Node* n, int pos); 441 // Compute max depth for expressions from beginning of block 442 void compute_max_depth(); 443 // Compute necessary vector element type for expressions 444 void compute_vector_element_type(); 445 // Are s1 and s2 in a pack pair and ordered as s1,s2? 446 bool in_packset(Node* s1, Node* s2); 447 // Is s in pack p? 448 Node_List* in_pack(Node* s, Node_List* p); 449 // Remove the pack at position pos in the packset 450 void remove_pack_at(int pos); 451 // Return the node executed first in pack p. 452 Node* executed_first(Node_List* p); 453 // Return the node executed last in pack p. 454 Node* executed_last(Node_List* p); 455 static LoadNode::ControlDependency control_dependency(Node_List* p); 456 // Alignment within a vector memory reference 457 int memory_alignment(MemNode* s, int iv_adjust); 458 // (Start, end] half-open range defining which operands are vector 459 void vector_opd_range(Node* n, uint* start, uint* end); 460 // Smallest type containing range of values 461 const Type* container_type(Node* n); 462 // Adjust pre-loop limit so that in main loop, a load/store reference 463 // to align_to_ref will be a position zero in the vector. 464 void align_initial_loop_index(MemNode* align_to_ref); 465 // Find pre loop end from main loop. Returns null if none. 466 CountedLoopEndNode* get_pre_loop_end(CountedLoopNode *cl); 467 // Is the use of d1 in u1 at the same operand position as d2 in u2? 468 bool opnd_positions_match(Node* d1, Node* u1, Node* d2, Node* u2); 469 void init(); 470 // clean up some basic structures - used if the ideal graph was rebuilt 471 void restart(); 472 473 // print methods 474 void print_packset(); 475 void print_pack(Node_List* p); 476 void print_bb(); 477 void print_stmt(Node* s); 478 char* blank(uint depth); 479 480 void packset_sort(int n); 481 }; 482 483 484 485 //------------------------------SWPointer--------------------------- 486 // Information about an address for dependence checking and vector alignment 487 class SWPointer VALUE_OBJ_CLASS_SPEC { 488 protected: 489 MemNode* _mem; // My memory reference node 490 SuperWord* _slp; // SuperWord class 491 492 Node* _base; // NULL if unsafe nonheap reference 493 Node* _adr; // address pointer 494 jint _scale; // multiplier for iv (in bytes), 0 if no loop iv 495 jint _offset; // constant offset (in bytes) 496 Node* _invar; // invariant offset (in bytes), NULL if none 497 bool _negate_invar; // if true then use: (0 - _invar) 498 Node_Stack* _nstack; // stack used to record a swpointer trace of variants 499 bool _analyze_only; // Used in loop unrolling only for swpointer trace 500 uint _stack_idx; // Used in loop unrolling only for swpointer trace 501 502 PhaseIdealLoop* phase() { return _slp->phase(); } 503 IdealLoopTree* lpt() { return _slp->lpt(); } 504 PhiNode* iv() { return _slp->iv(); } // Induction var 505 506 bool invariant(Node* n); 507 508 // Match: k*iv + offset 509 bool scaled_iv_plus_offset(Node* n); 510 // Match: k*iv where k is a constant that's not zero 511 bool scaled_iv(Node* n); 512 // Match: offset is (k [+/- invariant]) 513 bool offset_plus_k(Node* n, bool negate = false); 514 515 public: 516 enum CMP { 517 Less = 1, 518 Greater = 2, 519 Equal = 4, 520 NotEqual = (Less | Greater), 521 NotComparable = (Less | Greater | Equal) 522 }; 523 524 SWPointer(MemNode* mem, SuperWord* slp, Node_Stack *nstack, bool analyze_only); 525 // Following is used to create a temporary object during 526 // the pattern match of an address expression. 527 SWPointer(SWPointer* p); 528 529 bool valid() { return _adr != NULL; } 530 bool has_iv() { return _scale != 0; } 531 532 Node* base() { return _base; } 533 Node* adr() { return _adr; } 534 MemNode* mem() { return _mem; } 535 int scale_in_bytes() { return _scale; } 536 Node* invar() { return _invar; } 537 bool negate_invar() { return _negate_invar; } 538 int offset_in_bytes() { return _offset; } 539 int memory_size() { return _mem->memory_size(); } 540 Node_Stack* node_stack() { return _nstack; } 541 542 // Comparable? 543 int cmp(SWPointer& q) { 544 if (valid() && q.valid() && 545 (_adr == q._adr || _base == _adr && q._base == q._adr) && 546 _scale == q._scale && 547 _invar == q._invar && 548 _negate_invar == q._negate_invar) { 549 bool overlap = q._offset < _offset + memory_size() && 550 _offset < q._offset + q.memory_size(); 551 return overlap ? Equal : (_offset < q._offset ? Less : Greater); 552 } else { 553 return NotComparable; 554 } 555 } 556 557 bool not_equal(SWPointer& q) { return not_equal(cmp(q)); } 558 bool equal(SWPointer& q) { return equal(cmp(q)); } 559 bool comparable(SWPointer& q) { return comparable(cmp(q)); } 560 static bool not_equal(int cmp) { return cmp <= NotEqual; } 561 static bool equal(int cmp) { return cmp == Equal; } 562 static bool comparable(int cmp) { return cmp < NotComparable; } 563 564 void print(); 565 566 #ifndef PRODUCT 567 class Tracer { 568 friend class SuperWord; 569 friend class SWPointer; 570 SuperWord* _slp; 571 static int _depth; 572 int _depth_save; 573 void print_depth(); 574 int depth() const { return _depth; } 575 void set_depth(int d) { _depth = d; } 576 void inc_depth() { _depth++;} 577 void dec_depth() { if (_depth > 0) _depth--;} 578 void store_depth() {_depth_save = _depth;} 579 void restore_depth() {_depth = _depth_save;} 580 581 class Depth { 582 friend class Tracer; 583 friend class SWPointer; 584 friend class SuperWord; 585 Depth() { ++_depth; } 586 Depth(int x) { _depth = 0; } 587 ~Depth() { if (_depth > 0) --_depth;} 588 }; 589 Tracer (SuperWord* slp) : _slp(slp) {} 590 591 // tracing functions 592 void ctor_1(Node* mem); 593 void ctor_2(Node* adr); 594 void ctor_3(Node* adr, int i); 595 void ctor_4(Node* adr, int i); 596 void ctor_5(Node* adr, Node* base, int i); 597 void ctor_6(Node* mem); 598 599 void invariant_1(Node *n, Node *n_c); 600 601 void scaled_iv_plus_offset_1(Node* n); 602 void scaled_iv_plus_offset_2(Node* n); 603 void scaled_iv_plus_offset_3(Node* n); 604 void scaled_iv_plus_offset_4(Node* n); 605 void scaled_iv_plus_offset_5(Node* n); 606 void scaled_iv_plus_offset_6(Node* n); 607 void scaled_iv_plus_offset_7(Node* n); 608 void scaled_iv_plus_offset_8(Node* n); 609 610 void scaled_iv_1(Node* n); 611 void scaled_iv_2(Node* n, int scale); 612 void scaled_iv_3(Node* n, int scale); 613 void scaled_iv_4(Node* n, int scale); 614 void scaled_iv_5(Node* n, int scale); 615 void scaled_iv_6(Node* n, int scale); 616 void scaled_iv_7(Node* n); 617 void scaled_iv_8(Node* n, SWPointer* tmp); 618 void scaled_iv_9(Node* n, int _scale, int _offset, int mult); 619 void scaled_iv_10(Node* n); 620 621 void offset_plus_k_1(Node* n); 622 void offset_plus_k_2(Node* n, int _offset); 623 void offset_plus_k_3(Node* n, int _offset); 624 void offset_plus_k_4(Node* n); 625 void offset_plus_k_5(Node* n, Node* _invar); 626 void offset_plus_k_6(Node* n, Node* _invar, bool _negate_invar, int _offset); 627 void offset_plus_k_7(Node* n, Node* _invar, bool _negate_invar, int _offset); 628 void offset_plus_k_8(Node* n, Node* _invar, bool _negate_invar, int _offset); 629 void offset_plus_k_9(Node* n, Node* _invar, bool _negate_invar, int _offset); 630 void offset_plus_k_10(Node* n, Node* _invar, bool _negate_invar, int _offset); 631 void offset_plus_k_11(Node* n); 632 633 } _tracer;//TRacer; 634 #endif 635 }; 636 637 638 //------------------------------OrderedPair--------------------------- 639 // Ordered pair of Node*. 640 class OrderedPair VALUE_OBJ_CLASS_SPEC { 641 protected: 642 Node* _p1; 643 Node* _p2; 644 public: 645 OrderedPair() : _p1(NULL), _p2(NULL) {} 646 OrderedPair(Node* p1, Node* p2) { 647 if (p1->_idx < p2->_idx) { 648 _p1 = p1; _p2 = p2; 649 } else { 650 _p1 = p2; _p2 = p1; 651 } 652 } 653 654 bool operator==(const OrderedPair &rhs) { 655 return _p1 == rhs._p1 && _p2 == rhs._p2; 656 } 657 void print() { tty->print(" (%d, %d)", _p1->_idx, _p2->_idx); } 658 659 static const OrderedPair initial; 660 }; 661 662 #endif // SHARE_VM_OPTO_SUPERWORD_HPP