-
Notifications
You must be signed in to change notification settings - Fork 402
/
Copy pathVPConstraint.hpp
1259 lines (1019 loc) · 49.5 KB
/
VPConstraint.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 IBM Corp. and others 2000
*
* 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 https://www.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] https://openjdk.org/legal/assembly-exception.html
*
* SPDX-License-Identifier: EPL-2.0 OR Apache-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0 OR GPL-2.0-only WITH OpenJDK-assembly-exception-1.0
*******************************************************************************/
#ifndef VPCONSTRAINT_INCL
#define VPCONSTRAINT_INCL
#include <stdint.h>
#include <string.h>
#include "env/KnownObjectTable.hpp"
#include "env/TRMemory.hpp"
#include "env/jittypes.h"
#include "il/DataTypes.hpp"
#include "infra/Assert.hpp"
#include "infra/Bit.hpp"
#include "infra/List.hpp"
class TR_FrontEnd;
class TR_OpaqueClassBlock;
class TR_ResolvedMethod;
namespace TR { class VPArrayInfo; }
namespace TR { class VPClassPresence; }
namespace TR { class VPClassType; }
namespace TR { class VPConstString; }
namespace TR { class VPKnownObject; }
namespace TR { class VPObjectLocation; }
namespace TR { class VPPreexistentObject; }
namespace OMR { class ValuePropagation; }
namespace TR { class VP_BCDValue; }
namespace TR { class VP_BCDSign; }
namespace TR { class Compilation; }
namespace TR { class Node; }
namespace TR { class SymbolReference; }
#define VP_HASH_TABLE_SIZE 251
#define VP_UNDEFINED_PRECISION -1
namespace TR {
// ***************************************************************************
//
// Value propagation constraints. A constraint is a property that puts some
// limit on a value.
//
// ***************************************************************************
class VPConstraint
{
public:
TR_ALLOC(TR_Memory::ValuePropagation)
VPConstraint(int32_t p) : _mergePriority(p) {_unsignedType = false;}
virtual class VPShortConstraint *asShortConstraint();
virtual class VPShortConst *asShortConst();
virtual class VPShortRange *asShortRange();
virtual class VPIntConstraint *asIntConstraint();
virtual class VPIntConst *asIntConst();
virtual class VPIntRange *asIntRange();
virtual class VPLongConstraint *asLongConstraint();
virtual class VPLongConst *asLongConst();
virtual class VPLongRange *asLongRange();
virtual class VP_BCDValue *asBCDValue();
virtual class VP_BCDSign *asBCDSign();
virtual class VPClass *asClass();
virtual class VPClassType *asClassType();
virtual class VPResolvedClass *asResolvedClass();
virtual class VPFixedClass *asFixedClass();
virtual class VPKnownObject *asKnownObject();
virtual class VPConstString *asConstString();
virtual class VPUnresolvedClass *asUnresolvedClass();
//virtual class TR::VPImplementedInterface *asImplementedInterface();
virtual class VPClassPresence *asClassPresence();
virtual class VPUnspecifiedArrayType *asUnspecifiedArrayType();
virtual class VPNullObject *asNullObject();
virtual class VPNonNullObject *asNonNullObject();
virtual class VPPreexistentObject *asPreexistentObject();
virtual class VPArrayInfo *asArrayInfo();
virtual class VPObjectLocation *asObjectLocation();
virtual class VPMergedConstraints *asMergedConstraints();
virtual class VPMergedConstraints *asMergedShortConstraints();
virtual class VPMergedConstraints *asMergedIntConstraints();
virtual class VPMergedConstraints *asMergedLongConstraints();
virtual class VPUnreachablePath *asUnreachablePath();
virtual class VPSync *asVPSync();
virtual class VPRelation *asRelation();
virtual class VPLessThanOrEqual *asLessThanOrEqual();
virtual class VPGreaterThanOrEqual*asGreaterThanOrEqual();
virtual class VPEqual *asEqual();
virtual class VPNotEqual *asNotEqual();
virtual const char *name()=0;
static TR::VPConstraint *create(OMR::ValuePropagation *vp, const char *sig, int32_t len, TR_ResolvedMethod *method, bool isFixedClass);
static bool isSpecialClass(uintptr_t klass);
TR::VPConstraint *merge(TR::VPConstraint *other, OMR::ValuePropagation *vp);
TR::VPConstraint *intersect(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *merge1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
// Arithmetic operations
//
virtual TR::VPConstraint *add(TR::VPConstraint *other, TR::DataType type, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *subtract(TR::VPConstraint *other, TR::DataType type, OMR::ValuePropagation *vp);
virtual TR_YesNoMaybe canOverflow();
virtual void setCanOverflow(TR_YesNoMaybe v) {}
// Absolute comparisons
//
virtual bool mustBeEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeNotEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeLessThan(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeLessThanOrEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
// Relative comparisons
//
virtual bool mustBeEqual();
virtual bool mustBeNotEqual();
virtual bool mustBeLessThan();
virtual bool mustBeLessThanOrEqual();
virtual bool mustBeGreaterThan();
virtual bool mustBeGreaterThanOrEqual();
// Integer information
//
virtual int16_t getLowShort();
virtual int16_t getHighShort();
virtual int32_t getLowInt();
virtual int32_t getHighInt();
virtual int64_t getLowLong();
virtual int64_t getHighLong();
virtual uint16_t getUnsignedLowShort();
virtual uint16_t getUnsignedHighShort();
virtual uint32_t getUnsignedLowInt();
virtual uint32_t getUnsignedHighInt();
virtual uint64_t getUnsignedLowLong();
virtual uint64_t getUnsignedHighLong();
// Class information
//
virtual bool isNullObject();
virtual bool isNonNullObject();
virtual bool isPreexistentObject();
virtual TR_OpaqueClassBlock *getClass();
virtual TR_OpaqueClassBlock *getTypeHintClass();
virtual bool isFixedClass();
virtual bool isConstString();
virtual bool isUnspecifiedArrayType();
virtual TR::VPClassType *getClassType();
virtual TR::VPClassPresence *getClassPresence();
virtual TR::VPPreexistentObject *getPreexistence();
virtual TR::VPObjectLocation *getObjectLocation();
virtual TR::VPConstString *getConstString();
virtual TR::VPKnownObject *getKnownObject();
virtual TR::VPArrayInfo *getArrayInfo();
virtual TR::VPUnspecifiedArrayType *getUnspecifiedArrayType();
virtual const char *getClassSignature(int32_t &len);
virtual TR_YesNoMaybe isStackObject();
virtual TR_YesNoMaybe isHeapObject();
virtual TR_YesNoMaybe isClassObject();
virtual TR_YesNoMaybe isJavaLangClassObject();
virtual TR_YesNoMaybe isJ9ClassObject();
// Merge priorities, used in merge and intersect methods. The method called
// is the one belonging to the highest priority
//
/*
enum MergePriorities
{
EqualPriority = 16,
GreaterThanOrEqualPriority= 15,
LessThanOrEqualPriority = 14,
NotEqualPriority = 13,
MergedConstraintPriority = 12,
IntPriority = 11,
LongPriority = 10,
ClassPriority = 9,
ConstStringPriority = 8,
FixedClassPriority = 7,
ResolvedClassPriority = 6,
UnresolvedClassPriority = 5,
ClassPresencePriority = 4,
ClassPreexistencePriority = 3,
ArrayInfoPriority = 2,
ObjectLocationPriority = 1,
ImplementsInterfacePriority = 0,
highestPriority
};
*/
enum MergePriorities
{
EqualPriority = 19,
GreaterThanOrEqualPriority= 18,
LessThanOrEqualPriority = 17,
NotEqualPriority = 16,
MergedConstraintPriority = 15,
ShortPriority = 14,
IntPriority = 13,
LongPriority = 12,
BCDPriority = 11,
ClassPriority = 10,
KnownObjectPriority = 9,
ConstStringPriority = 8,
FixedClassPriority = 7,
ResolvedClassPriority = 6,
UnresolvedClassPriority = 5,
ClassPresencePriority = 4,
ClassPreexistencePriority = 3,
ArrayInfoPriority = 2,
ObjectLocationPriority = 1,
SyncPriority = 0,
highestPriority
};
int32_t priority() {return (_mergePriority & 0x7fffffff);}
void setHasArtificialIncrement() { (_mergePriority = _mergePriority | 0x80000000); }
bool hasArtificialIncrement() { return ((_mergePriority & 0x80000000) != 0); }
void print(OMR::ValuePropagation *vp);
virtual void print(TR::Compilation *, TR::FILE *);
virtual void print(TR::Compilation *, TR::FILE *, int32_t relative);
bool isUnsigned() { return _unsignedType; }
void setIsUnsigned(bool b) { TR_ASSERT(0 == 1, "I should eventually remove this property from here"); _unsignedType = b; } //FIXME//CRITICAL
virtual int32_t getPrecision() {return TR_MAX_DECIMAL_PRECISION;}
protected:
bool _unsignedType;
class Tracer {
public:
Tracer(OMR::ValuePropagation *vp, TR::VPConstraint *self, TR::VPConstraint *other, const char *name);
~Tracer();
OMR::ValuePropagation *vp(){ return _vp; }
TR::Compilation *comp();
protected:
OMR::ValuePropagation *_vp;
TR::VPConstraint *_self;
TR::VPConstraint *_other;
const char *_name;
};
private:
int32_t _mergePriority;
};
#define TRACER(vp, self, other) Tracer _tracer_(vp, self, other, __func__)
class VPShortConstraint: public TR::VPConstraint
{
public:
VPShortConstraint(int16_t v) : TR::VPConstraint(ShortPriority) {_low=v; _overflow = TR_no;}
virtual TR::VPShortConstraint * asShortConstraint();
int16_t getShort() {return _low; }
int16_t getLow() {return _low; }
virtual int16_t getHigh() = 0;
virtual int16_t getLowShort();
virtual int16_t getHighShort();
virtual TR::VPConstraint * merge1 ( TR::VPConstraint * other, OMR::ValuePropagation * vp);
virtual TR::VPConstraint * intersect1 (TR::VPConstraint * other, OMR::ValuePropagation * vp);
virtual bool mustBeNotEqual (TR::VPConstraint * other, OMR::ValuePropagation *vp);
virtual bool mustBeLessThan (TR::VPConstraint * other, OMR::ValuePropagation *vp);
virtual bool mustBeLessThanOrEqual (TR::VPConstraint * other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *add(TR::VPConstraint * other, TR::DataType type, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *subtract(TR::VPConstraint *other, TR::DataType type, OMR::ValuePropagation * vp);
virtual TR_YesNoMaybe canOverflow() {return _overflow;}
virtual void setCanOverflow(TR_YesNoMaybe v) {_overflow = v;}
virtual int32_t getPrecision() {return getPrecisionFromValue(TR::getMaxSigned<TR::Int16>());}
protected:
int16_t _low;
TR_YesNoMaybe _overflow;
private:
TR::VPConstraint *getRange(int16_t, int16_t, bool, bool, OMR::ValuePropagation * vp);
};
class VPShortConst : public TR::VPShortConstraint
{
public:
VPShortConst(int16_t v) : TR::VPShortConstraint(v) {}
static TR::VPShortConst *create(OMR::ValuePropagation *vp, int16_t v);
static TR::VPConstraint *createExclusion(OMR::ValuePropagation *vp, int16_t v);
// unsigned createExclusion
//static TR::VPConstraint *createExclusion(OMR::ValuePropagation *vp, int32_t v);
virtual TR::VPShortConst *asShortConst();
virtual int16_t getHigh() {return _low;}
virtual bool mustBeEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
virtual int32_t getPrecision() {return getPrecisionFromValue(_low);}
};
class VPShortRange : public TR::VPShortConstraint
{
public:
VPShortRange(int16_t low, int16_t high) : TR::VPShortConstraint(low), _high(high) {}
static TR::VPShortConstraint *create(OMR::ValuePropagation *vp, int16_t low, int16_t high, TR_YesNoMaybe canOverflow = TR_no);
static TR::VPShortConstraint *create(OMR::ValuePropagation *vp);
static TR::VPShortConstraint *createWithPrecision(OMR::ValuePropagation *vp, int32_t precision, bool isNonNegative = false);
virtual TR::VPShortRange *asShortRange();
virtual int16_t getHigh() {return _high;}
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
virtual int32_t getPrecision() {return getPrecisionFromRange(_low, _high);}
private:
int16_t _high;
};
class VPIntConstraint : public TR::VPConstraint
{
public:
VPIntConstraint(int32_t v) : TR::VPConstraint(IntPriority) {_low = v; _overflow = TR_no;}
virtual TR::VPIntConstraint *asIntConstraint();
int32_t getInt() {return _low;}
int32_t getLow() {return _low;}
virtual int32_t getHigh() = 0;
virtual int32_t getLowInt();
virtual int32_t getHighInt();
virtual TR::VPConstraint *merge1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
// unsigned intMerge
//TR::VPConstraint *merge1(TR::VPConstraint *other, OMR::ValuePropagation *vp, bool isUnsigned);
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
// unsigned intIntersect
//TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp, bool isUnsigned);
virtual bool mustBeNotEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeLessThan(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeLessThanOrEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *add(TR::VPConstraint *other, TR::DataType type, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *subtract(TR::VPConstraint *other, TR::DataType type, OMR::ValuePropagation *vp);
// unsigned add
//TR::VPConstraint *add(TR::VPIntConstraint *other, OMR::ValuePropagation *vp, bool isUnsigned);
// unsigned subtract
//TR::VPConstraint *subtract(TR::VPIntConstraint *other, OMR::ValuePropagation *vp, bool isUnsigned);
virtual TR_YesNoMaybe canOverflow() {return _overflow;}
virtual void setCanOverflow(TR_YesNoMaybe v) {_overflow = v;}
virtual int32_t getPrecision() {return getPrecisionFromValue(TR::getMaxSigned<TR::Int32>());}
protected:
int32_t _low;
TR_YesNoMaybe _overflow;
private:
TR::VPConstraint *getRange(int32_t, int32_t, bool, bool, OMR::ValuePropagation *vp );
};
class VPIntConst : public TR::VPIntConstraint
{
public:
VPIntConst(int32_t v) : TR::VPIntConstraint(v) {}
static TR::VPIntConst *create(OMR::ValuePropagation *vp, int32_t v);
static TR::VPConstraint *createExclusion(OMR::ValuePropagation *vp, int32_t v);
// unsigned createExclusion
//static TR::VPConstraint *createExclusion(OMR::ValuePropagation *vp, int32_t v);
virtual TR::VPIntConst *asIntConst();
virtual int32_t getHigh() {return _low;}
virtual bool mustBeEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
virtual int32_t getPrecision() {return getPrecisionFromValue(_low);}
};
class VPIntRange : public TR::VPIntConstraint
{
public:
VPIntRange(int32_t low, int32_t high) : TR::VPIntConstraint(low), _high(high) {}
//static TR::VPIntConstraint *create(OMR::ValuePropagation *vp, int32_t low, int32_t high);
static TR::VPIntConstraint *create(OMR::ValuePropagation *vp, int32_t low, int32_t high, TR_YesNoMaybe canOverflow = TR_no);
static TR::VPIntConstraint *create(OMR::ValuePropagation *vp, TR::DataTypes dt, TR_YesNoMaybe isUnsigned); // Takes a TR::DataTypes instead of TR::DataType to work around ambiguous overloads
static TR::VPIntConstraint *createWithPrecision(OMR::ValuePropagation *vp, TR::DataType dt, int32_t precision, TR_YesNoMaybe isUnsigned, bool isNonNegative = false);
virtual TR::VPIntRange *asIntRange();
virtual int32_t getHigh() {return _high;}
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
virtual int32_t getPrecision() {return getPrecisionFromRange(_low, _high);}
private:
int32_t _high;
};
class VPLongConstraint : public TR::VPConstraint
{
public:
VPLongConstraint(int64_t v) : TR::VPConstraint(LongPriority) {_low = v; _overflow = TR_no;}
virtual TR::VPLongConstraint *asLongConstraint();
int64_t getLong() {return _low;}
uint64_t getUnsignedLong() {return (uint64_t)_low; }
int64_t getLow() {return _low;}
virtual int64_t getHigh() = 0;
virtual int64_t getLowLong();
virtual int64_t getHighLong();
virtual TR::VPConstraint *merge1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeNotEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeLessThan(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeLessThanOrEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *add(TR::VPConstraint *other, TR::DataType type, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *subtract(TR::VPConstraint *other, TR::DataType type, OMR::ValuePropagation *vp);
virtual TR_YesNoMaybe canOverflow() {return _overflow;}
virtual void setCanOverflow(TR_YesNoMaybe v) {_overflow = v;}
virtual int32_t getPrecision() {return getPrecisionFromValue(TR::getMaxSigned<TR::Int64>());}
protected:
int64_t _low;
TR_YesNoMaybe _overflow;
private:
TR::VPConstraint *getRange(int64_t, int64_t, bool, bool, OMR::ValuePropagation *vp );
};
class VPLongConst : public TR::VPLongConstraint
{
public:
VPLongConst(int64_t v) : TR::VPLongConstraint(v) {}
static TR::VPLongConst *create(OMR::ValuePropagation *vp, int64_t v);
static TR::VPConstraint *createExclusion(OMR::ValuePropagation *vp, int64_t v);
virtual TR::VPLongConst *asLongConst();
virtual int64_t getHigh() {return _low;}
virtual bool mustBeEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
virtual int32_t getPrecision() {return getPrecisionFromValue(_low);}
};
class VPLongRange : public TR::VPLongConstraint
{
public:
VPLongRange(int64_t low, int64_t high) : TR::VPLongConstraint(low), _high(high) {}
static TR::VPLongConstraint *create(OMR::ValuePropagation *vp, int64_t low, int64_t high, bool powerOfTwo = false, TR_YesNoMaybe canOverflow = TR_no);
virtual TR::VPLongRange *asLongRange();
virtual int64_t getHigh() {return _high;}
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
void setIsPowerOfTwo() {_isPowerOfTwo = true;}
bool getIsPowerOfTwo() {return _isPowerOfTwo;}
virtual int32_t getPrecision() {return getPrecisionFromRange(_low, _high);}
private:
int64_t _high;
bool _isPowerOfTwo;
};
class VPClass : public TR::VPConstraint
{
public:
VPClass(TR::VPClassType *type, TR::VPClassPresence *presence, TR::VPPreexistentObject *preexistence,
TR::VPArrayInfo *arrayInfo, TR::VPObjectLocation *location, TR_OpaqueClassBlock *typeHintClass = NULL,
TR::VPUnspecifiedArrayType *unspecifiedArrayType = NULL)
: TR::VPConstraint(ClassPriority), _type(type), _typeHintClass(typeHintClass), _presence(presence),
_preexistence(preexistence), _arrayInfo(arrayInfo), _location(location), _unspecifiedArrayType(unspecifiedArrayType)
{}
static TR::VPConstraint *create(OMR::ValuePropagation *vp, TR::VPClassType *type, TR::VPClassPresence *presence, TR::VPPreexistentObject *preexistence,
TR::VPArrayInfo *arrayInfo, TR::VPObjectLocation *location,
TR_OpaqueClassBlock *typeHintClass = NULL, TR::VPUnspecifiedArrayType *unspecifiedArrayType = NULL);
virtual TR::VPClass *asClass();
virtual TR::VPConstraint *merge1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
void typeIntersect(TR::VPClassPresence* &presence, TR::VPClassType* &type, TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeNotEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool isNullObject();
virtual bool isNonNullObject();
virtual bool isPreexistentObject();
virtual TR_OpaqueClassBlock *getClass();
virtual bool isFixedClass();
virtual bool isConstString();
virtual bool isUnspecifiedArrayType();
virtual TR::VPClassType *getClassType();
virtual TR_OpaqueClassBlock *getTypeHintClass();
virtual TR::VPArrayInfo *getArrayInfo();
virtual TR::VPClassPresence *getClassPresence();
virtual TR::VPPreexistentObject *getPreexistence();
virtual TR::VPObjectLocation *getObjectLocation();
virtual TR::VPConstString *getConstString();
virtual TR::VPKnownObject *getKnownObject();
virtual TR::VPUnspecifiedArrayType *getUnspecifiedArrayType();
virtual TR_YesNoMaybe isStackObject();
virtual TR_YesNoMaybe isHeapObject();
virtual TR_YesNoMaybe isClassObject();
virtual TR_YesNoMaybe isJavaLangClassObject();
virtual TR_YesNoMaybe isJ9ClassObject();
virtual const char *getClassSignature(int32_t &len);
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
static TR_OpaqueClassBlock *intersectTypeHintClasses(TR_OpaqueClassBlock *hint1, TR_OpaqueClassBlock *hint2, OMR::ValuePropagation *vp);
private:
TR::VPClassType *_type; // Conditional on presence. "If the reference is non-null, it has this type info"
/**
* _typeHintClass suggests the value is LIKELY an exact type.
* It could be used along with runtime checks on this speculation for other optimizations.
*
* _typeHintClass is the intersect of the initial typeHintClass and _type._typeHintClass if _type exists
*/
TR_OpaqueClassBlock *_typeHintClass;
TR::VPClassPresence *_presence;
TR::VPPreexistentObject *_preexistence;
TR::VPArrayInfo *_arrayInfo;
TR::VPObjectLocation *_location;
TR::VPUnspecifiedArrayType *_unspecifiedArrayType;
};
class VPClassType : public TR::VPConstraint
{
public:
VPClassType(int32_t p, TR_OpaqueClassBlock *typeHintClass) : TR::VPConstraint(p), _typeHintClass(typeHintClass) {}
static TR::VPClassType *create(OMR::ValuePropagation *vp, TR::SymbolReference *symRef, bool isFixedClass, bool isPointerToClass = false);
static TR::VPClassType *create(OMR::ValuePropagation *vp, const char *sig, int32_t len, TR_ResolvedMethod *method, bool isFixed, TR_OpaqueClassBlock *j9class = 0);
virtual TR::VPClassType *asClassType();
virtual const char *getClassSignature(int32_t &len) = 0;
virtual TR::VPClassType *getClassType();
virtual TR_OpaqueClassBlock *getTypeHintClass();
virtual TR::VPClassType *getArrayClass(OMR::ValuePropagation *vp) = 0;
virtual bool isReferenceArray(TR::Compilation *) = 0;
virtual bool isPrimitiveArray(TR::Compilation *) = 0;
virtual bool isJavaLangObject(OMR::ValuePropagation *vp) {return (_len == 18 && !strncmp(_sig, "Ljava/lang/Object;", 18));}
virtual bool isCloneableOrSerializable();
TR::DataType getPrimitiveArrayDataType();
virtual TR_YesNoMaybe isClassObject();
virtual TR_YesNoMaybe isJavaLangClassObject();
virtual TR_YesNoMaybe isJ9ClassObject();
virtual TR_YesNoMaybe isArray();
TR::VPClassType *classTypesCompatible(TR::VPClassType * otherType, OMR::ValuePropagation *vp);
protected:
TR::VPConstraint *typeIntersectLocation(TR::VPObjectLocation *location, OMR::ValuePropagation *vp);
/**
* _typeHintClass suggests the value is LIKELY an exact type.
* It could be used along with runtime checks on this speculation for other optimizations.
*
* VPResolvedClass::_typeHintClass is the likely sub type of _class
* VPFixedClass::_typeHintClass is _class
* VPUnresolvedClass::_typeHintClass is NULL
*/
TR_OpaqueClassBlock *_typeHintClass;
const char *_sig;
int32_t _len;
};
class VPResolvedClass : public TR::VPClassType
{
public:
VPResolvedClass(TR_OpaqueClassBlock *klass, TR::Compilation *, TR_OpaqueClassBlock *typeHintClass);
VPResolvedClass(TR_OpaqueClassBlock *klass, TR::Compilation *, int32_t p, TR_OpaqueClassBlock *typeHintClass);
static TR::VPResolvedClass *create(OMR::ValuePropagation *vp, TR_OpaqueClassBlock *klass);
virtual TR::VPResolvedClass *asResolvedClass();
virtual TR::VPConstraint *merge1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual const char *getClassSignature(int32_t &len);
virtual TR_OpaqueClassBlock *getClass();
virtual TR::VPClassType *getArrayClass(OMR::ValuePropagation *vp);
virtual bool isReferenceArray(TR::Compilation *);
virtual bool isPrimitiveArray(TR::Compilation *);
bool isJavaLangObject(OMR::ValuePropagation *vp);
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
protected:
TR_OpaqueClassBlock *_class;
};
class VPFixedClass : public TR::VPResolvedClass
{
public:
VPFixedClass(TR_OpaqueClassBlock *klass, TR::Compilation * comp, int32_t p = FixedClassPriority) : TR::VPResolvedClass(klass, comp, p, klass /* typeHintClass */) {}
static TR::VPFixedClass *create(OMR::ValuePropagation *vp, TR_OpaqueClassBlock *klass);
virtual TR::VPFixedClass *asFixedClass();
virtual TR::VPConstraint *merge1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool isFixedClass();
virtual TR::VPClassType *getArrayClass(OMR::ValuePropagation *vp);
virtual TR_YesNoMaybe isArray();
virtual bool hasMoreThanFixedClassInfo(){ return false; }
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
};
class VPConstString : public TR::VPFixedClass
{
protected:
VPConstString(TR_OpaqueClassBlock *klass, TR::Compilation * comp, TR::SymbolReference *symRef)
: TR::VPFixedClass(klass, comp, ConstStringPriority), _symRef(symRef) {}
public:
static TR::VPConstString *create(OMR::ValuePropagation *vp, TR::SymbolReference *symRef);
virtual TR::VPConstString *asConstString();
virtual TR::VPConstString *getConstString(){ return this; }
virtual bool isConstString();
virtual TR::VPConstraint *merge1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeNotEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
uint16_t charAt(int32_t index, TR::Compilation *);
bool getFieldByName(TR::SymbolReference *fieldRef, void* &result, TR::Compilation *);
TR::SymbolReference* getSymRef() {return _symRef;}
virtual bool hasMoreThanFixedClassInfo(){ return true; }
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
protected:
TR::SymbolReference *_symRef;
};
class VPUnresolvedClass : public TR::VPClassType
{
public:
VPUnresolvedClass(const char *sig, int32_t len, TR_ResolvedMethod *method)
: TR::VPClassType(UnresolvedClassPriority, NULL /* typeHintClass */), _method(method)
{_sig = sig; _len = len; _definiteType = false;}
static TR::VPUnresolvedClass *create(OMR::ValuePropagation *vp, const char *sig, int32_t len, TR_ResolvedMethod *method);
virtual TR::VPUnresolvedClass *asUnresolvedClass();
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual const char *getClassSignature(int32_t &len);
virtual TR::VPClassType *getArrayClass(OMR::ValuePropagation *vp);
TR_ResolvedMethod *getOwningMethod() { return _method; }
virtual bool isReferenceArray(TR::Compilation *);
virtual bool isPrimitiveArray(TR::Compilation *);
bool isDefiniteType() {return _definiteType;}
void setDefiniteType(bool b) {_definiteType = b;}
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
TR_ResolvedMethod *getMethod() {return _method; }
private:
TR_ResolvedMethod *_method;
bool _definiteType;
};
class VPUnspecifiedArrayType : public TR::VPConstraint
{
public:
VPUnspecifiedArrayType() : TR::VPConstraint(UnresolvedClassPriority) {}
static TR::VPUnspecifiedArrayType *create(OMR::ValuePropagation *vp);
virtual const char *name();
virtual TR::VPUnspecifiedArrayType *asUnspecifiedArrayType();
virtual bool isUnspecifiedArrayType();
virtual void print(TR::Compilation *, TR::FILE *);
};
class VPClassPresence : public TR::VPConstraint
{
public:
VPClassPresence() : TR::VPConstraint(ClassPresencePriority) {}
virtual TR::VPClassPresence *asClassPresence();
virtual TR::VPClassPresence *getClassPresence();
};
class VPNullObject : public TR::VPClassPresence
{
public:
static TR::VPNullObject *create(OMR::ValuePropagation *vp);
virtual TR::VPNullObject *asNullObject();
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeNotEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool isNullObject();
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
};
class VPNonNullObject : public TR::VPClassPresence
{
public:
static TR::VPNonNullObject *create(OMR::ValuePropagation *vp);
virtual TR::VPNonNullObject *asNonNullObject();
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeNotEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool isNonNullObject();
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
};
class VPPreexistentObject : public TR::VPConstraint
{
public:
VPPreexistentObject(TR_OpaqueClassBlock *c = NULL) : TR::VPConstraint(ClassPreexistencePriority) { _assumptionClass = c;}
static TR::VPPreexistentObject *create(OMR::ValuePropagation *vp, TR_OpaqueClassBlock *c = NULL);
virtual TR::VPPreexistentObject *asPreexistentObject();
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool isPreexistentObject();
virtual TR::VPPreexistentObject *getPreexistence();
TR_OpaqueClassBlock *getAssumptionClass() { return _assumptionClass; }
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
TR_OpaqueClassBlock *_assumptionClass;
};
class VPArrayInfo : public TR::VPConstraint
{
public:
VPArrayInfo(int32_t lowBound, int32_t highBound, int32_t elementSize)
: TR::VPConstraint(ArrayInfoPriority), _lowBound(lowBound), _highBound(highBound), _elementSize(elementSize)
{}
static TR::VPArrayInfo *create(OMR::ValuePropagation *vp, int32_t lowBound, int32_t highBound, int32_t elementSize);
static TR::VPArrayInfo *create(OMR::ValuePropagation *vp, char *sig);
virtual TR::VPArrayInfo *asArrayInfo();
virtual TR::VPConstraint *merge1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPArrayInfo *getArrayInfo();
int32_t lowBound() {return _lowBound;}
int32_t highBound() {return _highBound;}
int32_t elementSize() {return _elementSize;}
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
private:
int32_t _lowBound;
int32_t _highBound;
int32_t _elementSize;
};
/** Constrains the referent (if any) of an address to a set of "locations".
*
* The atomic locations are HeapObject, StackObject, JavaLangClassObject, and
* J9ClassObject. The sets named in VPObjectLocationKind fall into the
* following lattice structure.
*
* \verbatim
top
(implicit in lack of constraint)
|
+----------------+---------------+
| | |
NotClassObject NotStackObject NotHeapObject
| \ / \ / |
| \ / \ / |
| \/ \/ |
| /\ /\ |
| / \ / \ |
| / \ / \ |
HeapObject StackObject ClassObject
| | / \
| | / \
| | J9ClassObject JavaLangClassObject
| | | |
+----------------+-------+------------------+
|
bottom
(either intersection failure
or TR::VPUnreachablePath)
\endverbatim
*
* Note that top and bottom are not represented by instances of this class.
*
* In general we could have other arbitrary sets of the primitive locations,
* e.g. {StackObject, J9ClassObject}, but currently nothing should create them.
*
* \par Warning: interaction with TR::VPClassType
*
* A location constraint that requires the referent to be a representation of a
* class (i.e. JavaLangClassObject, J9ClassObject, or ClassObject) alters the
* interpretation of any TR::VPClassType constraint beside it in an enclosing
* TR::VPClass. In this case the TR::VPClassType constrains the \em represented
* class. rather than the class of which the referent is an instance.
*/
class VPObjectLocation : public TR::VPConstraint
{
public:
enum VPObjectLocationKind
{
HeapObject = 1 << 0,
StackObject = 1 << 1,
JavaLangClassObject = 1 << 2,
J9ClassObject = 1 << 3,
ClassObject = JavaLangClassObject | J9ClassObject,
NotHeapObject = StackObject | ClassObject,
NotStackObject = HeapObject | ClassObject,
NotClassObject = HeapObject | StackObject,
};
static TR::VPObjectLocation *create(OMR::ValuePropagation *vp, VPObjectLocationKind kind);
virtual TR::VPObjectLocation *asObjectLocation();
virtual TR::VPObjectLocation *getObjectLocation();
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *merge1 (TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR_YesNoMaybe isStackObject();
virtual TR_YesNoMaybe isHeapObject();
virtual TR_YesNoMaybe isClassObject();
virtual TR_YesNoMaybe isJavaLangClassObject();
virtual TR_YesNoMaybe isJ9ClassObject();
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
private:
VPObjectLocation(VPObjectLocationKind kind) : TR::VPConstraint(ObjectLocationPriority), _kind(kind) {}
TR_YesNoMaybe isWithin(VPObjectLocationKind area);
static bool isKindSubset(VPObjectLocationKind x, VPObjectLocationKind y)
{
return (x & ~y) == 0;
}
VPObjectLocationKind _kind;
};
class VPKnownObject : public TR::VPFixedClass
{
// IMPORTANT NOTE: Just like with class constraints, TR::VPKnownObject tells
// you "if this reference is non-null, it points at object X". Consumers of
// TR::VPKnownObject must bear in mind that NULL is always a possibility.
//
// This kind of conditional constraint is subtle, but we do it this way
// because it allows us to achieve better optimization. Usages of
// potentially null object references are practically always preceded by
// null checks, and in these cases, constraints that are conditional on
// non-nullness allow us to retain information that would be lost if the
// constraints were required to be unconditional.
//
// We practically always have a TR::VPClass constraint that contains both
// Known Object and isNonNullObject info, and together, these tell us
// reliably that a given reference definitely points at a particular object.
//
// (There are shades of Deductive Reaching Definitions here. This technique
// allows us to preserve information across control merges that would
// otherwise be lost.)
typedef TR::VPFixedClass Super;
protected:
VPKnownObject(TR_OpaqueClassBlock *klass, TR::Compilation * comp, TR::KnownObjectTable::Index index, bool isJavaLangClass)
: TR::VPFixedClass(klass, comp, KnownObjectPriority), _index(index), _isJavaLangClass(isJavaLangClass) {}
static TR::VPKnownObject *create(OMR::ValuePropagation *vp, TR::KnownObjectTable::Index index, bool isJavaLangClass);
public:
static TR::VPKnownObject *create(OMR::ValuePropagation *vp, TR::KnownObjectTable::Index index)
{
return create(vp, index, false);
}
static TR::VPKnownObject *createForJavaLangClass(OMR::ValuePropagation *vp, TR::KnownObjectTable::Index index)
{
return create(vp, index, true);
}
virtual TR::VPKnownObject *asKnownObject();
virtual TR::VPKnownObject *getKnownObject(){ return this; }
TR::KnownObjectTable::Index getIndex(){ return _index; }
virtual TR::VPConstraint *merge1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR_YesNoMaybe isJavaLangClassObject();
bool isArrayWithConstantElements(TR::Compilation * comp);
bool isArrayWithStableElements(TR::Compilation * comp);
virtual bool mustBeEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool mustBeNotEqual(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual bool hasMoreThanFixedClassInfo(){ return true; }
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
protected:
TR::KnownObjectTable::Index _index;
bool _isJavaLangClass;
};
/*
class VPImplementedInterface : public TR::VPConstraint
{
public:
static TR::VPImplementedInterface *create(OMR::ValuePropagation *vp, char *sig, int32_t len, TR_ResolvedMethod *method);
VPImplementedInterface(char *sig, int32_t len, TR_ResolvedMethod *method)
: _method(method)
{_sig = sig; _len = len;}
virtual TR::VPImplementedInterface *asImplementedInterface();
virtual TR::VPConstraint *intersect1(TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual TR::VPConstraint *merge1 (TR::VPConstraint *other, OMR::ValuePropagation *vp);
virtual char *getInterfaceSignature(int32_t &len);
virtual void print(TR::Compilation *, TR::FILE *);
virtual const char *name();
private:
TR_ResolvedMethod *_method;