1 /*
2 * Copyright (c) 1997, 2026, 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 *
23 */
24
25 #ifndef SHARE_OPTO_SUBNODE_HPP
26 #define SHARE_OPTO_SUBNODE_HPP
27
28 #include "opto/node.hpp"
29 #include "opto/opcodes.hpp"
30 #include "opto/type.hpp"
31
32 // Portions of code courtesy of Clifford Click
33
34 //------------------------------SUBNode----------------------------------------
35 // Class SUBTRACTION functionality. This covers all the usual 'subtract'
36 // behaviors. Subtract-integer, -float, -double, binary xor, compare-integer,
37 // -float, and -double are all inherited from this class. The compare
38 // functions behave like subtract functions, except that all negative answers
39 // are compressed into -1, and all positive answers compressed to 1.
40 class SubNode : public Node {
41 public:
42 SubNode( Node *in1, Node *in2 ) : Node(nullptr,in1,in2) {
43 init_class_id(Class_Sub);
44 }
45
46 // Handle algebraic identities here. If we have an identity, return the Node
47 // we are equivalent to. We look for "add of zero" as an identity.
48 virtual Node* Identity(PhaseGVN* phase);
49
50 // Compute a new Type for this node. Basically we just do the pre-check,
51 // then call the virtual add() to set the type.
52 virtual const Type* Value(PhaseGVN* phase) const;
53 const Type* Value_common(PhaseValues* phase) const;
54
55 // Supplied function returns the subtractend of the inputs.
56 // This also type-checks the inputs for sanity. Guaranteed never to
57 // be passed a TOP or BOTTOM type, these are filtered out by a pre-check.
58 virtual const Type *sub( const Type *, const Type * ) const = 0;
59
60 // Supplied function to return the additive identity type.
61 // This is returned whenever the subtracts inputs are the same.
62 virtual const Type *add_id() const = 0;
63
64 static SubNode* make(Node* in1, Node* in2, BasicType bt);
65 };
66
67
68 // NOTE: SubINode should be taken away and replaced by add and negate
69 //------------------------------SubINode---------------------------------------
70 // Subtract 2 integers
71 class SubINode : public SubNode {
72 public:
73 SubINode( Node *in1, Node *in2 ) : SubNode(in1,in2) {}
74 virtual int Opcode() const;
75 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
76 virtual const Type *sub( const Type *, const Type * ) const;
77 const Type *add_id() const { return TypeInt::ZERO; }
78 const Type *bottom_type() const { return TypeInt::INT; }
79 virtual uint ideal_reg() const { return Op_RegI; }
80 };
81
82 //------------------------------SubLNode---------------------------------------
83 // Subtract 2 integers
84 class SubLNode : public SubNode {
85 public:
86 SubLNode( Node *in1, Node *in2 ) : SubNode(in1,in2) {}
87 virtual int Opcode() const;
88 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
89 virtual const Type *sub( const Type *, const Type * ) const;
90 const Type *add_id() const { return TypeLong::ZERO; }
91 const Type *bottom_type() const { return TypeLong::LONG; }
92 virtual uint ideal_reg() const { return Op_RegL; }
93 };
94
95 // NOTE: SubFPNode should be taken away and replaced by add and negate
96 //------------------------------SubFPNode--------------------------------------
97 // Subtract 2 floats or doubles
98 class SubFPNode : public SubNode {
99 protected:
100 SubFPNode( Node *in1, Node *in2 ) : SubNode(in1,in2) {}
101 public:
102 const Type* Value(PhaseGVN* phase) const;
103 };
104
105 // NOTE: SubFNode should be taken away and replaced by add and negate
106 //------------------------------SubFNode---------------------------------------
107 // Subtract 2 doubles
108 class SubFNode : public SubFPNode {
109 public:
110 SubFNode( Node *in1, Node *in2 ) : SubFPNode(in1,in2) {}
111 virtual int Opcode() const;
112 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
113 virtual const Type *sub( const Type *, const Type * ) const;
114 const Type *add_id() const { return TypeF::ZERO; }
115 const Type *bottom_type() const { return Type::FLOAT; }
116 virtual uint ideal_reg() const { return Op_RegF; }
117 };
118
119 // NOTE: SubDNode should be taken away and replaced by add and negate
120 //------------------------------SubDNode---------------------------------------
121 // Subtract 2 doubles
122 class SubDNode : public SubFPNode {
123 public:
124 SubDNode( Node *in1, Node *in2 ) : SubFPNode(in1,in2) {}
125 virtual int Opcode() const;
126 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
127 virtual const Type *sub( const Type *, const Type * ) const;
128 const Type *add_id() const { return TypeD::ZERO; }
129 const Type *bottom_type() const { return Type::DOUBLE; }
130 virtual uint ideal_reg() const { return Op_RegD; }
131 };
132
133 //------------------------------SubHFNode--------------------------------------
134 // Subtract 2 half floats
135 class SubHFNode : public SubFPNode {
136 public:
137 SubHFNode(Node* in1, Node* in2) : SubFPNode(in1, in2) {}
138 virtual int Opcode() const;
139 virtual const Type* sub(const Type*, const Type*) const;
140 const Type* add_id() const { return TypeH::ZERO; }
141 const Type* bottom_type() const { return Type::HALF_FLOAT; }
142 virtual uint ideal_reg() const { return Op_RegF; }
143 };
144
145 //------------------------------CmpNode---------------------------------------
146 // Compare 2 values, returning condition codes (-1, 0 or 1).
147 class CmpNode : public SubNode {
148 public:
149 CmpNode( Node *in1, Node *in2 ) : SubNode(in1,in2) {
150 init_class_id(Class_Cmp);
151 }
152 virtual Node* Identity(PhaseGVN* phase);
153 const Type *add_id() const { return TypeInt::ZERO; }
154 const Type *bottom_type() const { return TypeInt::CC; }
155 virtual uint ideal_reg() const { return Op_RegFlags; }
156
157 static CmpNode *make(Node *in1, Node *in2, BasicType bt, bool unsigned_comp = false);
158 };
159
160 //------------------------------CmpINode---------------------------------------
161 // Compare 2 signed values, returning condition codes (-1, 0 or 1).
162 class CmpINode : public CmpNode {
163 public:
164 CmpINode( Node *in1, Node *in2 ) : CmpNode(in1,in2) {}
165 virtual int Opcode() const;
166 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
167 virtual const Type *sub( const Type *, const Type * ) const;
168 virtual const Type* Value(PhaseGVN* phase) const;
169 };
170
171 //------------------------------CmpUNode---------------------------------------
172 // Compare 2 unsigned values (integer or pointer), returning condition codes (-1, 0 or 1).
173 class CmpUNode : public CmpNode {
174 public:
175 CmpUNode( Node *in1, Node *in2 ) : CmpNode(in1,in2) {}
176 virtual int Opcode() const;
177 virtual const Type *sub( const Type *, const Type * ) const;
178 const Type* Value(PhaseGVN* phase) const;
179 bool is_index_range_check() const;
180 };
181
182 //------------------------------CmpU3Node--------------------------------------
183 // Compare 2 unsigned values, returning integer value (-1, 0 or 1).
184 class CmpU3Node : public CmpUNode {
185 public:
186 CmpU3Node( Node *in1, Node *in2 ) : CmpUNode(in1,in2) {
187 // Since it is not consumed by Bools, it is not really a Cmp.
188 init_class_id(Class_Sub);
189 }
190 virtual int Opcode() const;
191 virtual uint ideal_reg() const { return Op_RegI; }
192 };
193
194 //------------------------------CmpPNode---------------------------------------
195 // Compare 2 pointer values, returning condition codes (-1, 0 or 1).
196 class CmpPNode : public CmpNode {
197 public:
198 CmpPNode( Node *in1, Node *in2 ) : CmpNode(in1,in2) {}
199 virtual int Opcode() const;
200 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
201 virtual const Type* Value(PhaseGVN* phase) const;
202 virtual const Type *sub( const Type *, const Type * ) const;
203 };
204
205 //------------------------------CmpNNode--------------------------------------
206 // Compare 2 narrow oop values, returning condition codes (-1, 0 or 1).
207 class CmpNNode : public CmpNode {
208 public:
209 CmpNNode( Node *in1, Node *in2 ) : CmpNode(in1,in2) {}
210 virtual int Opcode() const;
211 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
212 virtual const Type *sub( const Type *, const Type * ) const;
213 };
214
215 //------------------------------CmpLNode---------------------------------------
216 // Compare 2 long values, returning condition codes (-1, 0 or 1).
217 class CmpLNode : public CmpNode {
218 public:
219 CmpLNode( Node *in1, Node *in2 ) : CmpNode(in1,in2) {}
220 virtual int Opcode() const;
221 virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
222 virtual const Type *sub( const Type *, const Type * ) const;
223 };
224
225 //------------------------------CmpULNode---------------------------------------
226 // Compare 2 unsigned long values, returning condition codes (-1, 0 or 1).
227 class CmpULNode : public CmpNode {
228 public:
229 CmpULNode(Node* in1, Node* in2) : CmpNode(in1, in2) { }
230 virtual int Opcode() const;
231 virtual const Type* sub(const Type*, const Type*) const;
232 };
233
234 //------------------------------CmpL3Node--------------------------------------
235 // Compare 2 long values, returning integer value (-1, 0 or 1).
236 class CmpL3Node : public CmpLNode {
237 public:
238 CmpL3Node( Node *in1, Node *in2 ) : CmpLNode(in1,in2) {
239 // Since it is not consumed by Bools, it is not really a Cmp.
240 init_class_id(Class_Sub);
241 }
242 virtual int Opcode() const;
243 virtual uint ideal_reg() const { return Op_RegI; }
244 };
245
246 //------------------------------CmpUL3Node-------------------------------------
247 // Compare 2 unsigned long values, returning integer value (-1, 0 or 1).
248 class CmpUL3Node : public CmpULNode {
249 public:
250 CmpUL3Node( Node *in1, Node *in2 ) : CmpULNode(in1,in2) {
251 // Since it is not consumed by Bools, it is not really a Cmp.
252 init_class_id(Class_Sub);
253 }
254 virtual int Opcode() const;
255 virtual uint ideal_reg() const { return Op_RegI; }
256 };
257
258 //------------------------------CmpFNode---------------------------------------
259 // Compare 2 float values, returning condition codes (-1, 0 or 1).
260 // This implements the Java bytecode fcmpl, so unordered returns -1.
261 // Operands may not commute.
262 class CmpFNode : public CmpNode {
263 public:
264 CmpFNode( Node *in1, Node *in2 ) : CmpNode(in1,in2) {}
265 virtual int Opcode() const;
266 virtual const Type *sub( const Type *, const Type * ) const { ShouldNotReachHere(); return nullptr; }
267 const Type* Value(PhaseGVN* phase) const;
268 };
269
270 //------------------------------CmpF3Node--------------------------------------
271 // Compare 2 float values, returning integer value (-1, 0 or 1).
272 // This implements the Java bytecode fcmpl, so unordered returns -1.
273 // Operands may not commute.
274 class CmpF3Node : public CmpFNode {
275 public:
276 CmpF3Node( Node *in1, Node *in2 ) : CmpFNode(in1,in2) {
277 // Since it is not consumed by Bools, it is not really a Cmp.
278 init_class_id(Class_Sub);
279 }
280 virtual int Opcode() const;
281 // Since it is not consumed by Bools, it is not really a Cmp.
282 virtual uint ideal_reg() const { return Op_RegI; }
283 };
284
285
286 //------------------------------CmpDNode---------------------------------------
287 // Compare 2 double values, returning condition codes (-1, 0 or 1).
288 // This implements the Java bytecode dcmpl, so unordered returns -1.
289 // Operands may not commute.
290 class CmpDNode : public CmpNode {
291 public:
292 CmpDNode( Node *in1, Node *in2 ) : CmpNode(in1,in2) {}
293 virtual int Opcode() const;
294 virtual const Type *sub( const Type *, const Type * ) const { ShouldNotReachHere(); return nullptr; }
295 const Type* Value(PhaseGVN* phase) const;
296 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
297 };
298
299 //------------------------------CmpD3Node--------------------------------------
300 // Compare 2 double values, returning integer value (-1, 0 or 1).
301 // This implements the Java bytecode dcmpl, so unordered returns -1.
302 // Operands may not commute.
303 class CmpD3Node : public CmpDNode {
304 public:
305 CmpD3Node( Node *in1, Node *in2 ) : CmpDNode(in1,in2) {
306 // Since it is not consumed by Bools, it is not really a Cmp.
307 init_class_id(Class_Sub);
308 }
309 virtual int Opcode() const;
310 virtual uint ideal_reg() const { return Op_RegI; }
311 };
312
313 //--------------------------FlatArrayCheckNode---------------------------------
314 // Returns true if one of the input array objects or array klass ptrs (there
315 // can be multiple) is flat.
316 class FlatArrayCheckNode : public CmpNode {
317 public:
318 enum {
319 Control,
320 Memory,
321 ArrayOrKlass
322 };
323 FlatArrayCheckNode(Compile* C, Node* mem, Node* array_or_klass) : CmpNode(mem, array_or_klass) {
324 init_class_id(Class_FlatArrayCheck);
325 init_flags(Flag_is_macro);
326 C->add_macro_node(this);
327 }
328 virtual int Opcode() const;
329 virtual const Type* sub(const Type*, const Type*) const { ShouldNotReachHere(); return nullptr; }
330 const Type* Value(PhaseGVN* phase) const;
331 virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
332 };
333
334 //------------------------------BoolTest---------------------------------------
335 // Convert condition codes to a boolean test value (0 or -1).
336 // We pick the values as 3 bits; the low order 2 bits we compare against the
337 // condition codes, the high bit flips the sense of the result.
338 // For vector compares, additionally, the 4th bit indicates if the compare is unsigned
339 struct BoolTest {
340 enum mask { eq = 0, ne = 4, le = 5, ge = 7, lt = 3, gt = 1, overflow = 2, no_overflow = 6, never = 8, illegal = 9,
341 // The following values are used with vector compares
342 // A BoolTest value should not be constructed for such values
343 unsigned_compare = 16,
344 ule = unsigned_compare | le, uge = unsigned_compare | ge, ult = unsigned_compare | lt, ugt = unsigned_compare | gt };
345 mask _test;
346 BoolTest( mask btm ) : _test(btm) { assert((btm & unsigned_compare) == 0, "unsupported");}
347 const Type *cc2logical( const Type *CC ) const;
348 // Commute the test. I use a small table lookup. The table is created as
349 // a simple char array where each element is the ASCII version of a 'mask'
350 // enum from above.
351 mask commute( ) const { return mask("032147658"[_test]-'0'); }
352 mask negate( ) const { return negate_mask(_test); }
353 // Return the negative mask for the given mask, for both signed and unsigned comparison.
354 static mask negate_mask(mask btm) { return mask(btm ^ 4); }
355 static mask unsigned_mask(mask btm);
356 bool is_canonical( ) const { return (_test == BoolTest::ne || _test == BoolTest::lt || _test == BoolTest::le || _test == BoolTest::overflow); }
357 bool is_less( ) const { return is_less(_test); }
358 bool is_greater( ) const { return is_greater(_test); }
359 static bool is_less(mask btm) { return btm == BoolTest::lt || btm == BoolTest::le; }
360 static bool is_greater(mask btm) { return btm == BoolTest::gt || btm == BoolTest::ge; }
361
362 void dump_on(outputStream *st) const;
363 mask merge(BoolTest other) const;
364 };
365
366 //------------------------------BoolNode---------------------------------------
367 // A Node to convert a Condition Codes to a Logical result.
368 class BoolNode : public Node {
369 virtual uint hash() const;
370 virtual bool cmp( const Node &n ) const;
371 virtual uint size_of() const;
372
373 // Try to optimize signed integer comparison
374 Node* fold_cmpI(PhaseGVN* phase, SubNode* cmp, Node* cmp1, int cmp_op,
375 int cmp1_op, const TypeInt* cmp2_type);
376 public:
377 const BoolTest _test;
378 BoolNode(Node *cc, BoolTest::mask t): Node(nullptr,cc), _test(t) {
379 init_class_id(Class_Bool);
380 }
381 // Convert an arbitrary int value to a Bool or other suitable predicate.
382 static Node* make_predicate(Node* test_value, PhaseGVN* phase);
383 // Convert self back to an integer value.
384 Node* as_int_value(PhaseGVN* phase);
385 // Invert sense of self, returning new Bool.
386 BoolNode* negate(PhaseGVN* phase);
387 virtual int Opcode() const;
388 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
389 const Type* Value_cmpu_and_mask(PhaseValues* phase) const;
390 virtual const Type* Value(PhaseGVN* phase) const;
391 virtual const Type *bottom_type() const { return TypeInt::BOOL; }
392 uint match_edge(uint idx) const { return 0; }
393 virtual uint ideal_reg() const { return Op_RegI; }
394
395 bool is_counted_loop_exit_test();
396 #ifndef PRODUCT
397 virtual void dump_spec(outputStream *st) const;
398 #endif
399 };
400
401 //------------------------------AbsNode----------------------------------------
402 // Abstract class for absolute value. Mostly used to get a handy wrapper
403 // for finding this pattern in the graph.
404 class AbsNode : public Node {
405 public:
406 AbsNode( Node *value ) : Node(nullptr,value) {}
407 virtual Node* Identity(PhaseGVN* phase);
408 virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
409 virtual const Type* Value(PhaseGVN* phase) const;
410 };
411
412 //------------------------------AbsINode---------------------------------------
413 // Absolute value an integer. Since a naive graph involves control flow, we
414 // "match" it in the ideal world (so the control flow can be removed).
415 class AbsINode : public AbsNode {
416 public:
417 AbsINode( Node *in1 ) : AbsNode(in1) {}
418 virtual int Opcode() const;
419 const Type *bottom_type() const { return TypeInt::INT; }
420 virtual uint ideal_reg() const { return Op_RegI; }
421 };
422
423 //------------------------------AbsLNode---------------------------------------
424 // Absolute value a long. Since a naive graph involves control flow, we
425 // "match" it in the ideal world (so the control flow can be removed).
426 class AbsLNode : public AbsNode {
427 public:
428 AbsLNode( Node *in1 ) : AbsNode(in1) {}
429 virtual int Opcode() const;
430 const Type *bottom_type() const { return TypeLong::LONG; }
431 virtual uint ideal_reg() const { return Op_RegL; }
432 };
433
434 //------------------------------AbsFNode---------------------------------------
435 // Absolute value a float, a common float-point idiom with a cheap hardware
436 // implementation on most chips. Since a naive graph involves control flow, we
437 // "match" it in the ideal world (so the control flow can be removed).
438 class AbsFNode : public AbsNode {
439 public:
440 AbsFNode( Node *in1 ) : AbsNode(in1) {}
441 virtual int Opcode() const;
442 const Type *bottom_type() const { return Type::FLOAT; }
443 virtual uint ideal_reg() const { return Op_RegF; }
444 };
445
446 //------------------------------AbsDNode---------------------------------------
447 // Absolute value a double, a common float-point idiom with a cheap hardware
448 // implementation on most chips. Since a naive graph involves control flow, we
449 // "match" it in the ideal world (so the control flow can be removed).
450 class AbsDNode : public AbsNode {
451 public:
452 AbsDNode( Node *in1 ) : AbsNode(in1) {}
453 virtual int Opcode() const;
454 const Type *bottom_type() const { return Type::DOUBLE; }
455 virtual uint ideal_reg() const { return Op_RegD; }
456 };
457
458
459 //------------------------------CmpLTMaskNode----------------------------------
460 // If p < q, return -1 else return 0. Nice for flow-free idioms.
461 class CmpLTMaskNode : public Node {
462 public:
463 CmpLTMaskNode( Node *p, Node *q ) : Node(nullptr, p, q) {}
464 virtual int Opcode() const;
465 const Type *bottom_type() const { return TypeInt::INT; }
466 virtual uint ideal_reg() const { return Op_RegI; }
467 };
468
469
470 //------------------------------NegNode----------------------------------------
471 class NegNode : public Node {
472 public:
473 NegNode(Node* in1) : Node(nullptr, in1) {
474 init_class_id(Class_Neg);
475 }
476 };
477
478 //------------------------------NegINode---------------------------------------
479 // Negate value an int. For int values, negation is the same as subtraction
480 // from zero
481 class NegINode : public NegNode {
482 public:
483 NegINode(Node *in1) : NegNode(in1) {}
484 virtual int Opcode() const;
485 const Type *bottom_type() const { return TypeInt::INT; }
486 virtual uint ideal_reg() const { return Op_RegI; }
487 };
488
489 //------------------------------NegLNode---------------------------------------
490 // Negate value an int. For int values, negation is the same as subtraction
491 // from zero
492 class NegLNode : public NegNode {
493 public:
494 NegLNode(Node *in1) : NegNode(in1) {}
495 virtual int Opcode() const;
496 const Type *bottom_type() const { return TypeLong::LONG; }
497 virtual uint ideal_reg() const { return Op_RegL; }
498 };
499
500 //------------------------------NegFNode---------------------------------------
501 // Negate value a float. Negating 0.0 returns -0.0, but subtracting from
502 // zero returns +0.0 (per JVM spec on 'fneg' bytecode). As subtraction
503 // cannot be used to replace negation we have to implement negation as ideal
504 // node; note that negation and addition can replace subtraction.
505 class NegFNode : public NegNode {
506 public:
507 NegFNode( Node *in1 ) : NegNode(in1) {}
508 virtual int Opcode() const;
509 const Type *bottom_type() const { return Type::FLOAT; }
510 virtual uint ideal_reg() const { return Op_RegF; }
511 };
512
513 //------------------------------NegDNode---------------------------------------
514 // Negate value a double. Negating 0.0 returns -0.0, but subtracting from
515 // zero returns +0.0 (per JVM spec on 'dneg' bytecode). As subtraction
516 // cannot be used to replace negation we have to implement negation as ideal
517 // node; note that negation and addition can replace subtraction.
518 class NegDNode : public NegNode {
519 public:
520 NegDNode( Node *in1 ) : NegNode(in1) {}
521 virtual int Opcode() const;
522 const Type *bottom_type() const { return Type::DOUBLE; }
523 virtual uint ideal_reg() const { return Op_RegD; }
524 };
525
526 //------------------------------AtanDNode--------------------------------------
527 // arcus tangens of a double
528 class AtanDNode : public Node {
529 public:
530 AtanDNode(Node *c, Node *in1, Node *in2 ) : Node(c, in1, in2) {}
531 virtual int Opcode() const;
532 const Type *bottom_type() const { return Type::DOUBLE; }
533 virtual uint ideal_reg() const { return Op_RegD; }
534
535 private:
536 virtual bool depends_only_on_test_impl() const { return false; }
537 };
538
539
540 //------------------------------SqrtDNode--------------------------------------
541 // square root a double
542 class SqrtDNode : public Node {
543 public:
544 SqrtDNode(Compile* C, Node *c, Node *in1) : Node(c, in1) {
545 init_flags(Flag_is_expensive);
546 // Treat node only as expensive if a control input is set because it might
547 // be created from SqrtVDNode in VectorNode::push_through_replicate which
548 // does not have control input.
549 if (c != nullptr) {
550 C->add_expensive_node(this);
551 }
552 }
553 virtual int Opcode() const;
554 const Type *bottom_type() const { return Type::DOUBLE; }
555 virtual uint ideal_reg() const { return Op_RegD; }
556 virtual const Type* Value(PhaseGVN* phase) const;
557
558 private:
559 virtual bool depends_only_on_test_impl() const { return false; }
560 };
561
562 //------------------------------SqrtFNode--------------------------------------
563 // square root a float
564 class SqrtFNode : public Node {
565 public:
566 SqrtFNode(Compile* C, Node *c, Node *in1) : Node(c, in1) {
567 init_flags(Flag_is_expensive);
568 if (c != nullptr) {
569 // Treat node only as expensive if a control input is set because it might
570 // be created from a SqrtDNode in ConvD2FNode::Ideal() that was found to
571 // be unique and therefore has no control input.
572 C->add_expensive_node(this);
573 }
574 }
575 virtual int Opcode() const;
576 const Type *bottom_type() const { return Type::FLOAT; }
577 virtual uint ideal_reg() const { return Op_RegF; }
578 virtual const Type* Value(PhaseGVN* phase) const;
579
580 private:
581 virtual bool depends_only_on_test_impl() const { return false; }
582 };
583
584 //------------------------------SqrtHFNode-------------------------------------
585 // square root of a half-precision float
586 class SqrtHFNode : public Node {
587 public:
588 SqrtHFNode(Compile* C, Node* c, Node* in1) : Node(c, in1) {
589 init_flags(Flag_is_expensive);
590 C->add_expensive_node(this);
591 }
592 virtual int Opcode() const;
593 const Type* bottom_type() const { return Type::HALF_FLOAT; }
594 virtual uint ideal_reg() const { return Op_RegF; }
595 virtual const Type* Value(PhaseGVN* phase) const;
596
597 private:
598 virtual bool depends_only_on_test_impl() const { return false; }
599 };
600
601
602 class ReverseBytesNode : public Node {
603 public:
604 ReverseBytesNode(Node* in) : Node(nullptr, in) {}
605 virtual const Type* Value(PhaseGVN* phase) const;
606 };
607 //-------------------------------ReverseBytesINode--------------------------------
608 // reverse bytes of an integer
609 class ReverseBytesINode : public ReverseBytesNode {
610 public:
611 ReverseBytesINode(Node* in) : ReverseBytesNode(in) {}
612 virtual int Opcode() const;
613 const Type* bottom_type() const { return TypeInt::INT; }
614 virtual uint ideal_reg() const { return Op_RegI; }
615 };
616
617 //-------------------------------ReverseBytesLNode--------------------------------
618 // reverse bytes of a long
619 class ReverseBytesLNode : public ReverseBytesNode {
620 public:
621 ReverseBytesLNode(Node* in) : ReverseBytesNode(in) {}
622 virtual int Opcode() const;
623 const Type* bottom_type() const { return TypeLong::LONG; }
624 virtual uint ideal_reg() const { return Op_RegL; }
625 };
626
627 //-------------------------------ReverseBytesUSNode--------------------------------
628 // reverse bytes of an unsigned short / char
629 class ReverseBytesUSNode : public ReverseBytesNode {
630 public:
631 ReverseBytesUSNode(Node* in1) : ReverseBytesNode(in1) {}
632 virtual int Opcode() const;
633 const Type* bottom_type() const { return TypeInt::CHAR; }
634 virtual uint ideal_reg() const { return Op_RegI; }
635 };
636
637 //-------------------------------ReverseBytesSNode--------------------------------
638 // reverse bytes of a short
639 class ReverseBytesSNode : public ReverseBytesNode {
640 public:
641 ReverseBytesSNode(Node* in) : ReverseBytesNode(in) {}
642 virtual int Opcode() const;
643 const Type* bottom_type() const { return TypeInt::SHORT; }
644 virtual uint ideal_reg() const { return Op_RegI; }
645 };
646
647 //-------------------------------ReverseINode--------------------------------
648 // reverse bits of an int
649 class ReverseINode : public Node {
650 public:
651 ReverseINode(Node* in) : Node(nullptr,in) {}
652 virtual int Opcode() const;
653 const Type* bottom_type() const { return TypeInt::INT; }
654 virtual uint ideal_reg() const { return Op_RegI; }
655 virtual Node* Identity(PhaseGVN* phase);
656 virtual const Type* Value(PhaseGVN* phase) const;
657 };
658
659 //-------------------------------ReverseLNode--------------------------------
660 // reverse bits of a long
661 class ReverseLNode : public Node {
662 public:
663 ReverseLNode(Node* in) : Node(nullptr, in) {}
664 virtual int Opcode() const;
665 const Type* bottom_type() const { return TypeLong::LONG; }
666 virtual uint ideal_reg() const { return Op_RegL; }
667 virtual Node* Identity(PhaseGVN* phase);
668 virtual const Type* Value(PhaseGVN* phase) const;
669 };
670
671 #endif // SHARE_OPTO_SUBNODE_HPP