equal
deleted
inserted
replaced
1 /* |
1 /* |
2 * Copyright (c) 1998, 2013, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 1998, 2014, Oracle and/or its affiliates. All rights reserved. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * |
4 * |
5 * This code is free software; you can redistribute it and/or modify it |
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 |
6 * under the terms of the GNU General Public License version 2 only, as |
7 * published by the Free Software Foundation. |
7 * published by the Free Software Foundation. |
3567 chosen_loop->_body.push(n);// Collect inner loops |
3567 chosen_loop->_body.push(n);// Collect inner loops |
3568 } |
3568 } |
3569 |
3569 |
3570 #ifdef ASSERT |
3570 #ifdef ASSERT |
3571 void PhaseIdealLoop::dump_bad_graph(const char* msg, Node* n, Node* early, Node* LCA) { |
3571 void PhaseIdealLoop::dump_bad_graph(const char* msg, Node* n, Node* early, Node* LCA) { |
3572 tty->print_cr(msg); |
3572 tty->print_cr("%s", msg); |
3573 tty->print("n: "); n->dump(); |
3573 tty->print("n: "); n->dump(); |
3574 tty->print("early(n): "); early->dump(); |
3574 tty->print("early(n): "); early->dump(); |
3575 if (n->in(0) != NULL && !n->in(0)->is_top() && |
3575 if (n->in(0) != NULL && !n->in(0)->is_top() && |
3576 n->in(0) != early && !n->in(0)->is_Root()) { |
3576 n->in(0) != early && !n->in(0)->is_Root()) { |
3577 tty->print("n->in(0): "); n->in(0)->dump(); |
3577 tty->print("n->in(0): "); n->in(0)->dump(); |