-
Notifications
You must be signed in to change notification settings - Fork 392
/
UseDefInfo.cpp
2983 lines (2609 loc) · 103 KB
/
UseDefInfo.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/UseDefInfo.hpp"
#include <limits.h>
#include <stddef.h>
#include <stdint.h>
#include "codegen/CodeGenerator.hpp"
#include "env/FrontEnd.hpp"
#include "compile/Compilation.hpp"
#include "compile/Method.hpp"
#include "compile/SymbolReferenceTable.hpp"
#include "control/Options.hpp"
#include "control/Options_inlines.hpp"
#include "cs2/allocator.h"
#include "cs2/bitvectr.h"
#include "cs2/hashtab.h"
#include "cs2/sparsrbit.h"
#include "env/TRMemory.hpp"
#include "il/AliasSetInterface.hpp"
#include "il/Block.hpp"
#include "il/DataTypes.hpp"
#include "il/ILOpCodes.hpp"
#include "il/ILOps.hpp"
#include "il/MethodSymbol.hpp"
#include "il/Node.hpp"
#include "il/Node_inlines.hpp"
#include "il/ResolvedMethodSymbol.hpp"
#include "il/StaticSymbol.hpp"
#include "il/Symbol.hpp"
#include "il/SymbolReference.hpp"
#include "il/TreeTop.hpp"
#include "il/TreeTop_inlines.hpp"
#include "infra/Assert.hpp"
#include "infra/BitVector.hpp"
#include "infra/Cfg.hpp"
#include "infra/List.hpp"
#include "infra/CfgNode.hpp"
#include "optimizer/CallInfo.hpp"
#include "optimizer/Optimizer.hpp"
#include "optimizer/DataFlowAnalysis.hpp"
#include "optimizer/ValueNumberInfo.hpp"
#define MAX_EXPANDED_DEF_OR_USE_NODES (65000)
#define MAX_DEF_BY_USE_NODES_FOR_LOW_OPT (10000000)
#define MAX_DEF_BY_USE_NODES_FOR_HIGH_OPT (INT_MAX/100-1) // will be multiplied by 100 for big methods
#define MAX_SYMBOLS USHRT_MAX
#define MAX_EXPANDED_TOTAL_NODES USHRT_MAX
#define SIDE_TABLE_LIMIT (USHRT_MAX)
#define REACHING_DEFS_LIMIT (25000000) // 25 Million
/**
* Constructs TR_UseDefInfo instance. Note that this should not be called directly.
* Instead construction is handled by OMR::Optimizer::createUseDefInfo() method.
*
* @param cfg The compilation instance
* @param requiresGlobals
* @param prefersGlobals
* @param loadsShouldBeDefs
* @param cannotOmitTrivialDefs
* @param conversionRegsOnly
* @param doCompletion
* @param callsShouldBeUses Enables inclusion of calls as uses so that the alias analysis can detect
* when local (stack) variable has been aliased by a function call.
* A value of false is fine for Java like languages where
* local (stack) variables cannot be passed by reference to function calls
* and hence cannot be aliased. However for C like languages this flag should be
* set to true.
*/
TR_UseDefInfo::TR_UseDefInfo(TR::Compilation *comp, TR::CFG *cfg, TR::Optimizer *optimizer,
bool requiresGlobals, bool prefersGlobals, bool loadsShouldBeDefs, bool cannotOmitTrivialDefs, bool conversionRegsOnly,
bool doCompletion, bool callsShouldBeUses)
: _region(comp->trMemory()->heapMemoryRegion()),
_compilation(comp),
_optimizer(optimizer),
_atoms(0, std::make_pair<TR::Node *, TR::TreeTop *>(NULL, NULL), _region),
_useDefForMemorySymbols(false),
_useDefInfo(0, TR_UseDefInfo::BitVector(comp->allocator()), _region),
_isUseDefInfoValid(false),
_infoCache(_region),
_EMPTY(comp->allocator()),
_useDerefDefInfo(0, static_cast<const BitVector *>(NULL), _region),
_defUseInfo(0, TR_UseDefInfo::BitVector(comp->allocator()), _region),
_loadDefUseInfo(0, TR_UseDefInfo::BitVector(comp->allocator()), _region),
_tempsOnly(false),
_trace(comp->getOption(TR_TraceUseDefs)),
_hasLoadsAsDefs(loadsShouldBeDefs),
_hasCallsAsUses(callsShouldBeUses),
_useDefs(0, _region),
_numMemorySymbols(0),
_valueNumbersToMemorySymbolsMap(0, static_cast<MemorySymbolList *>(NULL), _region),
_sideTableToSymRefNumMap(comp->getSymRefCount(), _region),
_cfg(cfg),
_valueNumberInfo(NULL)
{
if (doCompletion)
prepareUseDefInfo(requiresGlobals, prefersGlobals, cannotOmitTrivialDefs, conversionRegsOnly);
}
void TR_UseDefInfo::prepareUseDefInfo(bool requiresGlobals, bool prefersGlobals, bool cannotOmitTrivialDefs, bool conversionRegsOnly)
{
LexicalTimer tlex("useDefInfo", comp()->phaseTimer());
TR_UseDefInfo::AuxiliaryData aux(
comp()->getSymRefCount(),
comp()->getNodeCount(),
comp()->trMemory()->heapMemoryRegion(),
comp()->allocator("UseDefAux")
);
int32_t i;
dumpOptDetails(comp(), " (Building use/def info)\n");
if (trace())
{
traceMsg(comp(), "started initialization of use/def info\n");
comp()->dumpMethodTrees("Pre Use Def Trees");
}
bool canBuild = false;
_hasCallsAsUses = false;
_uniqueIndexForDefsOnEntry = false;
if (comp()->cg()->getGRACompleted() && conversionRegsOnly)
_useDefForRegs = true;
else
_useDefForRegs = false;
TR::SymbolReferenceTable *symRefTab = comp()->getSymRefTab();
int32_t numSymRefs = comp()->getSymRefCount();
if (_hasLoadsAsDefs &&
!cannotOmitTrivialDefs &&
(comp()->getMethodHotness() < hot))
{
for (int32_t j = 0; j < numSymRefs; j++)
{
if (symRefTab->getSymRef(j) &&
symRefTab->getSymRef(j)->getSymbol()->isAutoOrParm())
{
aux._onceReadSymbolsIndices[j].GrowTo(comp()->getNodeCount()); /* no effect for sparse bit vectors, except to make non-null */
}
}
}
if (_hasLoadsAsDefs &&
!cannotOmitTrivialDefs)
{
for (int32_t j = 0; j < numSymRefs; j++)
{
if (symRefTab->getSymRef(j) &&
symRefTab->getSymRef(j)->getSymbol()->isAutoOrParm())
{
aux._onceWrittenSymbolsIndices[j].GrowTo(comp()->getNodeCount()); /* no effect for sparse bit vectors, except to make non-null */
}
}
}
aux._neverWrittenSymbols.setAll(numSymRefs);
aux._neverReadSymbols.setAll(numSymRefs);
aux._neverReferencedSymbols.setAll(numSymRefs);
comp()->incVisitCount();
TR::TreeTop *treeTop;
for (treeTop = comp()->getStartTree(); treeTop != NULL; treeTop = treeTop->getNextTreeTop())
findTrivialSymbolsToExclude(treeTop->getNode(), treeTop, aux);
if (trace())
{
//int32_t j;
//for (j=0;j<numSymRefs;j++)
// {
// if (_onceWrittenSymbols[j])
// dumpOptDetails(comp(), "Printing once written sym %d at node %p\n", j, _onceWrittenSymbols[j]->getNode());
// }
}
if (requiresGlobals || prefersGlobals)
{
if (!comp()->getOption(TR_DisableUseDefForShadows))
_useDefForMemorySymbols = true;
}
if (_useDefForMemorySymbols)
{
// TODO: This should be a member of TR_UseDefInfo::AuxiliaryData, and discarded when aux is discarded
// but to do this TR_ValueNumberInfo should be converted to not be dynamically allocated
// Also clean up deletes for dynamic allocation
_valueNumberInfo = optimizer()->createValueNumberInfo(false, false, true);
buildValueNumbersToMemorySymbolsMap();
}
if (requiresGlobals || prefersGlobals)
{
_indexFields = true;
_indexStatics = true;
canBuild = indexSymbolsAndNodes(aux);
// first try to exclude registers
if (!canBuild &&
_useDefForRegs)
{
_useDefForRegs = false;
canBuild = indexSymbolsAndNodes(aux);
}
if (requiresGlobals && !canBuild)
{
invalidateUseDefInfo();
optimizer()->setCantBuildGlobalsUseDefInfo(true);
if (trace())
traceMsg(comp(),"Use/Def info: cannot build global use/def info as it failed in indexSymbolsAndNodes\n");
return;
}
}
if (prefersGlobals && !canBuild)
{
_indexFields = false;
canBuild = indexSymbolsAndNodes(aux);
}
if (!canBuild)
{
_indexFields = false;
_indexStatics = false;
canBuild = indexSymbolsAndNodes(aux);
}
if (!canBuild)
{
invalidateUseDefInfo();
optimizer()->setCantBuildGlobalsUseDefInfo(true);
optimizer()->setCantBuildLocalsUseDefInfo(true);
if (trace())
traceMsg(comp(),"Use/Def info: cannot build global nor local use/def info as it failed in indexSymbolsAndNodes\n");
return;
}
// Adjust the use/def index for each node now that the sizes are known.
// There is still potential for index overflow when the adjustment is done.
//
comp()->incVisitCount();
TR::Block *block = NULL;
for (TR::TreeTop * treeTop = comp()->getStartTree(); treeTop != NULL; treeTop = treeTop->getNextTreeTop())
{
if (treeTop->getNode()->getOpCodeValue() == TR::BBStart)
{
block = treeTop->getNode()->getBlock();
}
if (!assignAdjustedNodeIndex(block, treeTop->getNode(), NULL, treeTop, aux))
{
invalidateUseDefInfo();
optimizer()->setCantBuildGlobalsUseDefInfo(true);
optimizer()->setCantBuildLocalsUseDefInfo(true);
return;
}
}
if (trace())
{
traceMsg(comp(), "Has loads as defs = %d\n", _hasLoadsAsDefs);
traceMsg(comp(), "Number of symbols = %d\n", _numSymbols);
traceMsg(comp(), "Number of memory symbols = %d\n", _numMemorySymbols);
traceMsg(comp(), "Number of statics and fields = %d\n", _numStaticsAndFields);
traceMsg(comp(), "Total nodes for use/def info = %d\n", getTotalNodes());
traceMsg(comp(), " Number of defOnly nodes = %d\n", _numDefOnlyNodes);
traceMsg(comp(), " Number of defUse nodes = %d\n", _numDefUseNodes);
traceMsg(comp(), " Number of useOnly nodes = %d\n", _numUseOnlyNodes);
traceMsg(comp(), "Total nodes for reaching defs = %d\n", getExpandedTotalNodes());
traceMsg(comp(), " Number of defOnly nodes = %d\n", _numExpandedDefOnlyNodes);
traceMsg(comp(), " Number of defUse nodes = %d\n", _numExpandedDefUseNodes);
traceMsg(comp(), " Number of useOnly nodes = %d\n", _numExpandedUseOnlyNodes);
traceMsg(comp(), " Number of defs on entry = %d\n", _numDefsOnEntry);
}
_atoms.resize(getTotalNodes());
_defsChecklist = new (_region) TR_BitVector(getTotalNodes(), _region);
// traceMsg(comp(), "Growing useDefInfo to %d\n",getNumUseNodes());
_useDefInfo.resize(getNumUseNodes(), TR_UseDefInfo::BitVector(comp()->allocator()));
// for (i = getNumUseNodes()-1; i >= 0; --i)
// _useDefInfo[i].GrowTo(getNumDefNodes());
_isUseDefInfoValid = true;
int numRegisters = _useDefForRegs ? comp()->cg()->getNumberOfGlobalRegisters() : 0;
aux._defsForSymbol.resize(_numSymbols + numRegisters, NULL);
for (i = 0; i < _numSymbols + numRegisters; ++i)
aux._defsForSymbol[i] = new (aux._region) TR_BitVector(aux._region);
// Initialize the array with definitions from method entry
//
for (i = 0; i < _numDefsOnEntry; ++i)
{
int32_t j;
if (i < (_numDefsOnEntry - numRegisters))
j = i;
else
j = _numSymbols + (i - (_numDefsOnEntry - numRegisters));
aux._defsForSymbol[j]->set(i);
}
aux._sideTableToUseDefMap.resize(getExpandedTotalNodes());
int32_t expandedNodeArraySize = getExpandedTotalNodes() * sizeof(TR::Node*);
aux._expandedAtoms.resize(expandedNodeArraySize, std::make_pair<TR::Node*, TR::TreeTop*>(NULL, NULL));
fillInDataStructures(aux);
// Flatten the info.. keep the node around for uses - and the treetop around for defs
//
_useDefs.resize(getTotalNodes());
for (int32_t k = 0; k < getTotalNodes(); ++k)
{
std::pair<TR::Node *, TR::TreeTop *> &atom = _atoms[k];
TR::Node *node = atom.first;
if (!node) continue;
int32_t index = node->getUseDefIndex();
if (isDefIndex(index) && !isUseIndex(index))
_useDefs[k] = TR_UseDef(atom.second);
else
_useDefs[k] = TR_UseDef(node);
}
if (trace())
traceMsg(comp(), "completed initialization of use/def info\n\n");
// virtually complete use/def info with reaching definitions analysis
performAnalysis(aux);
if (_valueNumberInfo)
{
delete _valueNumberInfo;
_valueNumberInfo = NULL;
}
}
void TR_UseDefInfo::invalidateUseDefInfo()
{
_isUseDefInfoValid = false;
_useDefInfo.clear();
_defUseInfo.clear();
_loadDefUseInfo.clear();
if (_valueNumberInfo)
{
delete _valueNumberInfo;
_valueNumberInfo = NULL;
}
return;
}
bool TR_UseDefInfo::performAnalysis(AuxiliaryData &aux)
{
if (!_isUseDefInfoValid)
//use-def info hasn't been successfully generated so performing reaching definition analysis is not possible
return false;
if (trace())
traceMsg(comp(), "started reaching definition analysis for use/def\n\n");
if (_numNonTrivialSymbols > 0)
{
bool succeeded = true;
{
TR_ReachingDefinitions rd(comp(), _cfg, optimizer(), this, aux, trace());
succeeded = _runReachingDefinitions(rd, aux);
}
if (!succeeded)
{
return false;
}
}
else
{
processReachingDefinition(NULL, aux);
}
if (trace())
traceMsg(comp(), "completed reaching definition analysis for use/def\n\n");
return true;
}
bool TR_UseDefInfo::_runReachingDefinitions(TR_ReachingDefinitions& reachingDefinitions,
AuxiliaryData &aux)
{
// stack memory is prohibited in UseDefInfo, but here we have to use it as reachingDefinitions use stack memory for _blockAnalysisInfo
TR::StackMemoryRegion stackMemoryRegion(*comp()->trMemory());
reachingDefinitions.perform();
bool succeeded = reachingDefinitions._blockAnalysisInfo;
if (!succeeded)
{
invalidateUseDefInfo();
if (trace())
traceMsg(comp(), "Method too complex to perform reaching defs, use/def info not built\n");
}
else
{
// Build use/def information from the bit vector information from reaching defs
//
LexicalTimer tlex2("useDefInfo_buildUseDefs", comp()->phaseTimer());
processReachingDefinition(reachingDefinitions._blockAnalysisInfo, aux);
}
return succeeded;
}
void TR_UseDefInfo::setVolatileSymbolsIndexAndRecurse(TR::BitVector &volatileSymbols, int32_t symRefNum)
{
TR::SymbolReference* symRef = comp()->getSymRefTab()->getSymRef(symRefNum);
if (!symRef || !symRef->getSymbol())
return;
if(volatileSymbols[symRef->getReferenceNumber()]) //already set, do not need to recurse.
return;
// traceMsg(comp(), "JIAG, setting volatile Symbols for symref %d.\n",symRefNum);
volatileSymbols[symRefNum] = true;
TR::SparseBitVector aliases(comp()->allocator());
symRef->getUseDefAliases().getAliases(aliases);
symRef->getUseonlyAliases().getAliasesAndUnionWith(aliases);
TR::SparseBitVector::Cursor aliasesCursor(aliases);
for (aliasesCursor.SetToFirstOne(); aliasesCursor.Valid(); aliasesCursor.SetToNextOne())
{
TR::SymbolReference *aliasedSymRef = comp()->getSymRefTab()->getSymRef(aliasesCursor);
if (!aliasedSymRef || !aliasedSymRef->getSymbol())
continue;
setVolatileSymbolsIndexAndRecurse(volatileSymbols,aliasedSymRef->getReferenceNumber());
}
}
void TR_UseDefInfo::findAndPopulateVolatileSymbolsIndex(TR::BitVector &volatileSymbols)
{
// traceMsg(comp(), "In findAndPopulateVolatileSymbolsIndex\n");
for (int32_t symRefNumber = comp()->getSymRefTab()->getIndexOfFirstSymRef(); unsigned(symRefNumber) < comp()->getSymRefCount(); symRefNumber++)
{
// traceMsg(comp(), "Considering symRef %d: ",symRefNumber);
TR::SymbolReference* symRef = comp()->getSymRefTab()->getSymRef(symRefNumber);
if (!symRef || !symRef->getSymbol())
continue;
if (symRef->getSymbol()->isVolatile())
{
// traceMsg(comp(), "it is volatile");
setVolatileSymbolsIndexAndRecurse(volatileSymbols, symRefNumber);
}
// traceMsg(comp(), "\n");
}
}
void TR_UseDefInfo::fillInDataStructures(AuxiliaryData &aux)
{
TR::SymbolReferenceTable *symRefTab = comp()->getSymRefTab();
// Fill in the data structures
//
comp()->incVisitCount();
TR::Block * block = NULL;
TR::SparseBitVector expandedLIndexes(comp()->allocator()); //expanded localIndex for variables defined by function
for (TR::TreeTop* treeTop = comp()->getStartTree(); treeTop != NULL; treeTop = treeTop->getNextTreeTop())
{
if (treeTop->getNode()->getOpCodeValue() == TR::BBStart)
{
block = treeTop->getNode()->getBlock();
}
insertData(block, treeTop->getNode(), NULL, treeTop, aux, expandedLIndexes);
}
//If function foo defined variable a, then the expanded localIndex of a related to foo
//must be in defsForSymbol of all functions aliased to a
// Set the bit if defs on entry kill anything
//
if (_uniqueIndexForDefsOnEntry)
{
for (int32_t i = getFirstDefIndex(); i < _numDefsOnEntry; i++)
{
TR::SymbolReference *symRef = symRefTab->getSymRef(_sideTableToSymRefNumMap[i]);
if (!symRef)
continue;
TR::SparseBitVector aliases(comp()->allocator());
symRef->getUseDefAliases().getAliases(aliases);
TR::SparseBitVector::Cursor aliasesCursor(aliases);
for (aliasesCursor.SetToFirstOne(); aliasesCursor.Valid(); aliasesCursor.SetToNextOne())
{
TR::SymbolReference *aliasedSymRef = comp()->getSymRefTab()->getSymRef(aliasesCursor);
if (!aliasedSymRef)
continue;
TR::Symbol *aliasedSym = aliasedSymRef->getSymbol();
if (!aliasedSym || !aliasedSym->isMethod())
continue;
if (aux._neverReferencedSymbols.get(aliasedSymRef->getReferenceNumber()))
continue;
if (excludedGlobals(aliasedSymRef->getSymbol()))
continue;
int32_t j = aliasedSymRef->getSymbol()->getLocalIndex();
if (j == NULL_USEDEF_SYMBOL_INDEX)
continue;
aux._defsForSymbol[j]->set(i);
//traceMsg(comp(),"\n _numDefsOnEntry=%d getNumExpandedDefNodes()=%d j=(u%d s#%d) i=(u%d s#%d)",_numDefsOnEntry, getNumExpandedDefNodes(), j, aliasedSymRef->getReferenceNumber(),i, symRef->getReferenceNumber());
}
}
}
}
bool TR_UseDefInfo::isLoadAddrUse(TR::Node * node)
{
return node->getOpCodeValue() == TR::loadaddr;
}
void TR_UseDefInfo::findTrivialSymbolsToExclude(TR::Node *node, TR::TreeTop *treeTop, AuxiliaryData &aux)
{
if (node->getVisitCount() == comp()->getVisitCount())
return;
node->setVisitCount(comp()->getVisitCount());
int32_t i;
for (i = 0; i < node->getNumChildren(); i++)
findTrivialSymbolsToExclude(node->getChild(i), treeTop, aux);
if (node->getOpCode().hasSymbolReference() &&
aux._neverReferencedSymbols.get(node->getSymbolReference()->getReferenceNumber()))
{
aux._neverReferencedSymbols.reset(node->getSymbolReference()->getReferenceNumber());
}
//if (!node->getOpCode().isStore() &&
// (node->getNumChildren() > 0))
// node = node->getFirstChild();
if (node->getOpCode().isStoreDirect())
{
TR::SymbolReference *symRef = node->getSymbolReference();
int32_t symRefNum = symRef->getReferenceNumber();
if (symRef->getSymbol()->isAutoOrParm())
{
if (!aux._onceReadSymbolsIndices[symRefNum].IsNull())
{
aux._onceReadSymbolsIndices[symRefNum][node->getGlobalIndex()] = true;
if (trace())
traceMsg(comp(), "SETTING node %p symRefNum %d\n", node, symRefNum);
}
if (aux._neverWrittenSymbols.get(symRefNum))
{
aux._neverWrittenSymbols.reset(symRefNum);
if (trace())
traceMsg(comp(), "Resetting write bit %d at node %p\n", symRefNum, node);
if (!aux._onceWrittenSymbolsIndices[symRefNum].IsNull())
{
if (symRef->getSymbol()->isParm())
aux._onceWrittenSymbolsIndices[symRefNum].ClearToNull();
else
aux._onceWrittenSymbolsIndices[symRefNum][node->getGlobalIndex()] = true;
if (trace())
traceMsg(comp(), "Sym ref %d written once at node %p\n", symRefNum, treeTop->getNode());
}
}
else if (!aux._onceWrittenSymbolsIndices[symRefNum].IsNull())
{
aux._onceWrittenSymbolsIndices[symRefNum].ClearToNull();
}
}
}
else if (node->getOpCode().isLoadVarDirect() ||
isLoadAddrUse(node))
{
TR::SymbolReference *symRef = node->getSymbolReference();
int32_t symRefNum = symRef->getReferenceNumber();
if (symRef->getSymbol()->isAutoOrParm())
{
if (aux._neverReadSymbols.get(symRefNum))
{
aux._neverReadSymbols.reset(symRefNum);
aux._loadsBySymRefNum[symRefNum] = node;
if (trace())
traceMsg(comp(), "Resetting read bit %d at node %p\n", symRefNum, node);
}
else if (!aux._onceReadSymbolsIndices[symRefNum].IsNull())
{
TR::Node *prevLoadNode = aux._loadsBySymRefNum[symRefNum];
if ((prevLoadNode->getByteCodeIndex() != node->getByteCodeIndex()) ||
(prevLoadNode->getInlinedSiteIndex() != node->getInlinedSiteIndex()))
{
aux._onceReadSymbolsIndices[symRefNum].ClearToNull();
if (trace())
traceMsg(comp(), "KILLING bit %d at node %p\n", symRefNum, node);
}
}
}
}
}
bool TR_UseDefInfo::isTrivialUseDefNode(TR::Node *node, AuxiliaryData &aux)
{
if (aux._doneTrivialNode.get(node->getGlobalIndex()))
return aux._isTrivialNode.get(node->getGlobalIndex());
bool result = isTrivialUseDefNodeImpl(node, aux);
aux._doneTrivialNode.set(node->getGlobalIndex());
if (result)
aux._isTrivialNode.set(node->getGlobalIndex());
return result;
}
bool TR_UseDefInfo::isTrivialUseDefNodeImpl(TR::Node *node, AuxiliaryData &aux)
{
if (node->getOpCode().isStore() &&
node->getSymbol()->isAutoOrParm() &&
node->storedValueIsIrrelevant())
return true;
if (_useDefForRegs &&
(node->getOpCode().isLoadReg() ||
node->getOpCode().isStoreReg()))
return false;
TR::SymbolReference *symRef = node->getSymbolReference();
if (symRef->getSymbol()->isParm())
{
if (!aux._neverWrittenSymbols.get(symRef->getReferenceNumber()))
{
return false;
}
}
if (isTrivialUseDefSymRef(symRef, aux))
return true;
if (_hasLoadsAsDefs && symRef->getSymbol()->isAutoOrParm())
{
if (!aux._onceReadSymbolsIndices[symRef->getReferenceNumber()].IsNull() &&
((node->getOpCode().isLoadVarDirect() ||
isLoadAddrUse(node)) ||
(node->getOpCode().isStoreDirect() &&
aux._onceReadSymbolsIndices[symRef->getReferenceNumber()].ValueAt(node->getGlobalIndex()))))
return true;
}
else if (symRef->getSymbol()->isAutoOrParm() &&
(node->getOpCode().isLoadVarDirect() ||
(isLoadAddrUse(node))))
return true;
if (/* _hasLoadsAsDefs && */symRef->getSymbol()->isAutoOrParm())
{
if (!aux._onceWrittenSymbolsIndices[symRef->getReferenceNumber()].IsNull() &&
((node->getOpCode().isLoadVarDirect() ||
isLoadAddrUse(node)) ||
(node->getOpCode().isStoreDirect() &&
aux._onceWrittenSymbolsIndices[symRef->getReferenceNumber()].ValueAt(node->getGlobalIndex()))))
return true;
}
return false;
}
bool TR_UseDefInfo::isTrivialUseDefSymRef(TR::SymbolReference *symRef, AuxiliaryData &aux)
{
//if (!_hasLoadsAsDefs)
// return false;
int32_t symRefNum = symRef->getReferenceNumber();
if (symRef->getSymbol()->isAutoOrParm())
{
if (symRef->getSymbol()->isParm())
{
if (!aux._neverWrittenSymbols.get(symRefNum))
{
return false;
}
}
if (aux._neverWrittenSymbols.get(symRefNum))
return true;
else if (aux._neverReadSymbols.get(symRefNum))
return true;
}
return false;
}
bool TR_UseDefInfo::isValidAutoOrParm(TR::SymbolReference *symRef)
{
if (!symRef->getSymbol()->isAutoOrParm())
return false;
if (!_tempsOnly)
return true;
TR::BitVector useDefAliases(comp()->allocator());
symRef->getUseDefAliases().getAliases(useDefAliases);
TR::BitVector useOnlyAliases(comp()->allocator());
symRef->getUseonlyAliases().getAliases(useOnlyAliases);
return (useDefAliases.PopulationCount() == 1 &&
useOnlyAliases.PopulationCount() == 1);
}
bool TR_UseDefInfo::excludedGlobals(TR::Symbol *sym)
{
if (sym->isStatic() && (sym->isConst() || sym->castToStaticSymbol()->isConstObjectRef()))
return true;
if ((sym->isStatic() || sym->isMethodMetaData()) && !_indexStatics)
return true;
else if (sym->isShadow() && !_indexFields)
return true;
else
return false;
}
void TR_UseDefInfo::buildValueNumbersToMemorySymbolsMap()
{
LexicalTimer tlex("useDefInfo_buildValueNosToMSM", comp()->phaseTimer());
_valueNumbersToMemorySymbolsMap.resize(_valueNumberInfo->getNumberOfValues(), NULL);
for (size_t i = 0; i < _valueNumbersToMemorySymbolsMap.size(); ++i)
_valueNumbersToMemorySymbolsMap[i] = new (_region) MemorySymbolList(_region);
comp()->incVisitCount();
_numMemorySymbols = 0;
TR::TreeTop * treeTop;
for (treeTop = comp()->getStartTree(); treeTop; treeTop = treeTop->getNextTreeTop())
{
findMemorySymbols(treeTop->getNode());
}
}
void TR_UseDefInfo::findMemorySymbols(TR::Node *node)
{
vcount_t visitCount = comp()->getVisitCount();
if (visitCount == node->getVisitCount())
return;
node->setVisitCount(visitCount);
// Process children
//
for (int32_t i = 0; i < node->getNumChildren(); i++)
{
findMemorySymbols(node->getChild(i));
}
if ((node->getOpCode().isLoadIndirect() || node->getOpCode().isStoreIndirect()) &&
node->getSymbolReference()->getSymbol()->isShadow() &&
_valueNumberInfo &&
_valueNumberInfo->getNext(node->getFirstChild()) != node->getFirstChild()) // value number is shared with some other node
{
int32_t valueNumber = _valueNumberInfo->getValueNumber(node->getFirstChild());
uint32_t size = static_cast<uint32_t>(node->getSymbolReference()->getSymbol()->getSize());
uint32_t offset = static_cast<uint32_t>(node->getSymbolReference()->getOffset());
bool found = false;
for (auto itr = _valueNumbersToMemorySymbolsMap[valueNumber]->begin(), end = _valueNumbersToMemorySymbolsMap[valueNumber]->end();
itr != end; ++itr)
{
MemorySymbol &memorySymbol = *itr;
if ((memorySymbol._size == size) && (memorySymbol._offset == offset))
{
found = true;
break;
}
}
if (!found)
_valueNumbersToMemorySymbolsMap[valueNumber]->push_front(MemorySymbol(size, offset, _numMemorySymbols++));
if (trace())
traceMsg(comp(), "Node %p has memory symbol index %d (%d:%d:%d)\n", node, _valueNumbersToMemorySymbolsMap[valueNumber]->front()._localIndex, valueNumber, size, offset);
}
}
int32_t TR_UseDefInfo::getMemorySymbolIndex(TR::Node * node)
{
if (!_useDefForMemorySymbols) return -1;
if ((!node->getOpCode().isLoadIndirect() && !node->getOpCode().isStoreIndirect()) ||
!node->getSymbolReference()->getSymbol()->isShadow() ||
_valueNumberInfo->getNext(node->getFirstChild()) == node->getFirstChild())
return -1;
int32_t valueNumber = _valueNumberInfo->getValueNumber(node->getFirstChild());
uint32_t size = static_cast<uint32_t>(node->getSymbolReference()->getSymbol()->getSize());
uint32_t offset = static_cast<uint32_t>(node->getSymbolReference()->getOffset());
for (auto itr = _valueNumbersToMemorySymbolsMap[valueNumber]->begin(), end = _valueNumbersToMemorySymbolsMap[valueNumber]->end();
itr != end; ++itr)
{
MemorySymbol &memorySymbol = *itr;
if ((memorySymbol._size == size) && (memorySymbol._offset == offset))
return memorySymbol._localIndex;
}
TR_ASSERT(false, "Could not find memory symbol index for node %p (%d:%d:%d)", node, valueNumber, size, offset);
return -1;
}
bool TR_UseDefInfo::shouldIndexVolatileSym(TR::SymbolReference*ref, AuxiliaryData &aux)
{
if (! ref->getSymbol()->isVolatile()) //index non-volatiles
return true;
return false;
}
/**
* Find all symbols whose uses and defs are to be tracked and give them a
* local index. This index is used to index into the array of bit vectors
* that show which nodes define which symbols.
*
* At the same time count the number of defs on entry to the method.
*
* Symbol indices are assigned in a particular order as follows:
*
* 0 to (_numStaticsAndFields-1):
* Field, metadata and non-constant static symbols; these are the symbols
* that used to be killed by calls and by unresolved references.
* Currently _numStaticsAndFields is not used since kill sets are based
* on alias sets.
*
* _numStaticsAndFields to _numDefsOnEntry:
* Parameter, local, and constant static symbols; together with the
* previous group these are all the symbols that include the method entry
* as a definition point.
*/
bool TR_UseDefInfo::indexSymbolsAndNodes(AuxiliaryData &aux)
{
LexicalTimer tlex("indexSymbolsAndNodes", comp()->phaseTimer());
if (trace())
{
traceMsg(comp(), "Trying to index nodes with _indexFields = %d, _indexStatics = %d\n", _indexFields, _indexStatics);
}
_numSymbols = _numMemorySymbols;
_numNonTrivialSymbols = 0;
int32_t symRefCount = comp()->getSymRefCount();
TR::SymbolReferenceTable *symRefTab = comp()->getSymRefTab();
TR::SymbolReference *symRef;
TR::Symbol *sym;
int32_t symRefNumber;
if (trace())
{
traceMsg(comp(), "_neverReferencedSymbols[count = %d]: ", aux._neverReferencedSymbols.elementCount());
aux._neverReferencedSymbols.print(comp());
traceMsg(comp(), "\n");
}
TR_BitVector relevantAliases(aux._region);
TR_BitVector methodsAndShadows(aux._region);
TR_BitVector referencedSymRefs(aux._region);
TR_BitVector aliases(aux._region);
for (symRefNumber = symRefTab->getIndexOfFirstSymRef(); symRefNumber < symRefCount; symRefNumber++)
{
LexicalTimer tlex("indexSymbolsAndNodes_refs", comp()->phaseTimer());
symRef = symRefTab->getSymRef(symRefNumber);
if (!symRef || !symRef->getSymbol())
continue;
if (aux._neverReferencedSymbols.get(symRefNumber))
continue;
referencedSymRefs.set(symRefNumber);
if (excludedGlobals(symRef->getSymbol()))
continue;
if (symRef->getSymbol()->isMethod() || symRef->getSymbol()->isRegularShadow())
methodsAndShadows.set(symRefNumber);
else
relevantAliases.set(symRefNumber);
}
TR_BitVectorIterator refIter(referencedSymRefs);
while (refIter.hasMoreElements())
{
LexicalTimer tlex2("indexSymbolsAndNodes_refs", comp()->phaseTimer());
symRefNumber = refIter.getNextElement();
symRef = symRefTab->getSymRef(symRefNumber);
if (symRef)
{
sym = symRef->getSymbol();
// record number of relevant aliases
uint32_t num_aliases = 0;
uint32_t numMethodsAndShadows = 0;
if (symRef->sharesSymbol())
{
symRef->getUseDefAliases().getAliases(aliases);
num_aliases = aliases.commonElementCount(relevantAliases);
numMethodsAndShadows = aliases.commonElementCount(methodsAndShadows);
}
if (num_aliases == 0 && !sym->isMethod())
num_aliases = 1; // alias symbol with itself
if (numMethodsAndShadows != 0)
num_aliases++;
if (symRef->getSymbol()->isShadow())
num_aliases++;
aux._numAliases[symRefNumber] = num_aliases;
if (sym)
{
// Initialize all symbols with null usedef index
//
sym->setLocalIndex(NULL_USEDEF_SYMBOL_INDEX);
// Volatile symbols must not be considered since they don't have
// any specifiable def points.
//
if (!shouldIndexVolatileSym(symRef,aux))
{
if (trace())
traceMsg(comp(), "Ignoring Symbol [%p] because it is volatile %d or aliased to a volatile %d\n",sym,sym->isVolatile(),aux._volatileOrAliasedToVolatileSymbols.get(symRefNumber));
continue;
}
if (excludedGlobals(sym))
continue;
if (!sym->isStatic() &&
!sym->isMethodMetaData() &&
!sym->isShadow())
continue;
// Index this symbol
//
if (trace())
traceMsg(comp(), "Symbol [%p] has index %d\n", sym, _numSymbols);
_sideTableToSymRefNumMap[_numSymbols] = symRefNumber;
sym->setLocalIndex(_numSymbols++);
if (!isTrivialUseDefSymRef(symRef, aux) &&
((sym->isParm() && !aux._neverWrittenSymbols.get(symRef->getReferenceNumber())) ||
(aux._onceReadSymbolsIndices[symRef->getReferenceNumber()].IsNull() &&
aux._onceWrittenSymbolsIndices[symRef->getReferenceNumber()].IsNull())))
_numNonTrivialSymbols++;
}
}
}
_numStaticsAndFields = _numSymbols;
refIter.reset();
while (refIter.hasMoreElements())
{
symRefNumber = refIter.getNextElement();
symRef = symRefTab->getSymRef(symRefNumber);