|
23528
|
1 |
/*
|
|
33628
|
2 |
* Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved.
|
|
23528
|
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 |
*
|
|
|
23 |
*/
|
|
|
24 |
|
|
|
25 |
#ifndef SHARE_VM_OPTO_INTRINSICNODE_HPP
|
|
|
26 |
#define SHARE_VM_OPTO_INTRINSICNODE_HPP
|
|
|
27 |
|
|
|
28 |
#include "opto/node.hpp"
|
|
|
29 |
#include "opto/opcodes.hpp"
|
|
|
30 |
|
|
|
31 |
|
|
|
32 |
//----------------------PartialSubtypeCheckNode--------------------------------
|
|
|
33 |
// The 2nd slow-half of a subtype check. Scan the subklass's 2ndary superklass
|
|
|
34 |
// array for an instance of the superklass. Set a hidden internal cache on a
|
|
|
35 |
// hit (cache is checked with exposed code in gen_subtype_check()). Return
|
|
|
36 |
// not zero for a miss or zero for a hit.
|
|
|
37 |
class PartialSubtypeCheckNode : public Node {
|
|
33628
|
38 |
public:
|
|
23528
|
39 |
PartialSubtypeCheckNode(Node* c, Node* sub, Node* super) : Node(c,sub,super) {}
|
|
|
40 |
virtual int Opcode() const;
|
|
33628
|
41 |
virtual const Type* bottom_type() const { return TypeRawPtr::BOTTOM; }
|
|
23528
|
42 |
virtual uint ideal_reg() const { return Op_RegP; }
|
|
|
43 |
};
|
|
|
44 |
|
|
|
45 |
//------------------------------StrIntrinsic-------------------------------
|
|
33628
|
46 |
// Base class for Ideal nodes used in String intrinsic code.
|
|
23528
|
47 |
class StrIntrinsicNode: public Node {
|
|
33628
|
48 |
public:
|
|
|
49 |
// Possible encodings of the two parameters passed to the string intrinsic.
|
|
|
50 |
// 'L' stands for Latin1 and 'U' stands for UTF16. For example, 'LU' means that
|
|
|
51 |
// the first string is Latin1 encoded and the second string is UTF16 encoded.
|
|
|
52 |
typedef enum ArgEncoding { LL, LU, UL, UU, none } ArgEnc;
|
|
|
53 |
|
|
|
54 |
protected:
|
|
|
55 |
// Encoding of strings. Used to select the right version of the intrinsic.
|
|
|
56 |
const ArgEncoding _encoding;
|
|
|
57 |
virtual uint size_of() const;
|
|
|
58 |
|
|
|
59 |
public:
|
|
23528
|
60 |
StrIntrinsicNode(Node* control, Node* char_array_mem,
|
|
33628
|
61 |
Node* s1, Node* c1, Node* s2, Node* c2, ArgEncoding encoding):
|
|
|
62 |
Node(control, char_array_mem, s1, c1, s2, c2), _encoding(encoding) {
|
|
23528
|
63 |
}
|
|
|
64 |
|
|
|
65 |
StrIntrinsicNode(Node* control, Node* char_array_mem,
|
|
33628
|
66 |
Node* s1, Node* s2, Node* c, ArgEncoding encoding):
|
|
|
67 |
Node(control, char_array_mem, s1, s2, c), _encoding(encoding) {
|
|
23528
|
68 |
}
|
|
|
69 |
|
|
|
70 |
StrIntrinsicNode(Node* control, Node* char_array_mem,
|
|
33628
|
71 |
Node* s1, Node* s2, ArgEncoding encoding):
|
|
|
72 |
Node(control, char_array_mem, s1, s2), _encoding(encoding) {
|
|
23528
|
73 |
}
|
|
|
74 |
|
|
|
75 |
virtual bool depends_only_on_test() const { return false; }
|
|
33628
|
76 |
virtual const TypePtr* adr_type() const { return TypeAryPtr::BYTES; }
|
|
23528
|
77 |
virtual uint match_edge(uint idx) const;
|
|
|
78 |
virtual uint ideal_reg() const { return Op_RegI; }
|
|
33628
|
79 |
virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
|
|
|
80 |
virtual const Type* Value(PhaseTransform* phase) const;
|
|
|
81 |
ArgEncoding encoding() const { return _encoding; }
|
|
23528
|
82 |
};
|
|
|
83 |
|
|
|
84 |
//------------------------------StrComp-------------------------------------
|
|
|
85 |
class StrCompNode: public StrIntrinsicNode {
|
|
33628
|
86 |
public:
|
|
23528
|
87 |
StrCompNode(Node* control, Node* char_array_mem,
|
|
33628
|
88 |
Node* s1, Node* c1, Node* s2, Node* c2, ArgEncoding encoding):
|
|
|
89 |
StrIntrinsicNode(control, char_array_mem, s1, c1, s2, c2, encoding) {};
|
|
23528
|
90 |
virtual int Opcode() const;
|
|
|
91 |
virtual const Type* bottom_type() const { return TypeInt::INT; }
|
|
|
92 |
};
|
|
|
93 |
|
|
|
94 |
//------------------------------StrEquals-------------------------------------
|
|
|
95 |
class StrEqualsNode: public StrIntrinsicNode {
|
|
33628
|
96 |
public:
|
|
23528
|
97 |
StrEqualsNode(Node* control, Node* char_array_mem,
|
|
33628
|
98 |
Node* s1, Node* s2, Node* c, ArgEncoding encoding):
|
|
|
99 |
StrIntrinsicNode(control, char_array_mem, s1, s2, c, encoding) {};
|
|
23528
|
100 |
virtual int Opcode() const;
|
|
|
101 |
virtual const Type* bottom_type() const { return TypeInt::BOOL; }
|
|
|
102 |
};
|
|
|
103 |
|
|
|
104 |
//------------------------------StrIndexOf-------------------------------------
|
|
|
105 |
class StrIndexOfNode: public StrIntrinsicNode {
|
|
33628
|
106 |
public:
|
|
23528
|
107 |
StrIndexOfNode(Node* control, Node* char_array_mem,
|
|
33628
|
108 |
Node* s1, Node* c1, Node* s2, Node* c2, ArgEncoding encoding):
|
|
|
109 |
StrIntrinsicNode(control, char_array_mem, s1, c1, s2, c2, encoding) {};
|
|
|
110 |
virtual int Opcode() const;
|
|
|
111 |
virtual const Type* bottom_type() const { return TypeInt::INT; }
|
|
|
112 |
};
|
|
|
113 |
|
|
|
114 |
//------------------------------StrIndexOfChar-------------------------------------
|
|
|
115 |
class StrIndexOfCharNode: public StrIntrinsicNode {
|
|
|
116 |
public:
|
|
|
117 |
StrIndexOfCharNode(Node* control, Node* char_array_mem,
|
|
|
118 |
Node* s1, Node* c1, Node* c, ArgEncoding encoding):
|
|
|
119 |
StrIntrinsicNode(control, char_array_mem, s1, c1, c, encoding) {};
|
|
23528
|
120 |
virtual int Opcode() const;
|
|
|
121 |
virtual const Type* bottom_type() const { return TypeInt::INT; }
|
|
|
122 |
};
|
|
|
123 |
|
|
33628
|
124 |
//--------------------------StrCompressedCopy-------------------------------
|
|
|
125 |
class StrCompressedCopyNode: public StrIntrinsicNode {
|
|
|
126 |
public:
|
|
|
127 |
StrCompressedCopyNode(Node* control, Node* arymem,
|
|
|
128 |
Node* s1, Node* s2, Node* c):
|
|
|
129 |
StrIntrinsicNode(control, arymem, s1, s2, c, none) {};
|
|
|
130 |
virtual int Opcode() const;
|
|
|
131 |
virtual const Type* bottom_type() const { return TypeInt::INT; }
|
|
|
132 |
virtual const TypePtr* adr_type() const { return TypePtr::BOTTOM; }
|
|
|
133 |
virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
|
|
|
134 |
};
|
|
|
135 |
|
|
|
136 |
//--------------------------StrInflatedCopy---------------------------------
|
|
|
137 |
class StrInflatedCopyNode: public StrIntrinsicNode {
|
|
|
138 |
public:
|
|
|
139 |
StrInflatedCopyNode(Node* control, Node* arymem,
|
|
|
140 |
Node* s1, Node* s2, Node* c):
|
|
|
141 |
StrIntrinsicNode(control, arymem, s1, s2, c, none) {};
|
|
|
142 |
virtual int Opcode() const;
|
|
|
143 |
virtual const Type* bottom_type() const { return Type::MEMORY; }
|
|
|
144 |
virtual const TypePtr* adr_type() const { return TypePtr::BOTTOM; }
|
|
|
145 |
virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
|
|
|
146 |
};
|
|
|
147 |
|
|
23528
|
148 |
//------------------------------AryEq---------------------------------------
|
|
|
149 |
class AryEqNode: public StrIntrinsicNode {
|
|
33628
|
150 |
public:
|
|
|
151 |
AryEqNode(Node* control, Node* char_array_mem,
|
|
|
152 |
Node* s1, Node* s2, ArgEncoding encoding):
|
|
|
153 |
StrIntrinsicNode(control, char_array_mem, s1, s2, encoding) {};
|
|
|
154 |
virtual int Opcode() const;
|
|
|
155 |
virtual const Type* bottom_type() const { return TypeInt::BOOL; }
|
|
|
156 |
};
|
|
|
157 |
|
|
|
158 |
//------------------------------HasNegatives---------------------------------
|
|
|
159 |
class HasNegativesNode: public StrIntrinsicNode {
|
|
|
160 |
public:
|
|
|
161 |
HasNegativesNode(Node* control, Node* char_array_mem, Node* s1, Node* c1):
|
|
|
162 |
StrIntrinsicNode(control, char_array_mem, s1, c1, none) {};
|
|
23528
|
163 |
virtual int Opcode() const;
|
|
|
164 |
virtual const Type* bottom_type() const { return TypeInt::BOOL; }
|
|
|
165 |
};
|
|
|
166 |
|
|
|
167 |
|
|
|
168 |
//------------------------------EncodeISOArray--------------------------------
|
|
|
169 |
// encode char[] to byte[] in ISO_8859_1
|
|
|
170 |
class EncodeISOArrayNode: public Node {
|
|
33628
|
171 |
public:
|
|
|
172 |
EncodeISOArrayNode(Node* control, Node* arymem, Node* s1, Node* s2, Node* c): Node(control, arymem, s1, s2, c) {};
|
|
23528
|
173 |
virtual int Opcode() const;
|
|
|
174 |
virtual bool depends_only_on_test() const { return false; }
|
|
|
175 |
virtual const Type* bottom_type() const { return TypeInt::INT; }
|
|
|
176 |
virtual const TypePtr* adr_type() const { return TypePtr::BOTTOM; }
|
|
|
177 |
virtual uint match_edge(uint idx) const;
|
|
|
178 |
virtual uint ideal_reg() const { return Op_RegI; }
|
|
33628
|
179 |
virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
|
|
|
180 |
virtual const Type* Value(PhaseTransform* phase) const;
|
|
23528
|
181 |
};
|
|
|
182 |
|
|
|
183 |
#endif // SHARE_VM_OPTO_INTRINSICNODE_HPP
|