1 /*
   2  * Copyright (c) 1997, 2013, 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 "runtime/timer.hpp"
  29 
  30 class IfNode;
  31 class MergeMemNode;
  32 class Node;
  33 class PhaseGVN;
  34 
  35 //------------------------------Phase------------------------------------------
  36 // Most optimizations are done in Phases.  Creating a phase does any long
  37 // running analysis required, and caches the analysis in internal data
  38 // structures.  Later the analysis is queried using transform() calls to
  39 // guide transforming the program.  When the Phase is deleted, so is any
  40 // cached analysis info.  This basic Phase class mostly contains timing and
  41 // memory management code.
  42 class Phase : public StackObj {
  43 public:
  44   enum PhaseNumber {
  45     Compiler,                   // Top-level compiler phase
  46     Parser,                     // Parse bytecodes
  47     Remove_Useless,             // Remove useless nodes
  48     Optimistic,                 // Optimistic analysis phase
  49     GVN,                        // Pessimistic global value numbering phase
  50     Ins_Select,                 // Instruction selection phase
  51     CFG,                        // Build a CFG
  52     BlockLayout,                // Linear ordering of blocks
  53     Register_Allocation,        // Register allocation, duh
  54     LIVE,                       // Dragon-book LIVE range problem
  55     StringOpts,                 // StringBuilder related optimizations
  56     Interference_Graph,         // Building the IFG
  57     Coalesce,                   // Coalescing copies
  58     Ideal_Loop,                 // Find idealized trip-counted loops
  59     Macro_Expand,               // Expand macro nodes
  60     Peephole,                   // Apply peephole optimizations
  61     last_phase
  62   };
  63 protected:
  64   enum PhaseNumber _pnum;       // Phase number (for stat gathering)
  65 
  66 #ifndef PRODUCT
  67   static int _total_bytes_compiled;
  68 
  69   // accumulated timers
  70   static elapsedTimer _t_totalCompilation;
  71   static elapsedTimer _t_methodCompilation;
  72   static elapsedTimer _t_stubCompilation;
  73 #endif
  74 
  75 // The next timers used for LogCompilation
  76   static elapsedTimer _t_parser;
  77   static elapsedTimer _t_optimizer;
  78 public:
  79   // ConnectionGraph can't be Phase since it is used after EA done.
  80   static elapsedTimer   _t_escapeAnalysis;
  81   static elapsedTimer     _t_connectionGraph;
  82 protected:
  83   static elapsedTimer   _t_idealLoop;
  84   static elapsedTimer   _t_ccp;
  85   static elapsedTimer _t_matcher;
  86   static elapsedTimer _t_registerAllocation;
  87   static elapsedTimer _t_output;
  88 
  89 #ifndef PRODUCT
  90   static elapsedTimer _t_graphReshaping;
  91   static elapsedTimer _t_scheduler;
  92   static elapsedTimer _t_blockOrdering;
  93   static elapsedTimer _t_macroEliminate;
  94   static elapsedTimer _t_macroExpand;
  95   static elapsedTimer _t_peephole;
  96   static elapsedTimer _t_postalloc_expand;
  97   static elapsedTimer _t_codeGeneration;
  98   static elapsedTimer _t_registerMethod;
  99   static elapsedTimer _t_temporaryTimer1;
 100   static elapsedTimer _t_temporaryTimer2;
 101   static elapsedTimer _t_idealLoopVerify;
 102 
 103 // Subtimers for _t_optimizer
 104   static elapsedTimer   _t_iterGVN;
 105   static elapsedTimer   _t_iterGVN2;
 106   static elapsedTimer   _t_incrInline;
 107 
 108 // Subtimers for _t_registerAllocation
 109   static elapsedTimer   _t_ctorChaitin;
 110   static elapsedTimer   _t_buildIFGphysical;
 111   static elapsedTimer   _t_computeLive;
 112   static elapsedTimer   _t_regAllocSplit;
 113   static elapsedTimer   _t_postAllocCopyRemoval;
 114   static elapsedTimer   _t_fixupSpills;
 115 
 116 // Subtimers for _t_output
 117   static elapsedTimer   _t_instrSched;
 118   static elapsedTimer   _t_buildOopMaps;
 119 #endif
 120 
 121   // Generate a subtyping check.  Takes as input the subtype and supertype.
 122   // Returns 2 values: sets the default control() to the true path and
 123   // returns the false path.  Only reads from constant memory taken from the
 124   // default memory; does not write anything.  It also doesn't take in an
 125   // Object; if you wish to check an Object you need to load the Object's
 126   // class prior to coming here.
 127   // Used in GraphKit and PhaseMacroExpand
 128   static Node* gen_subtype_check(Node* subklass, Node* superklass, Node** ctrl, MergeMemNode* mem, PhaseGVN* gvn);
 129 
 130 public:
 131   Compile * C;
 132   Phase( PhaseNumber pnum );
 133 
 134 #ifndef PRODUCT
 135   static void print_timers();
 136 #endif
 137 };
 138 
 139 #endif // SHARE_VM_OPTO_PHASE_HPP