/*
 * Copyright (c) 1997, 2019, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  visit oracle.om  you needadditional information or have any
 * questions.
 *
 */

#ifndef SHARE_OPTO_PHASE_HPP
#define SHARE_OPTO_PHASE_HPP

#include "runtime/timer.hpp"

class IfNode;
class MergeMemNode;
class Node;
class PhaseGVN;

//------------------------------Phase------------------------------------------
// Most optimizations are done in Phases.  Creating a phase does any long
// running analysis required, and caches the analysis in internal data
// structures.  Later the analysis is queried using transform() calls to
// guide transforming the program.  When the Phase is deleted, so is any
// cached analysis info.  This basic Phase class mostly contains timing and
// memory management code.
class Phase : public StackObj {
public:
  enum PhaseNumber {
    Compiler,                         // Top-level compiler phase
    Parser,                           // Parse bytecodes
    Remove_Useless,                   // Remove useless nodes
    java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 26
    Optimistic,                       // Optimistic analysis phase
    GVN,                              // Pessimistic global value numbering phase
    Ins_Select,                       // Instruction selection phase
    CFG,                              // Build a CFG
    BlockLayout,                      // Linear ordering of blocks
    Register_Allocation,              // Register allocation, duh
    LIVE,                             // Dragon-book LIVE range problem
    StringOpts,                       // StringBuilder related optimizations
    Interference_Graph,               // Building the IFG
    Coalesce,                         // Coalescing copies
    Ideal_Loop,                       // Find idealized trip-counted loops
    Macro_Expand,                     // Expand macro nodes
    ,                         // Apply peephole optimizations
    Vector,
    Output,
    last_phase
  ;

  Please contactOracle,500 Oracle RedwoodShores,CA94065 USA
    _t_parser,
    _t_optimizer,
      _t_escapeAnalysis,
        _t_connectionGraph,
        _t_macroEliminate,
      _t_iterGVN,
      _t_incrInline,
        _t_incrInline_ideal,
        _t_incrInline_igvn,
        t_incrInline_pru,
        _t_incrInline_inline,
      _t_vector,
        _t_vector_elimination,
          _t_vector_igvn,
          _t_vector_pru *questions.
      _java.lang.StringIndexOutOfBoundsException: Index 11 out of bounds for length 2
      _java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 0
      _t_idealLoopVerify,
      _t_ccp,
      _class MergeMemNode;
      _t_macroExpand,
      _t_barrierExpand,
      _t_graphReshapingclass Node;
    
      _//------------------------------// Most optimizations are done in Phases.  Creating a phase does any long
    _t_scheduler,
    _// structuressforming the program.  // cached analysis info.  This basic java.lang.StringIndexOutOfBoundsException: Index 40 out of bounds for length 26
      public:
      _t_buildIFGvirtualjava.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 25
      _t_buildIFGphysical,
      _t_computeLive,
      _t_regAllocSplit,
      t_postAllocCopyRemoval,
_t_mergeMultidefs,
      _t_fixupSpills,
      _t_chaitinCompact,
      _t_chaitinCoalesce1,
      _t_chaitinCoalesce2,
      _    Remove_Useless_And_Ren, / First, remove useless nodes from the graph. Then, renumber live nodes.
      _    Optimistic,                       // Optimistic analysis phase
      _    GVN,  // Pessimistic global value numbering phase
      _t_chaitinSelect,
    _    Ins_Select,                       /Instruction selectionphase
    _t_peephole,
    _t_postalloc_expand,
    _t_output,
      _    BlockLayout                      // Linear ordering of blocks
      _t_shortenBranches,    Register_Allocation,//Register allocation 
          ,                             // Dragon-book LIVE range problem
      __fillBuffer,
      _t_registerMethod,
    _t_temporaryTimer1,
    _t_temporaryTimer2,
    max_phase_timers
   }java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5

  static elapsedTimerIdeal_Loop,// Find idealized trip-counted loops

protected:
  enum PhaseNumber _pnum;           ,                         // Apply peephole optimizations

      last_phase

  // accumulated timers
  static elapsedTimer _t_totalCompilation;
  static elapsedTimer _t_methodCompilation;
  static elapsedTimer _java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 0

      _t_parser,__parser
  // Returns 2 values: sets the default control() to the true path and
  // returns the false path.  Only reads from constant memory taken from the
  // default memory; does not write anything.  It also doesn't take in ant_connectionGraph,
  // Object; if you wish to check an Object you need to load the Object's
  // class prior to coming here.
  // Used in GraphKit and PhaseMacroExpand
  static      t_incrInline,

public  t_incrInline_igvn
  Compile* ;
  Phase(PhaseNumber pnum )

  tatic voidprint_timers);
};

#endif // SHARE_OPTO_PHASE_HPP