duke@435: /*
duke@435:  * Copyright 1997-2005 Sun Microsystems, Inc.  All Rights Reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
duke@435:  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435:  * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435:  * have any questions.
duke@435:  *
duke@435:  */
duke@435: 
duke@435: // Portions of code courtesy of Clifford Click
duke@435: 
duke@435: // Optimization - Graph Style
duke@435: 
duke@435: 
duke@435: //------------------------------DivINode---------------------------------------
duke@435: // Integer division
duke@435: // Note: this is division as defined by JVMS, i.e., MinInt/-1 == MinInt.
duke@435: // On processors which don't naturally support this special case (e.g., x86),
duke@435: // the matcher or runtime system must take care of this.
duke@435: class DivINode : public Node {
duke@435: public:
duke@435:   DivINode( Node *c, Node *dividend, Node *divisor ) : Node(c, dividend, divisor ) {}
duke@435:   virtual int Opcode() const;
duke@435:   virtual Node *Identity( PhaseTransform *phase );
duke@435:   virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435:   virtual const Type *Value( PhaseTransform *phase ) const;
duke@435:   virtual const Type *bottom_type() const { return TypeInt::INT; }
duke@435:   virtual uint ideal_reg() const { return Op_RegI; }
duke@435: };
duke@435: 
duke@435: //------------------------------DivLNode---------------------------------------
duke@435: // Long division
duke@435: class DivLNode : public Node {
duke@435: public:
duke@435:   DivLNode( Node *c, Node *dividend, Node *divisor ) : Node(c, dividend, divisor ) {}
duke@435:   virtual int Opcode() const;
duke@435:   virtual Node *Identity( PhaseTransform *phase );
duke@435:   virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435:   virtual const Type *Value( PhaseTransform *phase ) const;
duke@435:   virtual const Type *bottom_type() const { return TypeLong::LONG; }
duke@435:   virtual uint ideal_reg() const { return Op_RegL; }
duke@435: };
duke@435: 
duke@435: //------------------------------DivFNode---------------------------------------
duke@435: // Float division
duke@435: class DivFNode : public Node {
duke@435: public:
duke@435:   DivFNode( Node *c, Node *dividend, Node *divisor ) : Node(c, dividend, divisor) {}
duke@435:   virtual int Opcode() const;
duke@435:   virtual Node *Identity( PhaseTransform *phase );
duke@435:   virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435:   virtual const Type *Value( PhaseTransform *phase ) const;
duke@435:   virtual const Type *bottom_type() const { return Type::FLOAT; }
duke@435:   virtual uint ideal_reg() const { return Op_RegF; }
duke@435: };
duke@435: 
duke@435: //------------------------------DivDNode---------------------------------------
duke@435: // Double division
duke@435: class DivDNode : public Node {
duke@435: public:
duke@435:   DivDNode( Node *c, Node *dividend, Node *divisor ) : Node(c,dividend, divisor) {}
duke@435:   virtual int Opcode() const;
duke@435:   virtual Node *Identity( PhaseTransform *phase );
duke@435:   virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435:   virtual const Type *Value( PhaseTransform *phase ) const;
duke@435:   virtual const Type *bottom_type() const { return Type::DOUBLE; }
duke@435:   virtual uint ideal_reg() const { return Op_RegD; }
duke@435: };
duke@435: 
duke@435: //------------------------------ModINode---------------------------------------
duke@435: // Integer modulus
duke@435: class ModINode : public Node {
duke@435: public:
duke@435:   ModINode( Node *c, Node *in1, Node *in2 ) : Node(c,in1, in2) {}
duke@435:   virtual int Opcode() const;
duke@435:   virtual const Type *Value( PhaseTransform *phase ) const;
duke@435:   virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435:   virtual const Type *bottom_type() const { return TypeInt::INT; }
duke@435:   virtual uint ideal_reg() const { return Op_RegI; }
duke@435: };
duke@435: 
duke@435: //------------------------------ModLNode---------------------------------------
duke@435: // Long modulus
duke@435: class ModLNode : public Node {
duke@435: public:
duke@435:   ModLNode( Node *c, Node *in1, Node *in2 ) : Node(c,in1, in2) {}
duke@435:   virtual int Opcode() const;
duke@435:   virtual const Type *Value( PhaseTransform *phase ) const;
duke@435:   virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435:   virtual const Type *bottom_type() const { return TypeLong::LONG; }
duke@435:   virtual uint ideal_reg() const { return Op_RegL; }
duke@435: };
duke@435: 
duke@435: //------------------------------ModFNode---------------------------------------
duke@435: // Float Modulus
duke@435: class ModFNode : public Node {
duke@435: public:
duke@435:   ModFNode( Node *c, Node *in1, Node *in2 ) : Node(c,in1, in2) {}
duke@435:   virtual int Opcode() const;
duke@435:   virtual const Type *Value( PhaseTransform *phase ) const;
duke@435:   virtual const Type *bottom_type() const { return Type::FLOAT; }
duke@435:   virtual uint ideal_reg() const { return Op_RegF; }
duke@435: };
duke@435: 
duke@435: //------------------------------ModDNode---------------------------------------
duke@435: // Double Modulus
duke@435: class ModDNode : public Node {
duke@435: public:
duke@435:   ModDNode( Node *c, Node *in1, Node *in2 ) : Node(c, in1, in2) {}
duke@435:   virtual int Opcode() const;
duke@435:   virtual const Type *Value( PhaseTransform *phase ) const;
duke@435:   virtual const Type *bottom_type() const { return Type::DOUBLE; }
duke@435:   virtual uint ideal_reg() const { return Op_RegD; }
duke@435: };
duke@435: 
duke@435: //------------------------------DivModNode---------------------------------------
duke@435: // Division with remainder result.
duke@435: class DivModNode : public MultiNode {
duke@435: protected:
duke@435:   DivModNode( Node *c, Node *dividend, Node *divisor );
duke@435: public:
duke@435:   enum {
duke@435:     div_proj_num =  0,      // quotient
duke@435:     mod_proj_num =  1       // remainder
duke@435:   };
duke@435:   virtual int Opcode() const;
duke@435:   virtual Node *Identity( PhaseTransform *phase ) { return this; }
duke@435:   virtual Node *Ideal(PhaseGVN *phase, bool can_reshape) { return NULL; }
duke@435:   virtual const Type *Value( PhaseTransform *phase ) const { return bottom_type(); }
duke@435:   virtual uint hash() const { return Node::hash(); }
duke@435:   virtual bool is_CFG() const  { return false; }
duke@435:   virtual uint ideal_reg() const { return NotAMachineReg; }
duke@435: 
duke@435:   ProjNode* div_proj() { return proj_out(div_proj_num); }
duke@435:   ProjNode* mod_proj() { return proj_out(mod_proj_num); }
duke@435: };
duke@435: 
duke@435: //------------------------------DivModINode---------------------------------------
duke@435: // Integer division with remainder result.
duke@435: class DivModINode : public DivModNode {
duke@435: public:
duke@435:   DivModINode( Node *c, Node *dividend, Node *divisor ) : DivModNode(c, dividend, divisor) {}
duke@435:   virtual int Opcode() const;
duke@435:   virtual const Type *bottom_type() const { return TypeTuple::INT_PAIR; }
duke@435:   virtual Node *match( const ProjNode *proj, const Matcher *m );
duke@435: 
duke@435:   // Make a divmod and associated projections from a div or mod.
duke@435:   static DivModINode* make(Compile* C, Node* div_or_mod);
duke@435: };
duke@435: 
duke@435: //------------------------------DivModLNode---------------------------------------
duke@435: // Long division with remainder result.
duke@435: class DivModLNode : public DivModNode {
duke@435: public:
duke@435:   DivModLNode( Node *c, Node *dividend, Node *divisor ) : DivModNode(c, dividend, divisor) {}
duke@435:   virtual int Opcode() const;
duke@435:   virtual const Type *bottom_type() const { return TypeTuple::LONG_PAIR; }
duke@435:   virtual Node *match( const ProjNode *proj, const Matcher *m );
duke@435: 
duke@435:   // Make a divmod and associated projections from a div or mod.
duke@435:   static DivModLNode* make(Compile* C, Node* div_or_mod);
duke@435: };