1 /*
   2  * Copyright (c) 1997, 2009, 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 // Portions of code courtesy of Clifford Click
  26 
  27 // Optimization - Graph Style
  28 
  29 #include "incls/_precompiled.incl"
  30 #include "incls/_callnode.cpp.incl"
  31 
  32 //=============================================================================
  33 uint StartNode::size_of() const { return sizeof(*this); }
  34 uint StartNode::cmp( const Node &n ) const
  35 { return _domain == ((StartNode&)n)._domain; }
  36 const Type *StartNode::bottom_type() const { return _domain; }
  37 const Type *StartNode::Value(PhaseTransform *phase) const { return _domain; }
  38 #ifndef PRODUCT
  39 void StartNode::dump_spec(outputStream *st) const { st->print(" #"); _domain->dump_on(st);}
  40 #endif
  41 
  42 //------------------------------Ideal------------------------------------------
  43 Node *StartNode::Ideal(PhaseGVN *phase, bool can_reshape){
  44   return remove_dead_region(phase, can_reshape) ? this : NULL;
  45 }
  46 
  47 //------------------------------calling_convention-----------------------------
  48 void StartNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const {
  49   Matcher::calling_convention( sig_bt, parm_regs, argcnt, false );
  50 }
  51 

   1 /*
   2  * Copyright (c) 1997, 2010, 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 #include "precompiled.hpp"
  26 #include "ci/bcEscapeAnalyzer.hpp"
  27 #include "compiler/oopMap.hpp"
  28 #include "opto/callnode.hpp"
  29 #include "opto/escape.hpp"
  30 #include "opto/locknode.hpp"
  31 #include "opto/machnode.hpp"
  32 #include "opto/matcher.hpp"
  33 #include "opto/parse.hpp"
  34 #include "opto/regalloc.hpp"
  35 #include "opto/regmask.hpp"
  36 #include "opto/rootnode.hpp"
  37 #include "opto/runtime.hpp"
  38 
  39 // Portions of code courtesy of Clifford Click
  40 
  41 // Optimization - Graph Style
  42 



  43 //=============================================================================
  44 uint StartNode::size_of() const { return sizeof(*this); }
  45 uint StartNode::cmp( const Node &n ) const
  46 { return _domain == ((StartNode&)n)._domain; }
  47 const Type *StartNode::bottom_type() const { return _domain; }
  48 const Type *StartNode::Value(PhaseTransform *phase) const { return _domain; }
  49 #ifndef PRODUCT
  50 void StartNode::dump_spec(outputStream *st) const { st->print(" #"); _domain->dump_on(st);}
  51 #endif
  52 
  53 //------------------------------Ideal------------------------------------------
  54 Node *StartNode::Ideal(PhaseGVN *phase, bool can_reshape){
  55   return remove_dead_region(phase, can_reshape) ? this : NULL;
  56 }
  57 
  58 //------------------------------calling_convention-----------------------------
  59 void StartNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const {
  60   Matcher::calling_convention( sig_bt, parm_regs, argcnt, false );
  61 }
  62