-
Notifications
You must be signed in to change notification settings - Fork 392
/
OMRTreeEvaluator.hpp
1132 lines (1067 loc) · 68.3 KB
/
OMRTreeEvaluator.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*******************************************************************************
* Copyright (c) 2000, 2021 IBM Corp. and others
*
* This program and the accompanying materials are made available under
* the terms of the Eclipse Public License 2.0 which accompanies this
* distribution and is available at http://eclipse.org/legal/epl-2.0
* or the Apache License, Version 2.0 which accompanies this distribution
* and is available at https://www.apache.org/licenses/LICENSE-2.0.
*
* This Source Code may also be made available under the following Secondary
* Licenses when the conditions for such availability set forth in the
* Eclipse Public License, v. 2.0 are satisfied: GNU General Public License,
* version 2 with the GNU Classpath Exception [1] and GNU General Public
* License, version 2 with the OpenJDK Assembly Exception [2].
*
* [1] https://www.gnu.org/software/classpath/license.html
* [2] http://openjdk.java.net/legal/assembly-exception.html
*
* SPDX-License-Identifier: EPL-2.0 OR Apache-2.0 OR GPL-2.0 WITH Classpath-exception-2.0 OR LicenseRef-GPL-2.0 WITH Assembly-exception
*******************************************************************************/
#ifndef OMR_Z_TREE_EVALUATOR_INCL
#define OMR_Z_TREE_EVALUATOR_INCL
/*
* The following #define and typedef must appear before any #includes in this file
*/
#ifndef OMR_TREE_EVALUATOR_CONNECTOR
#define OMR_TREE_EVALUATOR_CONNECTOR
namespace OMR { namespace Z { class TreeEvaluator; } }
namespace OMR { typedef OMR::Z::TreeEvaluator TreeEvaluatorConnector; }
#else
#error OMR::Z::TreeEvaluator expected to be a primary connector, but a OMR connector is already defined
#endif
#include "compiler/codegen/OMRTreeEvaluator.hpp"
#include "codegen/InstOpCode.hpp"
#include "il/DataTypes.hpp"
#include "il/ILOpCodes.hpp"
class TR_OpaquePseudoRegister;
class TR_PseudoRegister;
class TR_StorageReference;
class TR_S390ScratchRegisterManager;
namespace TR { class CodeGenerator; }
namespace TR { class Instruction; }
namespace TR { class LabelSymbol; }
namespace TR { class MemoryReference; }
namespace TR { class RegisterDependencyConditions; }
enum tableKind // for tableEvaluator
{
AddressTable32bit,
AddressTable64bitIntLookup,
AddressTable64bitLongLookup,
RelativeTable32bit,
RelativeTable64bitIntLookup,
RelativeTable64bitLongLookup
};
enum ArrayTranslateFlavor
{
CharToByte,
ByteToChar,
ByteToByte,
CharToChar
};
enum TR_FoldType
{
TR_FoldNone,
TR_FoldIf,
TR_FoldLookup,
TR_FoldNoIPM
};
namespace OMR
{
namespace Z
{
class OMR_EXTENSIBLE TreeEvaluator: public OMR::TreeEvaluator
{
public:
static TR::Register *BadILOpEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iloadiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *floadiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dloadiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *aloadiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bloadiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sloadiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lloadiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lstoreiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fstoreiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dstoreiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *astoreiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bstoreiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sstoreiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *istoreiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *GotoEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ireturnEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lreturnEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *freturnEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dreturnEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *areturnEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ReturnEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *asynccheckEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *athrowEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *icallEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lcallEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcallEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcallEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *acallEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *callEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *asubEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bdivEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sdivEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iudivEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ludivEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bremEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sremEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iuremEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fabsEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dabsEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *irolEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lrolEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *i2lEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *i2bEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *i2sEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *i2aEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iu2lEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iu2fEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iu2dEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iu2aEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *l2iEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *l2bEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *l2sEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lu2fEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lu2dEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lu2aEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *f2bEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *f2sEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *d2bEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *d2sEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *b2iEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *b2lEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *b2fEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *b2dEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *b2sEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *b2aEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bu2iEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bu2lEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bu2fEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bu2dEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bu2sEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bu2aEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *s2iEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *s2lEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *s2fEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *s2dEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *s2bEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *s2aEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *su2iEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *su2lEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *su2fEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *su2dEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *su2aEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *a2iEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *a2lEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *a2bEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *a2sEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *icmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iucmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iucmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iucmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iucmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lucmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lucmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lucmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lucmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmpequEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmpneuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmpltuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmpgeuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmpgtuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmpleuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *acmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *acmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *acmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *acmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *acmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bcmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bucmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bucmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bucmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bucmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *scmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmpgEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmplEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcmpgEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ificmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifiucmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifiucmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifiucmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifiucmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflucmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflucmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflucmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflucmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifdcmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifdcmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifdcmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifdcmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifdcmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifdcmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifdcmpequEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifdcmpneuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifdcmpltuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifdcmpgeuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifdcmpgtuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifdcmpleuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifacmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifacmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifacmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifacmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifbcmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifbucmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifbucmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifbucmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifbucmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifscmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *aRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iselectEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lselectEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bselectEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sselectEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *aselectEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fselectEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *MethodEnterHookEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *MethodExitHookEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *PassThroughEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *viminEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vimaxEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vigetelemEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *visetelemEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vimergelEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vimergehEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vicmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vicmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vicmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vicmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vicmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vnotEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vbitselectEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vpermEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdmergelEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdmergehEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdsetelemEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdgetelemEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdselEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdmaxEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdminEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdcmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdcmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdcmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdcmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdcmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdcmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdsqrtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vloadiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vstoreiEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vcallEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vcalliEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vselectEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *v2vEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vbRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vsRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *viRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vlRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vfRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vbRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vsRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *viRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vlRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vfRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vdRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *f2iuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *f2luEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *f2buEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *f2cEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *d2iuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *d2luEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *d2buEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *d2cEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *monentEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *monexitEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *monexitfenceEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *tstartEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *tfinishEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *tabortEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *instanceofEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *checkcastEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *checkcastAndNULLCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *NewEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *newvalueEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *newarrayEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *anewarrayEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *variableNewEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *variableNewArrayEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *multianewarrayEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *arraylengthEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *contigarraylengthEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *discontigarraylengthEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *icalliEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lcalliEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcalliEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dcalliEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *acalliEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *calliEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *luaddhEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lusubhEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *imulhEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iumulhEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lumulhEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *CaseEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *exceptionRangeFenceEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *NULLCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ResolveCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ResolveAndNULLCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *DIVCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *OverflowCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *UnsignedOverflowCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *BNDCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ArrayCopyBNDCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *BNDCHKwithSpineCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *SpineCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ArrayStoreCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ArrayCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *allocationFenceEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *loadFenceEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *storeFenceEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fullFenceEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sutestEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bucmpEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bcmpEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sucmpEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *scmpEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iucmpEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *icmpEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lucmpEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ificmpoEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ificmpnoEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflcmpoEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflcmpnoEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ificmnoEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ificmnnoEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflcmnoEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflcmnnoEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iuaddcEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *luaddcEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iusubbEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lusubbEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *icmpsetEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lcmpsetEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bztestnsetEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ibatomicorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *isatomicorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iiatomicorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ilatomicorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iumaxEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lumaxEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iuminEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *luminEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ihbitEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ilbitEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *inolzEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *inotzEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ipopcntEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lhbitEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *llbitEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lnolzEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lnotzEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lpopcntEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bbitpermuteEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sbitpermuteEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ibitpermuteEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lbitpermuteEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *aconstEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iconstEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lconstEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fconstEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dconstEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bconstEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sconstEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *branchEvaluator(TR::Node * node, TR::CodeGenerator * cg);
static TR::Register *iloadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *aloadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lloadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *floadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dloadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bloadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sloadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fwrtbarEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fwrtbariEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dwrtbarEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dwrtbariEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *awrtbarEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *awrtbariEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *istoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lstoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *astoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fstoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dstoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bstoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sstoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifstoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *idstoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *gotoEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *igotoEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *returnEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *directCallEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *indirectCallEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fenceEvaluator(TR::Node * node, TR::CodeGenerator *cg);
static TR::Register *treetopEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *aiaddEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *aladdEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *axaddEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iaddEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *laddEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *faddEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *daddEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *baddEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *saddEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *isubEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lsubEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fsubEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dsubEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bsubEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ssubEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *imulEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *mulhEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dualMulHelper64(TR::Node * node, TR::Node * lmulNode, TR::Node * lumulhNode, TR::CodeGenerator * cg);
static TR::Register *dualMulEvaluator(TR::Node * node, TR::CodeGenerator *cg);
static TR::Register *lmulEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lmulhEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fmulEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dmulEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bmulEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *smulEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *idivEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ldivEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fdivEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ddivEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iremEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lremEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *floatRemHelper(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fremEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dremEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iabsEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *labsEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *inegEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lnegEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fnegEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dnegEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bnegEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *snegEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ishlEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lshlEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bshlEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sshlEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ishrEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lshrEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bshrEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sshrEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iushrEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lushrEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bushrEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sushrEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *integerRolEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iandEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *landEvaluator(TR::Node *node, TR::CodeGenerator *cg);
/** \brief
* This is a helper function that will try to use a rotate instruction
* to perform an 'land' (Long AND) operation. It will handle cases
* where the second child of the Long AND is a lconst node, and the
* lconst value is a sequence of contiguous 1's surrounded by 0's or vice versa.
* For example, the lconst value can be:
* 00011111111000, 1111000000011111, 0100000
*
* For example, consider the following tree:
*
* land
* i2l
* iload parm=0
* lconst 0x0000FFFFFFFF0000
*
* We can either materialize the constant in a register or use the NIHF+NILF instructions
* to AND the most and least significant 32 bit portions in the first operand. These
* are both more expensive than generating a RISBG instruction.
*
* This is because in the above case we can perform the AND operation with the
* following single RISBG instruction:
*
* RISBG R2,R1,33,175,0 //R1 holds parm 0
*
* In the above instruction the value of 175 comes from
* the sum of 128 and 47. 47 represents the ending position
* of the bit range to preserve, and 128 is there to set the
* zero bit. The instruction is saying to take the value in R1 and
* do the following:
* -preserve the bits from 33 - 47 (inclusive)
* -zero the remaining bits
* -rotate the preserved bits by a factor of 0(hence no rotation)
* -store the result in R2
*
* Note: RISBG is non-destructive (unlike the AND immediate instructions).
* So the original value in R1 is preserved.
*
* \param node
* The land node
*
* \param cg
* The code generator used to generate the instructions
*
* \param shiftAmount
* The number of bits we should shift the result of the logical AND. A positive value represents a left shift,
* a negative value represents a right shift, and a value of zero represents no shift.
* Note that if the absolute value of number is greater than 6 bits, then this optimization will not work
* since the RISBG instruction will only hold 6 bits for the shift operand.
*
* \param isSignedShift
* If replacing a signed shift+and combination, this variable evaluates to true. Else it will evaluate to false.
* Note: If we are using this function to replace a standalone 'and', then this variable should be false.
*
* \return
* The target register for the instruction, or NULL if generating a
* RISBG instruction is not suitable
*
*/
static TR::Register *tryToReplaceShiftLandWithRotateInstruction(TR::Node * node, TR::CodeGenerator * cg, int32_t shiftAmount, bool isSignedShift);
static TR::Register *bandEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sandEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *candEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *borEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *corEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ixorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lxorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bxorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sxorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *cxorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dceilEvaluator(TR::Node * node, TR::CodeGenerator * cg);
static TR::Register *dfloorEvaluator(TR::Node * node, TR::CodeGenerator * cg);
static TR::Register *fceilEvaluator(TR::Node * node, TR::CodeGenerator * cg);
static TR::Register *ffloorEvaluator(TR::Node * node, TR::CodeGenerator * cg);
static TR::Register *floorCeilEvaluator(TR::Node * node, TR::CodeGenerator * cg, TR::InstOpCode::Mnemonic regToRegOpCode, int8_t mask);
template <bool isDstTypeSigned, uint32_t newSize>
static TR::Register *narrowCastEvaluator(TR::Node * node, TR::CodeGenerator * cg);
template <bool isSourceTypeSigned, uint32_t srcSize, uint32_t numberOfExtendBits>
static TR::Register *extendCastEvaluator(TR::Node * node, TR::CodeGenerator * cg);
template<uint32_t otherSize, bool dirToAddr>
static TR::Register *addressCastEvaluator(TR::Node * node, TR::CodeGenerator * cg);
static TR::Register *l2aEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *i2fEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *i2dEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *l2fEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *l2dEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *f2iEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *f2lEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *f2dEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *d2iEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *d2lEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *d2fEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ibits2fEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fbits2iEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lbits2dEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dbits2lEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ificmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ificmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ificmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ificmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ificmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflcmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflcmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflcmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflcmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflcmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iflcmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iffcmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iffcmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iffcmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iffcmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iffcmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iffcmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iffcmpequEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iffcmpneuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iffcmpltuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iffcmpgeuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iffcmpgtuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iffcmpleuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifacmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifacmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifbcmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifbcmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifbcmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifbcmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifbcmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifscmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifscmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifscmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifscmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifscmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifsucmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifsucmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifsucmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifsucmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ifxcmpoEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *icmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *icmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *icmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *icmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *icmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lcmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lcmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lcmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lcmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lcmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lcmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmpequEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmpneuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmpltuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmpgeuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmpgtuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmpleuEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *acmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bcmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bcmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bcmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bcmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bcmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *scmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *scmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *scmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *scmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *scmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sucmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sucmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sucmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *sucmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fcmplEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static bool isCandidateForButestEvaluation(TR::Node *node);
static bool isCandidateForCompareEvaluation(TR::Node * node);
static bool isSingleRefUnevalAndCompareOrBu2iOverCompare(TR::Node * node);
static TR::InstOpCode::S390BranchCondition getBranchConditionFromCompareOpCode(TR::ILOpCodes opCode);
static TR::InstOpCode::S390BranchCondition mapBranchConditionToLOCRCondition(TR::InstOpCode::S390BranchCondition incomingBc);
static TR::InstOpCode::Mnemonic getCompareOpFromNode(TR::CodeGenerator *cg, TR::Node *node);
static TR::Register *selectEvaluator(TR::Node * node, TR::CodeGenerator * cg);
static TR::Register *dselectEvaluator(TR::Node * node, TR::CodeGenerator * cg);
static bool treeContainsAllOtherUsesForNode(TR::Node *condition, TR::Node *trueVal, TR::CodeGenerator *cg);
static int32_t countReferencesInTree(TR::Node *treeNode, TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *NOPEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *barrierFenceEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lookupEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static void tableEvaluatorCaseLabelHelper(TR::Node * node, TR::CodeGenerator * cg, tableKind tableKindToBeEvaluated, int32_t numBranchTableEntries, TR::Register * selectorReg, TR::Register * branchTableReg, TR::Register *reg1 );
static TR::Register *tableEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *loadaddrEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ZEROCHKEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vselEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vloadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vstoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vnegEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vl2vdEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vaddEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vsubEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vmulEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vDivOrRemHelper(TR::Node *node, TR::CodeGenerator *cg, bool isDivision);
static TR::Register *vdivEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vandEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vxorEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vectorElementShiftHelper(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vcmpeqEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vcmpneEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vcmpltEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vcmpgtEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vcmpleEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vcmpgeEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vreturnEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vconstEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *getvelemEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *vsetelemEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *inlineVectorUnaryOp(TR::Node * node, TR::CodeGenerator *cg, TR::InstOpCode::Mnemonic op);
static TR::Register *inlineVectorBinaryOp(TR::Node * node, TR::CodeGenerator *cg, TR::InstOpCode::Mnemonic op);
static TR::Register *sbyteswapEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *ibyteswapEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lbyteswapEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bitpermuteEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *tryToReuseInputVectorRegs(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *checkAndAllocateReferenceRegister(TR::Node * node,
TR::CodeGenerator * cg,
bool& dynLitPoolLoad);
static void checkAndSetMemRefDataSnippetRelocationType(TR::Node * node,
TR::CodeGenerator * cg,
TR::MemoryReference* tempMR);
static TR::Node* DAAAddressPointer (TR::Node* callNode, TR::CodeGenerator* cg);
static void createDAACondDeps(TR::Node * node, TR::RegisterDependencyConditions * daaDeps,
TR::Instruction * daaInstr, TR::CodeGenerator * cg);
static void addToRegDep(TR::RegisterDependencyConditions * daaDeps, TR::Register * reg,
bool mightUseRegPair);
static TR::Register *passThroughEvaluator(TR::Node *node, TR::CodeGenerator *cg);
/** \brief
* Evaluates a primitive or reference arraycopy node. A primitive arraycopy has 3 children and a reference
* arraycopy has 5 children.
*
* The z Systems code generator requires that <c>isForwardArrayCopy()</c> really means that a forward array copy
* is safe and that if it is not set it really means that a backward array copy is safe. The optimizer should
* have generated the correct tests around the arraycopy to enforce this assumption.
*
* Furthermore note that the z Systems code generator does not need to check for a particular frequency on the
* length, again because the optimizer will have generated a test for a particular length, if one is quite
* common, and there will be two versions of the arraycopy call; one with a constant length and one with a
* variable length.
*
* \param node
* The arraycopy node.
*
* \param cg
* The code generator used to generate the instructions.
*
* \param byteSrcNode
* The source address of the array copy.
*
* \param byteDstNode
* The destination address of the array copy.
*
* \param byteLenNode
* The number of bytes to copy.
*
* \return
* <c>NULL</c>
*/
static TR::Register *arraycopyEvaluator(TR::Node *node, TR::CodeGenerator *cg);
/** \brief
* Evaluates a primitive arraycopy node by generating an MVC memory-memory copy for a forward arraycopy and a
* loop based on the stride length for a backward arraycopy.
* \param node
* The primitive arraycopy node.
*
* \param cg
* The code generator used to generate the instructions.
*
* \param byteSrcNode
* The source address of the array copy.
*
* \param byteDstNode
* The destination address of the array copy.
*
* \param byteLenNode
* The number of bytes to copy.
*/
static void primitiveArraycopyEvaluator(TR::Node* node, TR::CodeGenerator* cg, TR::Node* byteSrcNode, TR::Node* byteDstNode, TR::Node* byteLenNode);
/** \brief
* Generates Load/Store sequence for array copy as per type of array copy element
*
* \param node
* The arraycopy node.
*
* \param cg
* The code generator used to generate the instructions.
*
* \param srcMemRef
* Memory Reference of src from where we need to load
*
* \param dstMemRef
* Memory Reference of destination where we need to store
*
* \param srm
* Scratch Register Manager providing pool of scratch registers to use
*
* \param elementType
* Array Copy element type
*
* \param needsGuardedLoad
* Boolean stating if we need to use Guarded Load instruction
*
* \param deps
* Register dependency conditions of the external ICF. Load-and-store for array copy
* itself is usually a load-store instruction pair without internal control flows.
* But project specific implementations could extend this and construct an ICF.
* Should an ICF be constructed, the inner ICF will use the outer ICF's dependencies and build upon it.
*
*/
static void generateLoadAndStoreForArrayCopy(TR::Node *node, TR::CodeGenerator *cg, TR::MemoryReference *srcMemRef, TR::MemoryReference *dstMemRef, TR_S390ScratchRegisterManager *srm, TR::DataType elenmentType, bool needsGuardedLoad, TR::RegisterDependencyConditions* deps = NULL);
/** \brief
* Generate sequence for forward array copy using MVC memory-memory copy instruction
*
* \param node
* The arraycopy node.
*
* \param cg
* The code generator used to generate the instructions.
*
* \param byteSrcReg
* Register holding starting address of source
*
* \param byteDstReg
* Register holding starting address of destination
*
* \param byteLenReg
* Register holding number of bytes to copy
*
* \param byteLenNode
* Node for number of bytes to copy
*
* \param srm
* Scratch Register Manager providing pool of scratch registers to use
*
* \param mergeLabel
* Label Symbol where we merge from Out Of line code section
*/
static void forwardArrayCopySequenceGenerator(TR::Node *node, TR::CodeGenerator *cg, TR::Register *byteSrcReg, TR::Register *byteDstReg, TR::Register *byteLenReg, TR::Node *byteLenNode, TR_S390ScratchRegisterManager *srm, TR::LabelSymbol *mergeLabel);
static void genLoopForwardArrayCopy(TR::Node *node, TR::CodeGenerator *cg, TR::Register *byteSrcReg, TR::Register *byteDstReg, TR::Register *loopIterReg, bool isConstantLength = false);
/** \brief
* Generates Element wise Memory To Memory copy sequence in forward/backward direction
*
* \param node
* The arraycopy node.
*
* \param cg
* The code generator used to generate the instructions.
*
* \param byteSrcReg
* Register holding starting address of source
*
* \param byteDstReg
* Register holding starting address of destination
*
* \param byteLenReg
* Register holding number of bytes to copy
*
* \param srm
* Scratch Register Manager providing pool of scratch registers to use
*
* \param isForward
* Boolean specifying if we need to copy elements in forward direction
*
* \param needsGuardedLoad
* Boolean stating if we need to use Guarded Load instruction
*
* \param genStartICFLabel
* Boolean stating if we need to set the start ICF flag
*
* \param deps
* Register dependency conditions of the external ICF this mem-to-mem copy resides. Mem-to-Mem element copy
* itself is a loop of load-store instructions that has its own ICF. If this ICF resides in another ICF,
* the inner ICF will use the outer ICF's dependencies.
*
* \return
* Register depdendecy conditions containg registers allocated within Internal Control Flow
*
*/
static TR::RegisterDependencyConditions* generateMemToMemElementCopy(TR::Node *node, TR::CodeGenerator *cg, TR::Register *byteSrcReg, TR::Register *byteDstReg, TR::Register *byteLenReg, TR_S390ScratchRegisterManager *srm, bool isForward, bool needsGuardedLoad, bool genStartICFLabel=false, TR::RegisterDependencyConditions* deps = NULL);
/** \brief
* Generates sequence for backward array copy
*
* \param node
* The arraycopy node.
*
* \param cg
* The code generator used to generate the instructions.
*
* \param byteSrcReg
* Register holding starting address of source
*
* \param byteDstReg
* Register holding starting address of destination
*
* \param byteLenReg
* Register holding number of bytes to copy
*
* \param byteLenNode
* Node for number of bytes to copy
*
* \param srm
* Scratch Register Manager providing pool of scratch registers to use
*
* \param mergeLabel
* Label Symbol where we merge from Out Of line code section
*
* \return
* Register depdendecy conditions containg registers allocated within Internal Control Flow
*/
static TR::RegisterDependencyConditions* backwardArrayCopySequenceGenerator(TR::Node *node, TR::CodeGenerator *cg, TR::Register *byteSrcReg, TR::Register *byteDstReg, TR::Register *byteLenReg, TR::Node *byteLenNode, TR_S390ScratchRegisterManager *srm, TR::LabelSymbol *mergeLabel);
static TR::Register *arraysetEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register * evaluateLengthMinusOneForMemoryCmp(TR::Node *node, TR::CodeGenerator *cg, bool clobberEvaluate, bool &lenMinusOne);
static TR::Register *inlineIfArraycmpEvaluator(TR::Node *node, TR::CodeGenerator *cg, bool& inlined);
static TR::Register *arraycmpHelper(TR::Node *node,
TR::CodeGenerator *cg,
bool isWideChar,
bool isEqualCmp = false,
int32_t cmpValue = 0,
TR::LabelSymbol *compareTarget = NULL,
TR::Node *ificmpNode = NULL,
bool needResultReg = true,
bool return102 = false,
TR::InstOpCode::S390BranchCondition *returnCond = NULL);
static TR::Register *arraycmpSIMDHelper(TR::Node *node,
TR::CodeGenerator *cg,
TR::LabelSymbol *compareTarget = NULL,
TR::Node *ificmpNode = NULL,
bool needResultReg = true,
bool return102 = false);
static TR::Register *arraytranslateEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *arraytranslateEncodeSIMDEvaluator(TR::Node *node, TR::CodeGenerator *cg, ArrayTranslateFlavor convType);
static TR::Register *arraytranslateDecodeSIMDEvaluator(TR::Node *node, TR::CodeGenerator *cg, ArrayTranslateFlavor convType);
static TR::Register *arraytranslateAndTestEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *long2StringEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *bitOpMemEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *arraycmpEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *BBStartEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *BBEndEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lcmpEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *aRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fRegLoadEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lRegStoreEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *GlRegDepsEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *iminEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lminEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fminEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dminEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *imaxEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *lmaxEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *fmaxEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *dmaxEvaluator(TR::Node *node, TR::CodeGenerator *cg);
static TR::Register *evaluateNULLCHKWithPossibleResolve(TR::Node * node, bool needsResolve, TR::CodeGenerator * cg);