< prev index next >

src/share/vm/opto/mulnode.hpp

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,7 **** /* ! * Copyright (c) 1997, 2012, 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) 1997, 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.
*** 73,82 **** --- 73,85 ---- virtual int add_opcode() const = 0; // Supplied function to return the multiplicative opcode virtual int mul_opcode() const = 0; + #ifndef PRODUCT + REL_IN_DATA_OUT_1; + #endif }; //------------------------------MulINode--------------------------------------- // Multiply 2 integers class MulINode : public MulNode {
*** 147,156 **** --- 150,163 ---- MulHiLNode( Node *in1, Node *in2 ) : Node(0,in1,in2) {} virtual int Opcode() const; virtual const Type *Value( PhaseTransform *phase ) const; const Type *bottom_type() const { return TypeLong::LONG; } virtual uint ideal_reg() const { return Op_RegL; } + + #ifndef PRODUCT + REL_IN_DATA_OUT_1; + #endif }; //------------------------------AndINode--------------------------------------- // Logically AND 2 integers. Included with the MUL nodes because it inherits // all the behavior of multiplication on a ring.
*** 194,203 **** --- 201,214 ---- virtual Node *Identity( PhaseTransform *phase ); virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); virtual const Type *Value( PhaseTransform *phase ) const; const Type *bottom_type() const { return TypeInt::INT; } virtual uint ideal_reg() const { return Op_RegI; } + + #ifndef PRODUCT + REL_IN_DATA_OUT_1; + #endif }; //------------------------------LShiftLNode------------------------------------ // Logical shift left class LShiftLNode : public Node {
*** 207,216 **** --- 218,231 ---- virtual Node *Identity( PhaseTransform *phase ); virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); virtual const Type *Value( PhaseTransform *phase ) const; const Type *bottom_type() const { return TypeLong::LONG; } virtual uint ideal_reg() const { return Op_RegL; } + + #ifndef PRODUCT + REL_IN_DATA_OUT_1; + #endif }; //------------------------------RShiftINode------------------------------------ // Signed shift right class RShiftINode : public Node {
*** 220,229 **** --- 235,248 ---- virtual Node *Identity( PhaseTransform *phase ); virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); virtual const Type *Value( PhaseTransform *phase ) const; const Type *bottom_type() const { return TypeInt::INT; } virtual uint ideal_reg() const { return Op_RegI; } + + #ifndef PRODUCT + REL_IN_DATA_OUT_1; + #endif }; //------------------------------RShiftLNode------------------------------------ // Signed shift right class RShiftLNode : public Node {
*** 232,241 **** --- 251,264 ---- virtual int Opcode() const; virtual Node *Identity( PhaseTransform *phase ); virtual const Type *Value( PhaseTransform *phase ) const; const Type *bottom_type() const { return TypeLong::LONG; } virtual uint ideal_reg() const { return Op_RegL; } + + #ifndef PRODUCT + REL_IN_DATA_OUT_1; + #endif }; //------------------------------URShiftINode----------------------------------- // Logical shift right
*** 246,255 **** --- 269,282 ---- virtual Node *Identity( PhaseTransform *phase ); virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); virtual const Type *Value( PhaseTransform *phase ) const; const Type *bottom_type() const { return TypeInt::INT; } virtual uint ideal_reg() const { return Op_RegI; } + + #ifndef PRODUCT + REL_IN_DATA_OUT_1; + #endif }; //------------------------------URShiftLNode----------------------------------- // Logical shift right class URShiftLNode : public Node {
*** 259,266 **** --- 286,297 ---- virtual Node *Identity( PhaseTransform *phase ); virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); virtual const Type *Value( PhaseTransform *phase ) const; const Type *bottom_type() const { return TypeLong::LONG; } virtual uint ideal_reg() const { return Op_RegL; } + + #ifndef PRODUCT + REL_IN_DATA_OUT_1; + #endif }; #endif // SHARE_VM_OPTO_MULNODE_HPP
< prev index next >