src/share/vm/opto/rootnode.hpp

changeset 435
a61af66fc99e
child 1907
c18cbe5936b8
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/src/share/vm/opto/rootnode.hpp	Sat Dec 01 00:00:00 2007 +0000
     1.3 @@ -0,0 +1,62 @@
     1.4 +/*
     1.5 + * Copyright 1997-2005 Sun Microsystems, Inc.  All Rights Reserved.
     1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
     1.7 + *
     1.8 + * This code is free software; you can redistribute it and/or modify it
     1.9 + * under the terms of the GNU General Public License version 2 only, as
    1.10 + * published by the Free Software Foundation.
    1.11 + *
    1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT
    1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
    1.14 + * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
    1.15 + * version 2 for more details (a copy is included in the LICENSE file that
    1.16 + * accompanied this code).
    1.17 + *
    1.18 + * You should have received a copy of the GNU General Public License version
    1.19 + * 2 along with this work; if not, write to the Free Software Foundation,
    1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
    1.21 + *
    1.22 + * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
    1.23 + * CA 95054 USA or visit www.sun.com if you need additional information or
    1.24 + * have any questions.
    1.25 + *
    1.26 + */
    1.27 +
    1.28 +//------------------------------RootNode---------------------------------------
    1.29 +// The one-and-only before-all-else and after-all-else RootNode.  The RootNode
    1.30 +// represents what happens if the user runs the whole program repeatedly.  The
    1.31 +// RootNode produces the initial values of I/O and memory for the program or
    1.32 +// procedure start.
    1.33 +class RootNode : public LoopNode {
    1.34 +public:
    1.35 +  RootNode( ) : LoopNode(0,0) {
    1.36 +    init_class_id(Class_Root);
    1.37 +    del_req(2);
    1.38 +    del_req(1);
    1.39 +  }
    1.40 +  virtual int   Opcode() const;
    1.41 +  virtual const Node *is_block_proj() const { return this; }
    1.42 +  virtual const Type *bottom_type() const { return Type::BOTTOM; }
    1.43 +  virtual Node *Identity( PhaseTransform *phase ) { return this; }
    1.44 +  virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
    1.45 +  virtual const Type *Value( PhaseTransform *phase ) const { return Type::BOTTOM; }
    1.46 +};
    1.47 +
    1.48 +//------------------------------HaltNode---------------------------------------
    1.49 +// Throw an exception & die
    1.50 +class HaltNode : public Node {
    1.51 +public:
    1.52 +  HaltNode( Node *ctrl, Node *frameptr );
    1.53 +  virtual int Opcode() const;
    1.54 +  virtual bool  pinned() const { return true; };
    1.55 +  virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
    1.56 +  virtual const Type *Value( PhaseTransform *phase ) const;
    1.57 +  virtual const Type *bottom_type() const;
    1.58 +  virtual bool  is_CFG() const { return true; }
    1.59 +  virtual uint hash() const { return NO_HASH; }  // CFG nodes do not hash
    1.60 +  virtual bool depends_only_on_test() const { return false; }
    1.61 +  virtual const Node *is_block_proj() const { return this; }
    1.62 +  virtual const RegMask &out_RegMask() const;
    1.63 +  virtual uint ideal_reg() const { return NotAMachineReg; }
    1.64 +  virtual uint match_edge(uint idx) const { return 0; }
    1.65 +};

mercurial