Mercurial > hg > truffle

comparison src/share/vm/opto/loopnode.hpp @ 8883:b9a918201d47

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Merge with hsx25
author Gilles Duboscq <duboscq@ssw.jku.at>
date Sat, 06 Apr 2013 20:04:06 +0200
parents 3b9368710f08
children 1682bec79205
comparison
equal deleted inserted replaced
8660:d47b52b0ff68 8883:b9a918201d47
601 } 601 }
602 return ctrl; 602 return ctrl;
603 } 603 }
604 604
605 public: 605 public:
606 bool has_node( Node* n ) const { return _nodes[n->_idx] != NULL; } 606 bool has_node( Node* n ) const {
607 guarantee(n != NULL, "No Node.");
608 return _nodes[n->_idx] != NULL;
609 }
607 // check if transform created new nodes that need _ctrl recorded 610 // check if transform created new nodes that need _ctrl recorded
608 Node *get_late_ctrl( Node *n, Node *early ); 611 Node *get_late_ctrl( Node *n, Node *early );
609 Node *get_early_ctrl( Node *n ); 612 Node *get_early_ctrl( Node *n );
610 Node *get_early_ctrl_for_expensive(Node *n, Node* earliest); 613 Node *get_early_ctrl_for_expensive(Node *n, Node* earliest);
611 void set_early_ctrl( Node *n ); 614 void set_early_ctrl( Node *n );
735 Node *n = idom_no_update(d); 738 Node *n = idom_no_update(d);
736 _idom[didx] = n; // Lazily remove dead CFG nodes from table. 739 _idom[didx] = n; // Lazily remove dead CFG nodes from table.
737 return n; 740 return n;
738 } 741 }
739 uint dom_depth(Node* d) const { 742 uint dom_depth(Node* d) const {
740 assert(d->_idx < _idom_size, ""); 743 guarantee(d != NULL, "Null dominator info.");
744 guarantee(d->_idx < _idom_size, "");
741 return _dom_depth[d->_idx]; 745 return _dom_depth[d->_idx];
742 } 746 }
743 void set_idom(Node* d, Node* n, uint dom_depth); 747 void set_idom(Node* d, Node* n, uint dom_depth);
744 // Locally compute IDOM using dom_lca call 748 // Locally compute IDOM using dom_lca call
745 Node *compute_idom( Node *region ) const; 749 Node *compute_idom( Node *region ) const;