Lines Matching refs:orig
1532 Node* orig = n->debug_orig();
1533 if (orig != NULL) {
1535 if (NotANode(orig)) break;
1536 find_recur(C, result, orig, idx, only_ctrl, old_space, new_space );
1537 orig = orig->debug_orig();
1538 } while (orig != NULL && orig != n->debug_orig());
1584 static void dump_orig(Node* orig, outputStream *st) {
1586 if (NotANode(orig)) orig = NULL;
1587 if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL;
1588 if (orig == NULL) return;
1589 st->print(" !orig=");
1590 Node* fast = orig->debug_orig(); // tortoise & hare algorithm to detect loops
1592 while (orig != NULL) {
1593 bool discon = is_disconnected(orig); // if discon, print [123] else 123
1595 if (!Compile::current()->node_arena()->contains(orig))
1597 st->print("%d", orig->_idx);
1599 orig = orig->debug_orig();
1600 if (NotANode(orig)) orig = NULL;
1601 if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL;
1602 if (orig != NULL) st->print(",");
1604 // Step fast twice for each single step of orig:
1607 if (fast != NULL && fast != orig) {
1611 if (fast == orig) {
1619 void Node::set_debug_orig(Node* orig) {
1620 _debug_orig = orig;
1622 if (NotANode(orig)) orig = NULL;
1624 while (orig != NULL) {
1625 if (orig->debug_idx() == BreakAtNode || (int)orig->_idx == BreakAtNode) {
1626 tty->print_cr("BreakAtNode: _idx=%d _debug_idx=%d orig._idx=%d orig._debug_idx=%d",
1627 this->_idx, this->debug_idx(), orig->_idx, orig->debug_idx());
1630 orig = orig->debug_orig();
1631 if (NotANode(orig)) orig = NULL;