hotspot/src/share/vm/c1/c1_LIRGenerator.hpp

rev 10453 : imported patch update dates

*** 1,7 ****
  /*
!  * Copyright (c) 2005, 2015, 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.
--- 1,7 ----
  /*
!  * Copyright (c) 2005, 2016, 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.
*** 37,48 ****
  class LIREmitter;
  class Invoke;
  class SwitchRange;
  class LIRItem;
  
! define_array(LIRItemArray, LIRItem*)
! define_stack(LIRItemList, LIRItemArray)
  
  class SwitchRange: public CompilationResourceObj {
   private:
    int _low_key;
    int _high_key;
--- 37,47 ----
  class LIREmitter;
  class Invoke;
  class SwitchRange;
  class LIRItem;
  
! typedef GrowableArray<LIRItem*> LIRItemList;
  
  class SwitchRange: public CompilationResourceObj {
   private:
    int _low_key;
    int _high_key;
*** 54,72 ****
    int high_key() const { return _high_key; }
    int low_key() const { return _low_key; }
    BlockBegin* sux() const { return _sux; }
  };
  
! define_array(SwitchRangeArray, SwitchRange*)
! define_stack(SwitchRangeList, SwitchRangeArray)
! 
  
  class ResolveNode;
  
! define_array(NodeArray, ResolveNode*);
! define_stack(NodeList, NodeArray);
! 
  
  // Node objects form a directed graph of LIR_Opr
  // Edges between Nodes represent moves from one Node to its destinations
  class ResolveNode: public CompilationResourceObj {
   private:
--- 53,68 ----
    int high_key() const { return _high_key; }
    int low_key() const { return _low_key; }
    BlockBegin* sux() const { return _sux; }
  };
  
! typedef GrowableArray<SwitchRange*> SwitchRangeArray;
! typedef GrowableArray<SwitchRange*> SwitchRangeList;
  
  class ResolveNode;
  
! typedef GrowableArray<ResolveNode*> NodeList;
  
  // Node objects form a directed graph of LIR_Opr
  // Edges between Nodes represent moves from one Node to its destinations
  class ResolveNode: public CompilationResourceObj {
   private:
*** 84,94 ****
      , _start_node(false) {};
  
    // accessors
    LIR_Opr operand() const           { return _operand; }
    int no_of_destinations() const    { return _destinations.length(); }
!   ResolveNode* destination_at(int i)     { return _destinations[i]; }
    bool assigned() const             { return _assigned; }
    bool visited() const              { return _visited; }
    bool start_node() const           { return _start_node; }
  
    // modifiers
--- 80,90 ----
      , _start_node(false) {};
  
    // accessors
    LIR_Opr operand() const           { return _operand; }
    int no_of_destinations() const    { return _destinations.length(); }
!   ResolveNode* destination_at(int i)     { return _destinations.at(i); }
    bool assigned() const             { return _assigned; }
    bool visited() const              { return _visited; }
    bool start_node() const           { return _start_node; }
  
    // modifiers