1 /*
2 * Copyright 1997-2008 Sun Microsystems, Inc. All Rights Reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 *
23 */
24
25 class Compile;
26
27 //------------------------------Phase------------------------------------------
28 // Most optimizations are done in Phases. Creating a phase does any long
29 // running analysis required, and caches the analysis in internal data
30 // structures. Later the analysis is queried using transform() calls to
31 // guide transforming the program. When the Phase is deleted, so is any
32 // cached analysis info. This basic Phase class mostly contains timing and
33 // memory management code.
34 class Phase : public StackObj {
35 public:
36 enum PhaseNumber {
37 Compiler, // Top-level compiler phase
38 Parser, // Parse bytecodes
39 Remove_Useless, // Remove useless nodes
40 Optimistic, // Optimistic analysis phase
41 GVN, // Pessimistic global value numbering phase
42 Ins_Select, // Instruction selection phase
43 CFG, // Build a CFG
44 BlockLayout, // Linear ordering of blocks
45 Register_Allocation, // Register allocation, duh
46 LIVE, // Dragon-book LIVE range problem
47 Interference_Graph, // Building the IFG
48 Coalesce, // Coalescing copies
49 Ideal_Loop, // Find idealized trip-counted loops
50 Macro_Expand, // Expand macro nodes
51 Peephole, // Apply peephole optimizations
52 last_phase
53 };
54 protected:
55 enum PhaseNumber _pnum; // Phase number (for stat gathering)
56
57 #ifndef PRODUCT
58 static int _total_bytes_compiled;
59
60 // accumulated timers
61 static elapsedTimer _t_totalCompilation;
62 static elapsedTimer _t_methodCompilation;
63 static elapsedTimer _t_stubCompilation;
64 #endif
65
66 // The next timers used for LogCompilation
67 static elapsedTimer _t_parser;
68 static elapsedTimer _t_escapeAnalysis;
69 static elapsedTimer _t_optimizer;
70 static elapsedTimer _t_idealLoop;
71 static elapsedTimer _t_ccp;
72 static elapsedTimer _t_matcher;
73 static elapsedTimer _t_registerAllocation;
74 static elapsedTimer _t_output;
75
76 #ifndef PRODUCT
77 static elapsedTimer _t_graphReshaping;
78 static elapsedTimer _t_scheduler;
79 static elapsedTimer _t_blockOrdering;
80 static elapsedTimer _t_macroExpand;
81 static elapsedTimer _t_peephole;
82 static elapsedTimer _t_codeGeneration;
83 static elapsedTimer _t_registerMethod;
84 static elapsedTimer _t_temporaryTimer1;
85 static elapsedTimer _t_temporaryTimer2;
86 static elapsedTimer _t_idealLoopVerify;
87
88 // Subtimers for _t_optimizer
89 static elapsedTimer _t_iterGVN;
90 static elapsedTimer _t_iterGVN2;
91
92 // Subtimers for _t_registerAllocation
93 static elapsedTimer _t_ctorChaitin;
94 static elapsedTimer _t_buildIFGphysical;
95 static elapsedTimer _t_computeLive;
96 static elapsedTimer _t_regAllocSplit;
97 static elapsedTimer _t_postAllocCopyRemoval;
98 static elapsedTimer _t_fixupSpills;
99
100 // Subtimers for _t_output
101 static elapsedTimer _t_instrSched;
102 static elapsedTimer _t_buildOopMaps;
103 #endif
104 public:
105 Compile * C;
106 Phase( PhaseNumber pnum );
107 #ifndef PRODUCT
108 static void print_timers();
109 #endif
110 };