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   
  64   enum PhaseTraceId {
  65     _t_parser,
  66     _t_optimizer,
  67       _t_escapeAnalysis,
  68         _t_connectionGraph,
  69         _t_macroEliminate,
  70       _t_iterGVN,
  71       _t_incrInline,
  72       _t_idealLoop,
  73       _t_idealLoopVerify,
  74       _t_ccp,
  75       _t_iterGVN2,
  76       _t_macroExpand,
  77       _t_graphReshaping, 
  78     _t_matcher,
  79     _t_scheduler,
  80     _t_registerAllocation,
  81       _t_ctorChaitin,
  82       _t_buildIFGvirtual,
  83       _t_buildIFGphysical,
  84       _t_computeLive,
  85       _t_regAllocSplit,
  86       _t_postAllocCopyRemoval,
  87       _t_fixupSpills,
  88       _t_chaitinCompact,
  89       _t_chaitinCoalesce,
  90       _t_chaitinCacheLRG,
  91       _t_chaitinSimplify,
  92       _t_chaitinSelect,
  93     _t_blockOrdering,
  94     _t_peephole,
  95     _t_postalloc_expand,
  96     _t_output,         
  97        _t_instrSched,
  98        _t_buildOopMaps,
  99     _t_registerMethod,       
 100     _t_temporaryTimer1,
 101     _t_temporaryTimer2,
 102     max_phase_timers
 103    };
 104 
 105   static elapsedTimer timers[max_phase_timers];
 106 
 107 protected:
 108   enum PhaseNumber _pnum;       // Phase number (for stat gathering)
 109 
 110   static int _total_bytes_compiled;
 111 
 112   // accumulated timers
 113   static elapsedTimer _t_totalCompilation;
 114   static elapsedTimer _t_methodCompilation;
 115   static elapsedTimer _t_stubCompilation;
 116 
 117   // Generate a subtyping check.  Takes as input the subtype and supertype.
 118   // Returns 2 values: sets the default control() to the true path and
 119   // returns the false path.  Only reads from constant memory taken from the
 120   // default memory; does not write anything.  It also doesn't take in an
 121   // Object; if you wish to check an Object you need to load the Object's
 122   // class prior to coming here.
 123   // Used in GraphKit and PhaseMacroExpand
 124   static Node* gen_subtype_check(Node* subklass, Node* superklass, Node** ctrl, MergeMemNode* mem, PhaseGVN* gvn);
 125 
 126 public:
 127   Compile * C;
 128   Phase( PhaseNumber pnum );
 129 
 130   static void print_timers();
 131 };
 132 
 133 #endif // SHARE_VM_OPTO_PHASE_HPP