Lines Matching refs:orig
1457 Node* orig = n->debug_orig();
1458 if (orig != NULL) {
1460 if (NotANode(orig)) break;
1461 find_recur(C, result, orig, idx, only_ctrl, old_space, new_space );
1462 orig = orig->debug_orig();
1463 } while (orig != NULL && orig != n->debug_orig());
1510 static void dump_orig(Node* orig, outputStream *st) {
1512 if (NotANode(orig)) orig = NULL;
1513 if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL;
1514 if (orig == NULL) return;
1515 st->print(" !orig=");
1516 Node* fast = orig->debug_orig(); // tortoise & hare algorithm to detect loops
1518 while (orig != NULL) {
1519 bool discon = is_disconnected(orig); // if discon, print [123] else 123
1521 if (!Compile::current()->node_arena()->contains(orig))
1523 st->print("%d", orig->_idx);
1525 orig = orig->debug_orig();
1526 if (NotANode(orig)) orig = NULL;
1527 if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL;
1528 if (orig != NULL) st->print(",");
1530 // Step fast twice for each single step of orig:
1533 if (fast != NULL && fast != orig) {
1537 if (fast == orig) {
1545 void Node::set_debug_orig(Node* orig) {
1546 _debug_orig = orig;
1548 if (NotANode(orig)) orig = NULL;
1550 while (orig != NULL) {
1551 if (orig->debug_idx() == BreakAtNode || (int)orig->_idx == BreakAtNode) {
1552 tty->print_cr("BreakAtNode: _idx=%d _debug_idx=%d orig._idx=%d orig._debug_idx=%d",
1553 this->_idx, this->debug_idx(), orig->_idx, orig->debug_idx());
1556 orig = orig->debug_orig();
1557 if (NotANode(orig)) orig = NULL;