equal
deleted
inserted
replaced
1 /* |
1 /* |
2 * Copyright (c) 1998, 2009, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 1998, 2010, 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. |
20 * or visit www.oracle.com if you need additional information or have any |
20 * or visit www.oracle.com if you need additional information or have any |
21 * questions. |
21 * questions. |
22 * |
22 * |
23 */ |
23 */ |
24 |
24 |
|
25 #ifndef SHARE_VM_OPTO_LOOPNODE_HPP |
|
26 #define SHARE_VM_OPTO_LOOPNODE_HPP |
|
27 |
|
28 #include "opto/cfgnode.hpp" |
|
29 #include "opto/multnode.hpp" |
|
30 #include "opto/phaseX.hpp" |
|
31 #include "opto/subnode.hpp" |
|
32 #include "opto/type.hpp" |
|
33 |
25 class CmpNode; |
34 class CmpNode; |
26 class CountedLoopEndNode; |
35 class CountedLoopEndNode; |
27 class CountedLoopNode; |
36 class CountedLoopNode; |
28 class IdealLoopTree; |
37 class IdealLoopTree; |
29 class LoopNode; |
38 class LoopNode; |
1013 |
1022 |
1014 void next(); // Advance to next loop tree |
1023 void next(); // Advance to next loop tree |
1015 |
1024 |
1016 IdealLoopTree* current() { return _curnt; } // Return current value of iterator. |
1025 IdealLoopTree* current() { return _curnt; } // Return current value of iterator. |
1017 }; |
1026 }; |
|
1027 |
|
1028 #endif // SHARE_VM_OPTO_LOOPNODE_HPP |