1 /*
   2  * Copyright (c) 1997, 2012, Oracle and/or its affiliates. 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 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_PHASE_HPP
  26 #define SHARE_VM_OPTO_PHASE_HPP
  27 
  28 #include "libadt/port.hpp"
  29 #include "runtime/timer.hpp"
  30 
  31 class Compile;
  32 
  33 //------------------------------Phase------------------------------------------
  34 // Most optimizations are done in Phases.  Creating a phase does any long
  35 // running analysis required, and caches the analysis in internal data
  36 // structures.  Later the analysis is queried using transform() calls to
  37 // guide transforming the program.  When the Phase is deleted, so is any
  38 // cached analysis info.  This basic Phase class mostly contains timing and
  39 // memory management code.
  40 class Phase : public StackObj {
  41 public:
  42   enum PhaseNumber {
  43     Compiler,                   // Top-level compiler phase
  44     Parser,                     // Parse bytecodes
  45     Remove_Useless,             // Remove useless nodes
  46     Optimistic,                 // Optimistic analysis phase
  47     GVN,                        // Pessimistic global value numbering phase
  48     Ins_Select,                 // Instruction selection phase
  49     CFG,                        // Build a CFG
  50     BlockLayout,                // Linear ordering of blocks
  51     Register_Allocation,        // Register allocation, duh
  52     LIVE,                       // Dragon-book LIVE range problem
  53     StringOpts,                 // StringBuilder related optimizations
  54     Interference_Graph,         // Building the IFG
  55     Coalesce,                   // Coalescing copies
  56     Ideal_Loop,                 // Find idealized trip-counted loops
  57     Macro_Expand,               // Expand macro nodes
  58     Peephole,                   // Apply peephole optimizations
  59     last_phase
  60   };
  61 protected:
  62   enum PhaseNumber _pnum;       // Phase number (for stat gathering)
  63 
  64 #ifndef PRODUCT
  65   static int _total_bytes_compiled;
  66 
  67   // accumulated timers
  68   static elapsedTimer _t_totalCompilation;
  69   static elapsedTimer _t_methodCompilation;
  70   static elapsedTimer _t_stubCompilation;
  71 #endif
  72 
  73 // The next timers used for LogCompilation
  74   static elapsedTimer _t_parser;

  75   static elapsedTimer _t_optimizer;
  76 public:
  77   // ConnectionGraph can't be Phase since it is used after EA done.
  78   static elapsedTimer   _t_escapeAnalysis;
  79   static elapsedTimer     _t_connectionGraph;
  80 protected:
  81   static elapsedTimer   _t_idealLoop;
  82   static elapsedTimer   _t_ccp;
  83   static elapsedTimer _t_matcher;
  84   static elapsedTimer _t_registerAllocation;
  85   static elapsedTimer _t_output;
  86 
  87 #ifndef PRODUCT
  88   static elapsedTimer _t_graphReshaping;
  89   static elapsedTimer _t_scheduler;
  90   static elapsedTimer _t_blockOrdering;
  91   static elapsedTimer _t_macroEliminate;
  92   static elapsedTimer _t_macroExpand;
  93   static elapsedTimer _t_peephole;
  94   static elapsedTimer _t_codeGeneration;
  95   static elapsedTimer _t_registerMethod;
  96   static elapsedTimer _t_temporaryTimer1;
  97   static elapsedTimer _t_temporaryTimer2;
  98   static elapsedTimer _t_idealLoopVerify;
  99 
 100 // Subtimers for _t_optimizer
 101   static elapsedTimer   _t_iterGVN;
 102   static elapsedTimer   _t_iterGVN2;
 103 
 104 // Subtimers for _t_registerAllocation
 105   static elapsedTimer   _t_ctorChaitin;
 106   static elapsedTimer   _t_buildIFGphysical;
 107   static elapsedTimer   _t_computeLive;
 108   static elapsedTimer   _t_regAllocSplit;
 109   static elapsedTimer   _t_postAllocCopyRemoval;
 110   static elapsedTimer   _t_fixupSpills;
 111 
 112 // Subtimers for _t_output
 113   static elapsedTimer   _t_instrSched;
 114   static elapsedTimer   _t_buildOopMaps;
 115 #endif
 116 public:
 117   Compile * C;
 118   Phase( PhaseNumber pnum );
 119 #ifndef PRODUCT
 120   static void print_timers();
 121 #endif
 122 };
 123 
 124 #endif // SHARE_VM_OPTO_PHASE_HPP
--- EOF ---