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 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 class Block; 26 class Bundle; 27 class C2Compiler; 28 class CallGenerator; 29 class ConnectionGraph; 30 class InlineTree; 31 class Int_Array; 32 class Matcher; 33 class MachNode; 34 class MachSafePointNode; 35 class Node; 36 class Node_Array; 37 class Node_Notes; 38 class OptoReg; 39 class PhaseCFG; 40 class PhaseGVN; 41 class PhaseIterGVN; 42 class PhaseRegAlloc; 43 class PhaseCCP; 44 class PhaseCCP_DCE; 760 // The option no_dead_code enables stronger checks that the 761 // graph is strongly connected from root in both directions. 762 void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN; 763 764 // Print bytecodes, including the scope inlining tree 765 void print_codes(); 766 767 // End-of-run dumps. 768 static void print_statistics() PRODUCT_RETURN; 769 770 // Dump formatted assembly 771 void dump_asm(int *pcs = NULL, uint pc_limit = 0) PRODUCT_RETURN; 772 void dump_pc(int *pcs, int pc_limit, Node *n); 773 774 // Verify ADLC assumptions during startup 775 static void adlc_verification() PRODUCT_RETURN; 776 777 // Definitions of pd methods 778 static void pd_compiler2_init(); 779 }; | 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 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #ifndef SHARE_VM_OPTO_COMPILE_HPP 26 #define SHARE_VM_OPTO_COMPILE_HPP 27 28 #include "asm/codeBuffer.hpp" 29 #include "ci/compilerInterface.hpp" 30 #include "code/debugInfoRec.hpp" 31 #include "code/exceptionHandlerTable.hpp" 32 #include "compiler/compilerOracle.hpp" 33 #include "libadt/dict.hpp" 34 #include "libadt/port.hpp" 35 #include "libadt/vectset.hpp" 36 #include "memory/resourceArea.hpp" 37 #include "opto/idealGraphPrinter.hpp" 38 #include "opto/phase.hpp" 39 #include "opto/regmask.hpp" 40 #include "runtime/deoptimization.hpp" 41 #include "runtime/vmThread.hpp" 42 43 class Block; 44 class Bundle; 45 class C2Compiler; 46 class CallGenerator; 47 class ConnectionGraph; 48 class InlineTree; 49 class Int_Array; 50 class Matcher; 51 class MachNode; 52 class MachSafePointNode; 53 class Node; 54 class Node_Array; 55 class Node_Notes; 56 class OptoReg; 57 class PhaseCFG; 58 class PhaseGVN; 59 class PhaseIterGVN; 60 class PhaseRegAlloc; 61 class PhaseCCP; 62 class PhaseCCP_DCE; 778 // The option no_dead_code enables stronger checks that the 779 // graph is strongly connected from root in both directions. 780 void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN; 781 782 // Print bytecodes, including the scope inlining tree 783 void print_codes(); 784 785 // End-of-run dumps. 786 static void print_statistics() PRODUCT_RETURN; 787 788 // Dump formatted assembly 789 void dump_asm(int *pcs = NULL, uint pc_limit = 0) PRODUCT_RETURN; 790 void dump_pc(int *pcs, int pc_limit, Node *n); 791 792 // Verify ADLC assumptions during startup 793 static void adlc_verification() PRODUCT_RETURN; 794 795 // Definitions of pd methods 796 static void pd_compiler2_init(); 797 }; 798 799 #endif // SHARE_VM_OPTO_COMPILE_HPP |