-
Notifications
You must be signed in to change notification settings - Fork 392
/
ValueNumberInfo.cpp
1812 lines (1619 loc) · 58.8 KB
/
ValueNumberInfo.cpp
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
*******************************************************************************/
#include "optimizer/ValueNumberInfo.hpp"
#include <stdint.h>
#include <string.h>
#include "codegen/CodeGenerator.hpp"
#include "compile/Compilation.hpp"
#include "control/Options.hpp"
#include "control/Options_inlines.hpp"
#include "cs2/bitvectr.h"
#include "cs2/hashtab.h"
#include "env/StackMemoryRegion.hpp"
#include "env/TRMemory.hpp"
#include "env/jittypes.h"
#include "il/DataTypes.hpp"
#include "il/ILOpCodes.hpp"
#include "il/ILOps.hpp"
#include "il/Node.hpp"
#include "il/Node_inlines.hpp"
#include "il/ParameterSymbol.hpp"
#include "il/ResolvedMethodSymbol.hpp"
#include "il/Symbol.hpp"
#include "il/SymbolReference.hpp"
#include "il/TreeTop.hpp"
#include "il/TreeTop_inlines.hpp"
#include "infra/Array.hpp"
#include "infra/Assert.hpp"
#include "infra/BitVector.hpp"
#include "infra/List.hpp"
#include "optimizer/Optimizer.hpp"
#include "optimizer/UseDefInfo.hpp"
#include "ras/Debug.hpp"
TR_ValueNumberInfo::TR_ValueNumberInfo(TR::Compilation *comp)
: _compilation(comp),
_nodes(comp->allocator()),
_valueNumbers(comp->allocator()),
_nextInRing(comp->allocator())
{}
TR_ValueNumberInfo::TR_ValueNumberInfo(TR::Compilation *comp, TR::Optimizer *optimizer, bool requiresGlobals, bool prefersGlobals, bool noUseDefInfo)
: _compilation(comp),
_optimizer(optimizer),
_trace(comp->getOption(TR_TraceValueNumbers)),
_nodes(comp->allocator()),
_valueNumbers(comp->allocator()),
_nextInRing(comp->allocator())
{
dumpOptDetails(comp, "PREPARTITION VN (Building value number info)\n");
// For now, don't allow global value numbering because of
// threads-changing-fields problems.
//
TR_ASSERT(!(requiresGlobals || prefersGlobals), "Don't do global value numbering");
if (trace())
traceMsg(comp, "Starting ValueNumbering %s\n", noUseDefInfo ? "without UseDefInfo" : "");
if (noUseDefInfo)
{
_useDefInfo = NULL;
}
else
{
// Make sure we have valid use/def info
//
_useDefInfo = _optimizer->getUseDefInfo();
if (_useDefInfo && requiresGlobals && !_useDefInfo->hasGlobalsUseDefs())
_useDefInfo = NULL;
if (_useDefInfo == NULL && !_optimizer->cantBuildLocalsUseDefInfo())
{
if (!(requiresGlobals && _optimizer->cantBuildGlobalsUseDefInfo()))
{
TR::LexicalMemProfiler mp("use defs (value numbers - I)", comp->phaseMemProfiler());
_useDefInfo = optimizer->createUseDefInfo(comp, requiresGlobals, prefersGlobals);
if (_useDefInfo->infoIsValid())
{
_optimizer->setUseDefInfo(_useDefInfo);
}
else
{
// release storage for failed _useDefInfo
delete _useDefInfo;
_useDefInfo = NULL;
}
}
}
if (_useDefInfo == NULL)
{
if (trace())
traceMsg(comp, "Can't perform ValueNumbering, no use/def info\n");
_infoIsValid = false;
_optimizer->setCantBuildGlobalsValueNumberInfo(true);
if (!requiresGlobals)
_optimizer->setCantBuildLocalsValueNumberInfo(true);
return;
}
_useDefInfo->buildDefUseInfo(true);
}
_infoIsValid = true;
_hasGlobalsValueNumbers = requiresGlobals;
_numberOfNodes = comp->getNodeCount();
TR::TreeTop *treeTop;
if (trace())
{
traceMsg(comp, "\nTrees for value numbering\n\n");
comp->incVisitCount();
for (treeTop = comp->getStartTree(); treeTop; treeTop = treeTop->getNextTreeTop())
{
comp->getDebug()->print(comp->getOutFile(), treeTop);
}
traceMsg(comp, "\n\n");
}
_nodes.GrowTo(_numberOfNodes);
_valueNumbers.GrowTo(_numberOfNodes);
_nextInRing.GrowTo(_numberOfNodes);
// Any stack allocations past this point will die when the function returns
TR::StackMemoryRegion stackMemoryRegion(*trMemory());
// Allocate hash table for nodes
//
_hashTable._numBuckets = 1023;
_hashTable._buckets = (CollisionEntry**)trMemory()->allocateStackMemory(_hashTable._numBuckets*sizeof(CollisionEntry*), TR_Memory::ValueNumberInfo);
memset(_hashTable._buckets, 0, _hashTable._numBuckets*sizeof(CollisionEntry*));
_matchingNodes = new (trStackMemory()) TR_Array<CollisionEntry*>(trMemory(), _numberOfNodes, false, stackAlloc);
_matchingNodes->setSize(_numberOfNodes);
buildValueNumberInfo();
int32_t i;
if (trace())
{
// Show shared value numbers
//
TR_BitVector traced(_numberOfNodes,trMemory(), stackAlloc);
for (i = 0; i < _numberOfNodes; i++)
{
TR::Node *node = getNode(i);
if (node == NULL || traced.get(node->getGlobalIndex()))
continue;
if (getNext(node) == node)
continue;
traceMsg(comp, " Nodes sharing value number %d:", getValueNumber(node));
TR::Node *next = node;
do
{
traced.set(next->getGlobalIndex());
traceMsg(comp, " %d", next->getGlobalIndex());
next = getNext(next);
} while(next != node);
traceMsg(comp, "\n");
}
traceMsg(comp, "\nEnding ValueNumbering\n");
// Get hash table statistics
//
int32_t numEntries = 0;
int32_t numBucketsUsed = 0;
int32_t maxBucketSize = 0;
for (i = _hashTable._numBuckets-1; i >= 0; i--)
{
if (_hashTable._buckets[i] != NULL)
{
numBucketsUsed++;
int32_t numInBucket = 0;
for (CollisionEntry *entry = _hashTable._buckets[i]; entry; entry = entry->_next)
for (NodeEntry *nodeEntry = entry->_nodes; nodeEntry; nodeEntry = nodeEntry->_next)
numInBucket++;
numEntries += numInBucket;
if (numInBucket > maxBucketSize)
maxBucketSize = numInBucket;
}
}
traceMsg(comp, " HashTable entries = %d, buckets used = %d, max bucket size = %d\n",numEntries,numBucketsUsed,maxBucketSize);
}
if (trace())
{
traceMsg(comp, "\n\nValue Number Table\n\n");
for (i = 0; i < _numberOfNodes; i++)
{
TR::Node *node = getNode(i);
if (node == NULL)
continue;
traceMsg(comp, "node %4d [%p] has value number %4d", i, node, getValueNumber(node));
if (getNext(node) != node)
{
traceMsg(comp, ", shared with ");
for (TR::Node *next = getNext(node); next != node; next = getNext(next))
traceMsg(comp, " %d", next->getGlobalIndex());
}
traceMsg(comp, "\n");
}
}
}
void TR_ValueNumberInfo::buildValueNumberInfo()
{
// Allocate parameter entry value numbers starting at 1. Parameters are given
// the first value numbers so that their value number on entry can be
// derived from the parameter ordinal value.
//
_nextValue = 1;
allocateParmValueNumbers();
// Initialize value number information.
// During the process non-shareable nodes are each given a unique negative
// value, except those that are also def points - these value numbers can
// actually be shared with use points so they have to be in the range of
// shareable value numbers.
//
int32_t negativeValueNumber = -3;
TR::TreeTop * treeTop;
for (treeTop = comp()->getStartTree(); treeTop; treeTop = treeTop->getNextTreeTop())
{
initializeNode(treeTop->getNode(), negativeValueNumber);
}
// Allocate shareable value numbers, using the next available (positive)
// value numbers. The next available value number after this is ldone gives
// the number of shareable value numbers.
//
allocateShareableValueNumbers();
_numberOfShareableValues = _nextValue;
// Reassign value numbers for non-shareable nodes.
// This gives shareable nodes the lowest value numbers, followed by
// non-shareable node.
//
allocateNonShareableValueNumbers();
}
bool TR_ValueNumberInfo::congruentNodes(TR::Node * node, TR::Node * entryNode)
{
#ifdef J9_PROJECT_SPECIFIC
if (node->getOpCode().isSetSignOnNode() && node->getSetSign() != entryNode->getSetSign())
return false;
if (node->getType().isBCD())
{
if (!node->isDecimalSizeAndShapeEquivalent(entryNode))
{
if (trace())
traceMsg(comp(),"BCD node %s (%p) and BCD entryNode %s (%p) have size/shape mismatch -- do not consider as matching\n",
node->getOpCode().getName(),node,
entryNode->getOpCode().getName(),entryNode);
return false;
}
if (!node->isSignStateEquivalent(entryNode))
{
if (trace() || comp()->cg()->traceBCDCodeGen())
traceMsg(comp(),"x^x : BCD node %s (%p) and BCD entryNode %s (%p) have sign state mismatch -- do not consider as matching\n",
node->getOpCode().getName(),node,
entryNode->getOpCode().getName(),entryNode);
return false;
}
}
else if (node->getOpCode().isConversionWithFraction() &&
node->getDecimalFraction() != entryNode->getDecimalFraction())
{
if (trace())
traceMsg(comp(),"fracConv node %s (%p) and fracConv entryNode %s (%p) have fraction mismatch -- do not consider as matching\n",
node->getOpCode().getName(),node,
entryNode->getOpCode().getName(),entryNode);
return false;
}
else if (node->chkOpsCastedToBCD() &&
node->castedToBCD() != entryNode->castedToBCD())
{
if (trace())
traceMsg(comp(),"castedToBCD mismatch : node %s (%p) castedToBCD %d and entryNode %s (%p) castedToBCD %d -- do not consider as matching\n",
node->getOpCode().getName(),node,node->castedToBCD(),entryNode->getOpCode().getName(),entryNode,entryNode->castedToBCD());
return false;
}
#endif
// Check for loads of constants. They're much like isLoadConst.
//
if ( node->getOpCode().isLoadVar()
&& node->getSymbolReference() == entryNode->getSymbolReference()
&& ( node->getSymbol()->isConst()
|| node->getSymbol()->isConstObjectRef()))
{
return true;
}
/*
// Share chains for loads and stores, since they won't be matched with
// other nodes in the chain.
//
if (node->getOpCode().isStore() ||
node->getOpCode().isLoadVar())
return true;
*/
if (node->getOpCode().hasSymbolReference())
{
TR::SymbolReference *symRef = node->getSymbolReference();
TR::SymbolReference *entrySymRef = entryNode->getSymbolReference();
if (symRef && entrySymRef &&
symRef->getSymbol() == entrySymRef->getSymbol() &&
symRef->getOffset() == entrySymRef->getOffset())
{
uint16_t udIndex = node->getUseDefIndex();
uint16_t entryUdIndex = entryNode->getUseDefIndex();
if (!_useDefInfo || !_useDefInfo->isUseIndex(udIndex))
return true;
TR_ASSERT(_useDefInfo->isUseIndex(entryUdIndex), "Expecting use index");
//
// In rare cases when Jsrs exist in the method, use def info could be NULL
//
TR_UseDefInfo::BitVector udef(comp()->allocator());
TR_UseDefInfo::BitVector entryudef(comp()->allocator());
if (_useDefInfo->getUseDef(udef, udIndex) && _useDefInfo->getUseDef(entryudef, entryUdIndex))
{
return (udef == entryudef);
}
else
{
if (trace())
TR_ASSERT(0, "No defs for a use\n");
}
}
}
if (node->getOpCode().isLoadConst())
{
bool isSame = false;
switch (node->getDataType())
{
case TR::Int8: isSame = (node->getByte() == entryNode->getByte()); break;
case TR::Int16: isSame = (node->getShortInt() == entryNode->getShortInt()); break;
case TR::Int32: isSame = (node->getInt() == entryNode->getInt()); break;
case TR::Float: isSame = (node->getFloatBits() == entryNode->getFloatBits()); break;
case TR::Int64:
case TR::Double: isSame = (node->getLongInt() == entryNode->getLongInt()); break;
case TR::Address:isSame = (node->getAddress() == entryNode->getAddress()); break;
default:
{
if (
#ifdef J9_PROJECT_SPECIFIC
node->getType().isBCD() ||
#endif
node->getType().isAggregate())
{
isSame = _optimizer->areNodesEquivalent(node, entryNode);
}
else
{
isSame = false;
}
}
}
return isSame;
}
else if (node->getOpCode().isArrayLength())
{
int32_t nodeStride = node->getArrayStride();
int32_t entryNodeStride = entryNode->getArrayStride();
return(nodeStride == entryNodeStride);
}
else
return true;
}
void TR_ValueNumberInfo::initializeNode(TR::Node *node, int32_t &negativeValueNumber)
{
int32_t index = node->getGlobalIndex();
if (_nodes.ElementAt(index) != NULL)
{
// Node has already been initialized
//
TR_ASSERT(_nodes.ElementAt(index) == node,"Value Numbering initialization error");
return;
}
_nodes.ElementAt(index) = node;
_nextInRing.ElementAt(index) = index;
// Initialize the children
for (int32_t i = 0; i < node->getNumChildren(); i++)
initializeNode(node->getChild(i), negativeValueNumber);
// For a non-shareable node, just allocate the value number now and return
//
if (!canShareValueNumber(node))
{
if (_useDefInfo && node->getUseDefIndex())
_valueNumbers.ElementAt(index) = _nextValue++;
else
_valueNumbers.ElementAt(index) = negativeValueNumber--;
return;
}
// For a shareable node add the node to the hashtable, collecting together
// like nodes into chains.
// TODO: replace this with a call to congruentNodes
_valueNumbers.ElementAt(index) = -1;
int32_t hashValue = hash(node);
NodeEntry *newEntry = new (trStackMemory()) NodeEntry;
newEntry->_node = node;
CollisionEntry *entry;
for (entry = _hashTable._buckets[hashValue]; entry; entry = entry->_next)
{
TR::Node *entryNode = entry->_nodes->_node;
if (node->getOpCodeValue() != entryNode->getOpCodeValue() ||
node->getNumChildren() != entryNode->getNumChildren())
continue;
#ifdef J9_PROJECT_SPECIFIC
if (node->getOpCode().isSetSignOnNode() && node->getSetSign() != entryNode->getSetSign())
{
if (trace())
traceMsg(comp(), "Nodes %s (%p) and entryNode %s (%p) with setSignOnNode have sign mismatch -- do not consider as matching\n",
node->getOpCode().getName(),node,
entryNode->getOpCode().getName(),entryNode);
continue;
}
if (node->getType().isBCD())
{
if (!node->isDecimalSizeAndShapeEquivalent(entryNode))
{
if (trace())
traceMsg(comp(),"BCD node %s (%p) and BCD entryNode %s (%p) have size/shape mismatch -- do not consider as matching\n",
node->getOpCode().getName(),node,
entryNode->getOpCode().getName(),entryNode);
continue;
}
if (!node->isSignStateEquivalent(entryNode))
{
if (trace() || comp()->cg()->traceBCDCodeGen())
traceMsg(comp(),"x^x : BCD node %s (%p) and BCD entryNode %s (%p) have sign state mismatch -- do not consider as matching\n",
node->getOpCode().getName(),node,
entryNode->getOpCode().getName(),entryNode);
continue;
}
}
else if (node->getOpCode().isConversionWithFraction() &&
node->getDecimalFraction() != entryNode->getDecimalFraction())
{
if (trace())
traceMsg(comp(),"fracConv node %s (%p) and fracConv entryNode %s (%p) have fraction mismatch -- do not consider as matching\n",
node->getOpCode().getName(),node,
entryNode->getOpCode().getName(),entryNode);
continue;
}
else if (node->chkOpsCastedToBCD() &&
node->castedToBCD() != entryNode->castedToBCD())
{
if (trace())
traceMsg(comp(),"castedToBCD mismatch : node %s (%p) castedToBCD %d and entryNode %s (%p) castedToBCD %d -- do not consider as matching\n",
node->getOpCode().getName(),node,node->castedToBCD(),entryNode->getOpCode().getName(),entryNode,entryNode->castedToBCD());
continue;
}
#endif
// Check for loads of constants. They're much like isLoadConst.
//
if ( node->getOpCode().isLoadVar()
&& node->getSymbolReference() == entryNode->getSymbolReference()
&& ( node->getSymbol()->isConst()
|| node->getSymbol()->isConstObjectRef()))
{
break;
}
// Share chains for loads and stores, since they won't be matched with
// other nodes in the chain.
//
if (node->getOpCode().isStore() ||
node->getOpCode().isLoadVar())
break;
if (node->getOpCode().hasSymbolReference())
{
TR::SymbolReference *symRef = node->getSymbolReference();
TR::SymbolReference *entrySymRef = entryNode->getSymbolReference();
if (symRef && entrySymRef &&
symRef->getSymbol() == entrySymRef->getSymbol() &&
symRef->getOffset() == entrySymRef->getOffset())
{
uint16_t udIndex = node->getUseDefIndex();
uint16_t entryUdIndex = entryNode->getUseDefIndex();
if (!_useDefInfo || !_useDefInfo->isUseIndex(udIndex))
break;
TR_ASSERT(_useDefInfo->isUseIndex(entryUdIndex), "Expecting use index");
//
// In rare cases when Jsrs exist in the method, use def info could be NULL
//
TR_UseDefInfo::BitVector udef(comp()->allocator());
TR_UseDefInfo::BitVector entryudef(comp()->allocator());
if (_useDefInfo->getUseDef(udef, udIndex) && _useDefInfo->getUseDef(entryudef, entryUdIndex))
{
if (udef == entryudef)
{
break;
}
}
else
{
if (trace())
TR_ASSERT(0, "No defs for a use\n");
}
}
}
else if (node->getOpCode().isLoadConst())
{
bool isSame = false;
switch (node->getDataType())
{
case TR::Int8: isSame = (node->getByte() == entryNode->getByte()); break;
case TR::Int16: isSame = (node->getShortInt() == entryNode->getShortInt()); break;
case TR::Int32: isSame = (node->getInt() == entryNode->getInt()); break;
case TR::Float: isSame = (node->getFloatBits() == entryNode->getFloatBits()); break;
case TR::Int64:
case TR::Double: isSame = (node->getLongInt() == entryNode->getLongInt()); break;
case TR::Address:isSame = (node->getAddress() == entryNode->getAddress()); break;
default:
{
if (
#ifdef J9_PROJECT_SPECIFIC
node->getType().isBCD() ||
#endif
node->getType().isAggregate())
{
isSame = _optimizer->areNodesEquivalent(node, entryNode);
}
else
{
isSame = false;
}
}
}
if (isSame)
break;
}
else if (node->getOpCode().isArrayLength())
{
int32_t nodeStride = node->getArrayStride();
int32_t entryNodeStride = entryNode->getArrayStride();
if (nodeStride == entryNodeStride)
break;
}
else
break;
}
if (entry)
{
newEntry->_next = entry->_nodes;
entry->_nodes = newEntry;
}
else
{
entry = new (trStackMemory()) CollisionEntry;
entry->_nodes = newEntry;
newEntry->_next = NULL;
entry->_next = _hashTable._buckets[hashValue];
_hashTable._buckets[hashValue] = entry;
}
_matchingNodes->element(index) = entry;
}
/**
* Hash on the opcode, number of children, and symbol information
*/
int32_t TR_ValueNumberInfo::hash(TR::Node *node)
{
uint32_t h, g;
int32_t numChildren = node->getNumChildren();
h = (node->getOpCodeValue() << 16) + numChildren;
g = h & 0xF0000000;
h ^= g >> 24;
if (node->getOpCode().hasSymbolReference())
{
TR::SymbolReference *symRef = node->getSymbolReference();
if (symRef)
{
TR::Symbol *sym = symRef->getSymbol();
h = (h << 4) + (int32_t)(intptr_t)sym;
g = h & 0xF0000000;
h ^= g >> 24;
h = (h << 4) + static_cast<uint32_t>(symRef->getOffset());
g = h & 0xF0000000;
h ^= g >> 24;
}
}
else if (node->getOpCode().isLoadConst())
{
if (node->getOpCode().is8Byte())
{
h = (h << 4) + node->getLongIntHigh();
g = h & 0xF0000000;
h ^= g >> 24;
h = (h << 4) + node->getLongIntLow();
g = h & 0xF0000000;
h ^= g >> 24;
}
else
{
h = (h << 4) + (node->getOpCodeValue() == TR::fconst ? node->getFloatBits() : node->getInt());
g = h & 0xF0000000;
h ^= g >> 24;
}
}
return (h ^ g) % _hashTable._numBuckets;
}
/**
* Non-shareable nodes already have a negative value number assigned.
* Change their value numbers to be positive.
*/
void TR_ValueNumberInfo::allocateNonShareableValueNumbers()
{
int32_t maxValue = _nextValue-1;
for (int32_t i = 0; i < _numberOfNodes; ++i)
{
int32_t value = _valueNumbers.ElementAt(i);
if (value <= -3)
{
value = _nextValue - value - 2;
_valueNumbers.ElementAt(i) = value;
if (value > maxValue)
maxValue = value;
}
}
_nextValue = maxValue + 1;
}
void TR_ValueNumberInfo::allocateParmValueNumbers()
{
_numberOfParms = 0;
TR::ResolvedMethodSymbol *method = _compilation->getMethodSymbol();
TR::ParameterSymbol *p;
ListIterator<TR::ParameterSymbol> parms(&method->getParameterList());
for (p = parms.getFirst(); p; p = parms.getNext())
{
_numberOfParms++;
}
if (_numberOfParms > 0)
{
_parmSymbols = (TR::ParameterSymbol**)trMemory()->allocateHeapMemory(_numberOfParms*sizeof(TR::ParameterSymbol*), TR_Memory::ValueNumberInfo);
parms.reset();
int32_t i = 0;
for (p = parms.getFirst(); p; p = parms.getNext())
{
_parmSymbols[i++] = p;
}
}
else
_parmSymbols = NULL;
_nextValue += _numberOfParms;
}
/**
* Non-shareable nodes already have a value number assigned.
* Shareable nodes are all added to the hash table, so just go through the
* table and allocate value numbers.
* Value numbers for pre-requisite nodes are allocated by recursing.
*/
void TR_ValueNumberInfo::allocateShareableValueNumbers()
{
_recursionDepth = 0;
vcount_t visitCount = _compilation->incVisitCount();
TR::TreeTop *treeTop = _compilation->getStartTree();
while (treeTop)
{
allocateValueNumber(treeTop->getNode(), visitCount);
treeTop = treeTop->getNextTreeTop();
}
}
void TR_ValueNumberInfo::allocateValueNumber(TR::Node *node, vcount_t visitCount)
{
if (node->getVisitCount() == visitCount)
return;
node->setVisitCount(visitCount);
// Make sure all the children have been given value numbers
//
int32_t i;
for (i = node->getNumChildren()-1; i >= 0; --i)
allocateValueNumber(node->getChild(i), visitCount);
if (canShareValueNumber(node))
allocateValueNumber(node);
}
bool TR_ValueNumberInfo::canShareValueNumber(TR::Node *node)
{
if (node->getOpCode().canShareValueNumber() &&
!node->getOpCode().isResolveCheck() &&
!node->hasUnresolvedSymbolReference())
{
return true;
}
return false;
}
void TR_ValueNumberInfo::allocateValueNumber(TR::Node *node)
{
int32_t index = node->getGlobalIndex();
if (_valueNumbers.ElementAt(index) >= 0 ||
_valueNumbers.ElementAt(index) <= -3)
return;
// To prevent infinite recursion, mark this node as being processed
//
_valueNumbers.ElementAt(index) = -2;
#if DEBUG
if (trace())
{
traceMsg(comp(), "Processing node %d at depth %d\n",index,_recursionDepth);
}
#endif
++_recursionDepth;
// Make sure all the children have been given value numbers
//
int32_t i;
for (i = node->getNumChildren()-1; i >= 0; --i)
{
if (_valueNumbers.ElementAt(node->getChild(i)->getGlobalIndex()) != -2)
allocateValueNumber(node->getChild(i));
}
// This node may now have been given a value due to recursion
//
if (_valueNumbers.ElementAt(index) >= 0)
{
--_recursionDepth;
#if DEBUG
if (trace())
{
traceMsg(comp(), "Value of node %d at depth %d is %d\n",index,_recursionDepth,_valueNumbers.ElementAt(index));
}
#endif
return;
}
bool removeFromHashTable = false;
CollisionEntry *head = _matchingNodes->element(index);
NodeEntry *entry;
// If this is a store node give it the value number of the node being
// assigned.
//
if (node->getOpCode().isStore())
{
int32_t valueIndex = node->getOpCode().isIndirect() ? 1 : 0;
TR::Node *valueChild = node->getChild(valueIndex);
allocateValueNumber(valueChild);
// This node may now have been given a value due to recursion
//
if (_valueNumbers.ElementAt(index) >= 0)
{
--_recursionDepth;
#if DEBUG
if (trace())
{
traceMsg(comp(), "Value of node %d at depth %d is %d\n",index,_recursionDepth,_valueNumbers.ElementAt(index));
}
#endif
return;
}
// This node must be given a shareable value number. If the child has a
// non-shareable value number, give it a shareable one, and then also
// give it to this store.
//
if (getVN(valueChild) <= -3)
changeValueNumber(valueChild, _nextValue++);
setValueNumber(node, valueChild);
// The store will never be matched from the hash table, so just remove
// it from the table.
//
removeFromHashTable = true;
}
// If this is a load node, see if all the defs have the same value number.
// If so, give the node that value number.
//
else if (node->getOpCode().isLoadVar()
&& !( node->getSymbol()->isConst()
|| node->getSymbol()->isConstObjectRef()))
{
TR::Node * defNode = getValueNumberForLoad(node);
// This node may now have been given a value due to recursion
//
if (_valueNumbers.ElementAt(index) >= 0)
{
--_recursionDepth;
#if DEBUG
if (trace())
{
traceMsg(comp(), "Value of node %d at depth %d is %d\n",index,_recursionDepth,_valueNumbers.ElementAt(index));
}
#endif
return;
}
if (defNode)
setValueNumber(node, defNode);
else
changeValueNumber(node, _nextValue++);
// The load will never be matched from the hash table, so just remove
// it from the table.
//
removeFromHashTable = true;
}
// For all other nodes look to see if there is another node whose children
// all have the same value number. If so, use its value number.
//
else
{
int32_t numChildren = node->getNumChildren();
for (entry = head->_nodes; entry; entry = entry->_next)
{
TR::Node *entryNode = entry->_node;
int32_t entryValue = getVN(entryNode);
if (entryValue < 0)
break;
if (node->getOpCode().hasSymbolReference())
{
// Nodes with symrefs only match other nodes with the same symref
//
if (!entryNode->getOpCode().hasSymbolReference())
continue;
if (node->getSymbolReference() != entryNode->getSymbolReference())
continue;
}
if (numChildren > 0)
{
for (i = numChildren-1; i >= 0; --i)
{
int32_t v1 = getVN(node->getChild(i));
int32_t v2 = getVN(entryNode->getChild(i));
if ((v1 < 0) || (v2 < 0))
break;
///if (getVN(node->getChild(i)) != getVN(entryNode->getChild(i)))
if (v1 != v2)
break;
}
if (i >= 0)
continue;
}
// A match found - we can reuse the value number of this other node. At the
// same time, remove this node from the node chain.
//
setValueNumber(node, entryNode);
NodeEntry *next;
for (next = entry->_next ; next->_node != node; entry = next, next = next->_next)
{}
entry->_next = next->_next;
--_recursionDepth;
#if DEBUG
if (trace())
{
traceMsg(comp(), "Value of node %d at depth %d is %d\n",index,_recursionDepth,_valueNumbers.ElementAt(index));
}
#endif
return;
}
// No match found - assign a new value number to this node.
//
changeValueNumber(node, _nextValue++);
}
// Find the node in its hash entry chain and de-chain it. If it is not to be
// removed from the table, put it back at the head of the chain.
//
NodeEntry *prev;
for (entry = head->_nodes, prev = NULL; entry->_node != node; prev = entry, entry = entry->_next)
{}
if (prev)
{
prev->_next = entry->_next;
if (!removeFromHashTable)
{
entry->_next = head->_nodes;
head->_nodes = entry;
}
}
else
{
if (removeFromHashTable)
head->_nodes = entry->_next;
}
--_recursionDepth;
#if DEBUG
if (trace())
{
traceMsg(comp(), "Value of node %d at depth %d is %d\n",index,_recursionDepth,_valueNumbers.ElementAt(index));
}
#endif
}
TR::Node *TR_ValueNumberInfo::getValueNumberForLoad(TR::Node *node)
{
uint16_t useDefIndex = node->getUseDefIndex();
if (!_useDefInfo ||
!_useDefInfo->isUseIndex(useDefIndex) ||
(_recursionDepth > 50))
return NULL;
TR_BitVectorIterator bvi;
TR::Node *defNode = NULL;
int32_t index = 0;
int32_t baseVN = node->getOpCode().isIndirect() ? getVN(node->getFirstChild()) : -1;
int32_t value = 0;
int32_t defValue = 0;
// If there is a single def node which is really another load that matches
// this one and dominates it, use the value number of that load.
//
defNode = _useDefInfo->getSingleDefiningLoad(node);
if (defNode)
{
TR_ASSERT(defNode->getOpCode().isLoadVar(), "Defining load is not a load");
allocateValueNumber(defNode);
if (baseVN == -1 || (defNode->getOpCode().isIndirect() && baseVN == getVN(defNode->getFirstChild())))
{
// If this node now has a value number, we can equate the value numbers
// of it and its dominating load
//
value = getVN(node);
if (value >= 0)
{
defValue = getVN(defNode);
if (value != defValue)
changeValueNumber(node, defValue);
if (trace())
{
traceMsg(comp(), " Change value number for load %d at [%p] to value number %d of dominating load %d at [%p]\n", node->getGlobalIndex(), node, defValue, defNode->getGlobalIndex(), defNode);
}
return NULL;
}