• file
• revisions
• annotate
• diff
• comparison
• raw

src/share/vm/opto/mathexactnode.hpp@fd13a567f179 (annotated)

src/share/vm/opto/mathexactnode.hpp

Thu, 24 May 2018 19:26:50 +0800

author

aoqi

date

Thu, 24 May 2018 19:26:50 +0800

changeset 8862

fd13a567f179

parent 6876

710a3c8b516e

permissions

-rw-r--r--

#7046 C2 supports long branch
Contributed-by: fujie

aoqi@0	1	/*
aoqi@0	2	* Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved.
aoqi@0	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0	4	*
aoqi@0	5	* This code is free software; you can redistribute it and/or modify it
aoqi@0	6	* under the terms of the GNU General Public License version 2 only, as
aoqi@0	7	* published by the Free Software Foundation.
aoqi@0	8	*
aoqi@0	9	* This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
aoqi@0	12	* version 2 for more details (a copy is included in the LICENSE file that
aoqi@0	13	* accompanied this code).
aoqi@0	14	*
aoqi@0	15	* You should have received a copy of the GNU General Public License version
aoqi@0	16	* 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0	18	*
aoqi@0	19	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0	20	* or visit www.oracle.com if you need additional information or have any
aoqi@0	21	* questions.
aoqi@0	22	*
aoqi@0	23	*/
aoqi@0	24
aoqi@0	25	#ifndef SHARE_VM_OPTO_MATHEXACTNODE_HPP
aoqi@0	26	#define SHARE_VM_OPTO_MATHEXACTNODE_HPP
aoqi@0	27
aoqi@0	28	#include "opto/multnode.hpp"
aoqi@0	29	#include "opto/node.hpp"
aoqi@0	30	#include "opto/addnode.hpp"
aoqi@0	31	#include "opto/subnode.hpp"
aoqi@0	32	#include "opto/type.hpp"
aoqi@0	33
aoqi@0	34	class PhaseGVN;
aoqi@0	35	class PhaseTransform;
aoqi@0	36
aoqi@0	37	class OverflowNode : public CmpNode {
aoqi@0	38	public:
aoqi@0	39	OverflowNode(Node* in1, Node* in2) : CmpNode(in1, in2) {}
aoqi@0	40
aoqi@0	41	virtual uint ideal_reg() const { return Op_RegFlags; }
aoqi@0	42	virtual const Type* sub(const Type* t1, const Type* t2) const;
aoqi@0	43	};
aoqi@0	44
aoqi@0	45	class OverflowINode : public OverflowNode {
aoqi@0	46	public:
aoqi@0	47	typedef TypeInt TypeClass;
aoqi@0	48
aoqi@0	49	OverflowINode(Node* in1, Node* in2) : OverflowNode(in1, in2) {}
aoqi@0	50	virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
aoqi@0	51	virtual const Type* Value(PhaseTransform* phase) const;
aoqi@0	52
aoqi@0	53	virtual bool will_overflow(jint v1, jint v2) const = 0;
aoqi@0	54	virtual bool can_overflow(const Type* t1, const Type* t2) const = 0;
aoqi@0	55	};
aoqi@0	56
aoqi@0	57
aoqi@0	58	class OverflowLNode : public OverflowNode {
aoqi@0	59	public:
aoqi@0	60	typedef TypeLong TypeClass;
aoqi@0	61
aoqi@0	62	OverflowLNode(Node* in1, Node* in2) : OverflowNode(in1, in2) {}
aoqi@0	63	virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
aoqi@0	64	virtual const Type* Value(PhaseTransform* phase) const;
aoqi@0	65
aoqi@0	66	virtual bool will_overflow(jlong v1, jlong v2) const = 0;
aoqi@0	67	virtual bool can_overflow(const Type* t1, const Type* t2) const = 0;
aoqi@0	68	};
aoqi@0	69
aoqi@0	70	class OverflowAddINode : public OverflowINode {
aoqi@0	71	public:
aoqi@0	72	typedef AddINode MathOp;
aoqi@0	73
aoqi@0	74	OverflowAddINode(Node* in1, Node* in2) : OverflowINode(in1, in2) {}
aoqi@0	75	virtual int Opcode() const;
aoqi@0	76
aoqi@0	77	virtual bool will_overflow(jint v1, jint v2) const;
aoqi@0	78	virtual bool can_overflow(const Type* t1, const Type* t2) const;
aoqi@0	79	};
aoqi@0	80
aoqi@0	81	class OverflowSubINode : public OverflowINode {
aoqi@0	82	public:
aoqi@0	83	typedef SubINode MathOp;
aoqi@0	84
aoqi@0	85	OverflowSubINode(Node* in1, Node* in2) : OverflowINode(in1, in2) {}
aoqi@0	86	virtual int Opcode() const;
aoqi@0	87
aoqi@0	88	virtual bool will_overflow(jint v1, jint v2) const;
aoqi@0	89	virtual bool can_overflow(const Type* t1, const Type* t2) const;
aoqi@0	90	};
aoqi@0	91
aoqi@0	92	class OverflowMulINode : public OverflowINode {
aoqi@0	93	public:
aoqi@0	94	typedef MulINode MathOp;
aoqi@0	95
aoqi@0	96	OverflowMulINode(Node* in1, Node* in2) : OverflowINode(in1, in2) {}
aoqi@0	97	virtual int Opcode() const;
aoqi@0	98
aoqi@0	99	virtual bool will_overflow(jint v1, jint v2) const;
aoqi@0	100	virtual bool can_overflow(const Type* t1, const Type* t2) const;
aoqi@0	101	};
aoqi@0	102
aoqi@0	103	class OverflowAddLNode : public OverflowLNode {
aoqi@0	104	public:
aoqi@0	105	typedef AddLNode MathOp;
aoqi@0	106
aoqi@0	107	OverflowAddLNode(Node* in1, Node* in2) : OverflowLNode(in1, in2) {}
aoqi@0	108	virtual int Opcode() const;
aoqi@0	109
aoqi@0	110	virtual bool will_overflow(jlong v1, jlong v2) const;
aoqi@0	111	virtual bool can_overflow(const Type* t1, const Type* t2) const;
aoqi@0	112	};
aoqi@0	113
aoqi@0	114	class OverflowSubLNode : public OverflowLNode {
aoqi@0	115	public:
aoqi@0	116	typedef SubLNode MathOp;
aoqi@0	117
aoqi@0	118	OverflowSubLNode(Node* in1, Node* in2) : OverflowLNode(in1, in2) {}
aoqi@0	119	virtual int Opcode() const;
aoqi@0	120
aoqi@0	121	virtual bool will_overflow(jlong v1, jlong v2) const;
aoqi@0	122	virtual bool can_overflow(const Type* t1, const Type* t2) const;
aoqi@0	123	};
aoqi@0	124
aoqi@0	125	class OverflowMulLNode : public OverflowLNode {
aoqi@0	126	public:
aoqi@0	127	typedef MulLNode MathOp;
aoqi@0	128
aoqi@0	129	OverflowMulLNode(Node* in1, Node* in2) : OverflowLNode(in1, in2) {}
aoqi@0	130	virtual int Opcode() const;
aoqi@0	131
aoqi@0	132	virtual bool will_overflow(jlong v1, jlong v2) const;
aoqi@0	133	virtual bool can_overflow(const Type* t1, const Type* t2) const;
aoqi@0	134	};
aoqi@0	135
aoqi@0	136	#endif
aoqi@0	137