< prev index next >

src/share/vm/opto/rootnode.cpp

Print this page
rev 8739 : 8004073: Implement C2 Ideal node specific dump() method
Summary: add Node::dump_rel() to dump a node and its related nodes (the notion of "related" depends on the node at hand); add Node::dump_comp() to dump a node in compact representation; add Node::dump_rel_comp() to dump a node and its related nodes in compact representation; add the required machinery; extend some C2 IR nodes with compact and related dumping
Reviewed-by:
   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  *


  71   init_req(TypeFunc::ReturnAdr,top);
  72 }
  73 
  74 const Type *HaltNode::bottom_type() const { return Type::BOTTOM; }
  75 
  76 //------------------------------Ideal------------------------------------------
  77 Node *HaltNode::Ideal(PhaseGVN *phase, bool can_reshape) {
  78   return remove_dead_region(phase, can_reshape) ? this : NULL;
  79 }
  80 
  81 //------------------------------Value------------------------------------------
  82 const Type *HaltNode::Value( PhaseTransform *phase ) const {
  83   return ( phase->type(in(TypeFunc::Control)) == Type::TOP)
  84     ? Type::TOP
  85     : Type::BOTTOM;
  86 }
  87 
  88 const RegMask &HaltNode::out_RegMask() const {
  89   return RegMask::Empty;
  90 }















   1 /*
   2  * Copyright (c) 1997, 2015, 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  *


  71   init_req(TypeFunc::ReturnAdr,top);
  72 }
  73 
  74 const Type *HaltNode::bottom_type() const { return Type::BOTTOM; }
  75 
  76 //------------------------------Ideal------------------------------------------
  77 Node *HaltNode::Ideal(PhaseGVN *phase, bool can_reshape) {
  78   return remove_dead_region(phase, can_reshape) ? this : NULL;
  79 }
  80 
  81 //------------------------------Value------------------------------------------
  82 const Type *HaltNode::Value( PhaseTransform *phase ) const {
  83   return ( phase->type(in(TypeFunc::Control)) == Type::TOP)
  84     ? Type::TOP
  85     : Type::BOTTOM;
  86 }
  87 
  88 const RegMask &HaltNode::out_RegMask() const {
  89   return RegMask::Empty;
  90 }
  91 
  92 #ifndef PRODUCT
  93 //-------------------------------rel-------------------------------------------
  94 // Include all control inputs in the related set, and also the input data
  95 // boundary. In compact mode, include all inputs till level 2. Also include
  96 // all outputs at level 1.
  97 void HaltNode::rel(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const {
  98   if (compact) {
  99     this->collect_nodes(in_rel, 2, false, false);
 100   } else {
 101     this->collect_nodes_in_all_ctrl(in_rel, true);
 102   }
 103   this->collect_nodes(out_rel, -1, false, false);
 104 }
 105 #endif
< prev index next >