-
Notifications
You must be signed in to change notification settings - Fork 392
/
StripMiner.cpp
2144 lines (1880 loc) · 80.7 KB
/
StripMiner.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, 2020 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/StripMiner.hpp"
#include <algorithm>
#include <stdint.h>
#include <string.h>
#include "env/FrontEnd.hpp"
#include "compile/Compilation.hpp"
#include "compile/SymbolReferenceTable.hpp"
#include "control/Options.hpp"
#include "control/Options_inlines.hpp"
#include "env/CompilerEnv.hpp"
#include "env/TRMemory.hpp"
#include "env/jittypes.h"
#include "il/Block.hpp"
#include "il/DataTypes.hpp"
#include "il/ILOpCodes.hpp"
#include "il/ILOps.hpp"
#include "il/Node.hpp"
#include "il/NodeUtils.hpp"
#include "il/Node_inlines.hpp"
#include "il/ResolvedMethodSymbol.hpp"
#include "il/Symbol.hpp"
#include "il/SymbolReference.hpp"
#include "il/TreeTop.hpp"
#include "il/TreeTop_inlines.hpp"
#include "infra/Cfg.hpp"
#include "infra/Link.hpp"
#include "infra/List.hpp"
#include "infra/CfgEdge.hpp"
#include "infra/CfgNode.hpp"
#include "optimizer/InductionVariable.hpp"
#include "optimizer/LoopCanonicalizer.hpp"
#include "optimizer/Optimization_inlines.hpp"
#include "optimizer/OptimizationManager.hpp"
#include "optimizer/Structure.hpp"
#define OPT_DETAILS "O^O STRIP MINER: "
TR_StripMiner::TR_StripMiner(TR::OptimizationManager *manager)
: TR_LoopTransformer(manager),
_nodesInCFG(0),
_endTree(NULL),
_loopInfos(manager->trMemory()),
_origBlockMapper(NULL),
_mainBlockMapper(NULL),
_preBlockMapper(NULL),
_postBlockMapper(NULL),
_residualBlockMapper(NULL)
{}
bool TR_StripMiner::shouldPerform()
{
//FIXME: only enabled when creating arraylets (for now)
if (!comp()->generateArraylets())
{
if (trace())
traceMsg(comp(), "Not enabled in non-rtj mode.\n");
return false;
}
else if (comp()->getOption(TR_DisableStripMining))
{
if (trace())
traceMsg(comp(), "Option is not enabled -- returning from strip mining.\n");
return false;
}
if (!comp()->mayHaveLoops())
{
if (trace())
traceMsg(comp(), "Method does not have loops -- returning from strip mining.\n");
return false;
}
return true;
}
int32_t TR_StripMiner::perform()
{
if (trace())
traceMsg(comp(), "Processing method: %s\n", comp()->signature());
_cfg = comp()->getFlowGraph();
_rootStructure = _cfg->getStructure();
_nodesInCFG = _cfg->getNextNodeNumber();
_endTree = comp()->getMethodSymbol()->getLastTreeTop();
_loopInfos.init();
// From here, down, stack memory allocations will die when the function returns
TR::StackMemoryRegion stackMemoryRegion(*trMemory());
if (trace())
{
traceMsg(comp(), "Starting StripMining\n");
comp()->dumpMethodTrees("Before strip mining");
///getDebug()->print(comp()->getOutFile(), _cfg);
}
// Collect and analyze information about loops
collectLoops(_rootStructure);
dumpOptDetails(comp(), "Loop analysis completed...\n");
// Strip mine if there are loop candidates
if (!_loopInfos.isEmpty())
{
_cfg->setStructure(NULL);
/* Initialize block mappers */
intptr_t size = _nodesInCFG * sizeof(TR::Block *);
_origBlockMapper = (TR::Block **) trMemory()->allocateStackMemory(size);
memset(_origBlockMapper, 0, size);
_mainBlockMapper = (TR::Block **) trMemory()->allocateStackMemory(size);
memset(_mainBlockMapper, 0, size);
_preBlockMapper = (TR::Block **) trMemory()->allocateStackMemory(size);
memset(_preBlockMapper, 0, size);
_postBlockMapper = (TR::Block **) trMemory()->allocateStackMemory(size);
memset(_postBlockMapper, 0, size);
_residualBlockMapper = (TR::Block **) trMemory()->allocateStackMemory(size);
memset(_residualBlockMapper, 0, size);
_offsetBlockMapper = (TR::Block **) trMemory()->allocateStackMemory(size);
memset(_offsetBlockMapper, 0, size);
for (TR::CFGNode *node = _cfg->getFirstNode(); node; node = node->getNext())
{
TR::Block *block = toBlock(node);
if (block && node->getNumber() >= 0)
_origBlockMapper[node->getNumber()] = block;
}
//find leaves
findLeavesInList();
// strip mining
transformLoops();
}
else
dumpOptDetails(comp(), "Strip mining completed: no loops found\n");
return 0;
}
void TR_StripMiner::collectLoops(TR_Structure *str)
{
TR_RegionStructure *region = str->asRegion();
if (region == NULL)
return;
TR_RegionStructure::Cursor it(*region);
for (TR_StructureSubGraphNode *node = it.getCurrent(); node; node = it.getNext())
collectLoops(node->getStructure());
if (region->isNaturalLoop())
{
if (trace())
traceMsg(comp(), "<analyzeLoops loop=%d addr=%p>\n", region->getNumber(), region);
// Check for loop pre-header
//
TR::Block *preHeader = getLoopPreHeader(str);
if (preHeader == NULL)
{
if (trace())
traceMsg(comp(), "\tReject loop %d ==> no pre-header\n", region->getNumber());
return;
}
// Check for loop test
//
TR::Block *loopTest = getLoopTest(str, preHeader);
if (loopTest == NULL)
{
if (trace())
traceMsg(comp(), "\tReject loop %d ==> no loop test block\n", region->getNumber());
return;
}
// Check if there is a primary induction variable
//
TR_PrimaryInductionVariable *piv = region->getPrimaryInductionVariable();
if (piv == NULL)
{
if (trace())
traceMsg(comp(), "\tReject loop %d ==> no primary induction variable\n",
region->getNumber());
return;
}
TR::Node *entryValue = piv->getEntryValue();
// Check to see if there is only 1 back edge (the other edge is from pre-header
//
if (region->getEntryBlock()->getPredecessors().size() != 2)
{
if (trace())
traceMsg(comp(), "\tReject loop %d ==> more than 1 back edge\n",
region->getNumber());
return;
}
//FIXME: no support for loops with catch blocks
//
TR_ScratchList<TR::Block> blocksInLoop(trMemory());
region->getBlocks(&blocksInLoop);
ListIterator<TR::Block> bIt(&blocksInLoop);
for (TR::Block *b = bIt.getFirst(); b; b = bIt.getNext())
{
if (b->hasExceptionPredecessors()) // catch
{
if (trace())
traceMsg(comp(), "\tReject loop %d ==> block_%d has exception predecessors\n",
region->getNumber(), b->getNumber());
return;
}
if (b->hasExceptionSuccessors()) // try
{
if (trace())
traceMsg(comp(), "\tReject loop %d ==> block_%d has exception successors\n",
region->getNumber(), b->getNumber());
return;
}
}
// Save loop info
//
LoopInfo *li = (LoopInfo *) trMemory()->allocateStackMemory(sizeof(LoopInfo));
li->_region = region;
li->_regionNum = region->getNumber();
li->_arrayDataSize = 0;
li->_increasing = piv->getDeltaOnBackEdge() > 0;
TR::Node *branch = loopTest->getLastRealTreeTop()->getNode();
li->_branchToExit =
!region->contains(branch->getBranchDestination()->getNode()->getBlock()->getStructureOf(),
region->getParent());
li->_canMoveAsyncCheck = true;
li->_needOffsetLoop = false;
li->_preOffset = 0;
li->_postOffset = 0;
li->_offset = -1;
if (entryValue && entryValue->getOpCode().isLoadConst())
{
if (entryValue->getType().isInt32())
li->_offset = entryValue->getInt();
else
li->_offset = entryValue->getLongInt();
}
// FIXME: really, we need a pre-loop to make i % strip_length = 0
// add that functionality here
/*else
li->_offset = -1;
*/
li->_stripLen = DEFAULT_STRIP_LENGTH;
li->_preHeader = preHeader;
li->_loopTest = loopTest;
li->_piv = piv;
li->_asyncTree = NULL;
TR::Region &scratchRegion = trMemory()->currentStackRegion();
li->_mainParentsOfLoads.setRegion(scratchRegion);
li->_mainParentsOfLoads.init();
li->_mainParentsOfStores.setRegion(scratchRegion);
li->_mainParentsOfStores.init();
li->_residualParentsOfLoads.setRegion(scratchRegion);
li->_residualParentsOfLoads.init();
li->_residualParentsOfStores.setRegion(scratchRegion);
li->_residualParentsOfStores.init();
li->_edgesToRemove.setRegion(scratchRegion);
li->_edgesToRemove.init();
examineLoop(li, mainLoop, false);
//check if there are multiple stores of the induction variable.
//Reject if the stores are incremental. i.e. i=i+1; i=i+1... In that case the deltaOnBackEdge is 2.
// It is ok in case where if the stores are in different paths of the code. Then the value is equal to the deltaOnBackEdge
//Looking only on Main loop
if (checkIfIncrementalIncreasesOfPIV(li))
{
if (trace())
traceMsg(comp(), "\tReject loop %d ==> multiple store of induction variable were found\n", region->getNumber());
return;
}
// Check if there are array accesses of more than one data size
//
if (comp()->generateArraylets() && li->_arrayDataSize <= 0)
{
if (trace())
{
if (li->_arrayDataSize < 0)
traceMsg(comp(), "\tReject loop %d ==> array accesses of more than one data size\n",
region->getNumber());
else
traceMsg(comp(), "\tReject loop %d ==> no array accesses found\n",
region->getNumber());
}
return;
}
// Determine the loop strip length
//
if (comp()->generateArraylets())
li->_stripLen = comp()->fe()->getArrayletMask(static_cast<int32_t>(li->_arrayDataSize)) + 1;
// Don't strip mine loops that need offsetLoop
//
//If entry value is known, we need to be at the start of the leaf for increasing loops,
// and for end of the leaf for decreasing loops so that no offset loop will be needed.
//If no entry value is known (-1) then we need offset loop.
if ( (li->_offset==-1 ) ||
((li->_increasing && ((li->_offset & (li->_stripLen-1)) != 0)) ||
(!li->_increasing && (li->_offset & (li->_stripLen-1)) != li->_stripLen-1)))
{
if (trace())
traceMsg(comp(), "\tReject loop %d ==> needs a offsetLoop - cannot deal with this now\n", region->getNumber());
//printf("reject %s: need offset loop %d\n",comp()->signature(),li->_offset);fflush(stdout);
return;
}
// If the iterationCount of the loop is known and if the
// trip count is less than the length of a leaf, its not
// worth to mine this loop
//
int32_t iterCount = piv->getIterationCount();
if (trace())
traceMsg(comp(), "\titerationCount = %d stripLength = %d\n", iterCount, li->_stripLen);
if (iterCount != -1)
{
if (iterCount < li->_stripLen)
{
if (trace())
traceMsg(comp(), "\tReject loop %d ==> iteration count is less than the strip length\n",
region->getNumber());
return;
}
}
//Temp reject loops with post offsets
if ((li->_preOffset!=0) ||
(li->_postOffset !=0))
{
if (trace())
traceMsg(comp(),
"\tReject loop %d ==> pre offset = %d, post offsets = %d\n",
region->getNumber(), li->_preOffset, li->_postOffset);
//printf("reject %s: pre %d post %d offset\n",comp()->signature(),li->_preOffset, li->_postOffset);fflush(stdout);
return;
}
// Check if pre and post offsets can be handled
//
if (li->_preOffset + li->_postOffset >= li->_stripLen)
{
if (trace())
traceMsg(comp(),
"\tReject loop %d ==> pre offset = %d, post offsets = %d, strip length = %d\n",
region->getNumber(), li->_preOffset, li->_postOffset, li->_stripLen);
return;
}
// Check if there is a call in the loop
//
if (!li->_canMoveAsyncCheck)
{
if (trace())
traceMsg(comp(), "\tReject loop %d ==> calls present\n",
region->getNumber());
return;
}
// Otherwise, add loop info to the queue
//
_loopInfos.add(li);
if (trace())
{
traceMsg(comp(), "\tSuccess => adding candidate loop %d to the queue\n", region->getNumber());
traceMsg(comp(), "\t\tpre-header = %d, loop test = %d, primary induction variable = %d\n",
preHeader->getNumber(), loopTest->getNumber(),
piv->getSymRef()->getReferenceNumber());
traceMsg(comp(), "\t\tpre-offset = %d, post-offset = %d, offset = %d, strip length = %d\n",
li->_preOffset, li->_postOffset, li->_offset, li->_stripLen);
traceMsg(comp(), "\t\tarray data size = %d, step = %d need-offset-loop = %d\n", li->_arrayDataSize,
piv->getDeltaOnBackEdge(), (li->_offset < 0));
}
}
else
{
if (trace())
traceMsg(comp(), "\tReject region %d ==> not a natural loop\n", region->getNumber());
}
}
/** actual strip mining starts here
*
* Here's whats going to happen:
*
* * assuming i is the piv and j is the new iv with N being the loop limit
* * and loop contains array accesses A[i+x] A[i+y]
+--------+ +--------+
| overflo| | orig |
| test ------->| loop |
+---+----+ +---+----+
|
+--------+
| prehdr |
;------->| |
; +---+----+
; | temp = i+x
; +---+----+ pre-loop
; ,>| |
, ( | i < N | -> exit
,-' `-+---+----+
,' i < temp |
; +---+----+
; .| strip |. (i + stripLen - x - y) < N
/ .' | test |''`-.
/ false .-' +---+----+ `. true
; +---.'---+ +---`-.--+
|i->j | residue| | main | change i -> j and iterate
: upto | loop | | loop | upto (stripLen - x - y)
\ N +---`.---+ +---.'---+
\ `. +--------+ .'
\ `-. | i=i+j | .'
\ `. i<N :' -> exit
\ +---+----+
`. | temp = i+y
'-. +---+----+ post-loop
`---. | |
; + i < N |< -> exit
; +---+----. )
i < temp '
*/
void TR_StripMiner::transformLoops()
{
ListIterator<LoopInfo> it(&_loopInfos);
intptr_t size = _nodesInCFG * sizeof(TR::Block *);
for (LoopInfo *li = it.getFirst(); li; li = it.getNext())
{
if (li != NULL &&
performTransformation(comp(), "%sTransforming loop %d\n", OPT_DETAILS, li->_regionNum))
{
// Clear out the block mappers
//
memset(_mainBlockMapper, 0, size);
memset(_preBlockMapper, 0, size);
memset(_postBlockMapper, 0, size);
memset(_residualBlockMapper, 0, size);
memset(_offsetBlockMapper, 0, size);
// Duplicate the loops first
//
duplicateLoop(li, offsetLoop);
duplicateLoop(li, preLoop);
duplicateLoop(li, mainLoop);
duplicateLoop(li, residualLoop);
duplicateLoop(li, postLoop);
TR_RegionStructure *loop = li->_region;
TR_ScratchList<TR::Block> blocksInLoop(trMemory());
loop->getBlocks(&blocksInLoop);
// Fix up everything
//
transformLoop(li);
ListIterator<TR::Block> bIt(&blocksInLoop);
TR::Block *block = NULL;
for (block = bIt.getFirst(); block; block = bIt.getNext())
block->setFrequency((int32_t) ((float) block->getFrequency()/10));
if (trace())
traceMsg(comp(), "Done transforming loop %d\n", li->_regionNum);
//printf("\n--Strip Mining in -- %s start %d post %d pre %d increasing %d\n", comp()->signature(), li->_offset, li->_postOffset, li->_preOffset, li->_increasing);
}
}
}
void TR_StripMiner::duplicateLoop(LoopInfo *li, TR_ClonedLoopType type)
{
TR::Block **blockMapper = NULL;
bool isMainOrResidual = true;
switch (type)
{
case offsetLoop:
// check if offset already starts at an arraylet
// offset could be -1 in which case the offset loop
// will position the stripmined loop at the start of
// an arraylet
//
if (!comp()->generateArraylets() ||
((li->_offset!=-1) &&
((li->_increasing && ((li->_offset & (li->_stripLen-1)) == 0)) ||
(!li->_increasing && (li->_offset & (li->_stripLen-1)) == li->_stripLen-1))))
return;
blockMapper = _offsetBlockMapper;
if (trace())
traceMsg(comp(), "\tcreating start offset loop: loop %d...\n", li->_regionNum);
li->_needOffsetLoop = true;
isMainOrResidual = false;
break;
case preLoop:
if (li->_preOffset <= 0)
return;
blockMapper = _preBlockMapper;
if (trace())
traceMsg(comp(), "\tcreating pre loop: loop %d...\n", li->_regionNum);
isMainOrResidual = false;
break;
case mainLoop:
blockMapper = _mainBlockMapper;
if (trace())
traceMsg(comp(), "\tcreating main loop: loop %d...\n", li->_regionNum);
break;
case postLoop:
if (li->_postOffset <= 0)
return;
blockMapper = _postBlockMapper;
if (trace())
traceMsg(comp(), "\tcreating post loop: loop %d...\n", li->_regionNum);
isMainOrResidual = false;
break;
case residualLoop:
blockMapper = _residualBlockMapper;
if (trace())
traceMsg(comp(), "\tcreating residual loop: loop %d...\n", li->_regionNum);
break;
default:
if (trace())
traceMsg(comp(), "\tcannot recognize loop type: %d, abort duplication...\n", type);
return;
}
// used for debugging the start position loop
static char *pEnv = feGetEnv("TR_noStripMineStart");
if (pEnv &&
(type == offsetLoop && li->_needOffsetLoop))
{
traceMsg(comp(), "loop %d needs a start offset loop %d\n", li->_regionNum, li->_needOffsetLoop);
li->_needOffsetLoop = false;
return;
}
// Clone the loop
//
TR_RegionStructure *loop = li->_region;
TR_ScratchList<TR::Block> blocksInLoop(trMemory());
loop->getBlocks(&blocksInLoop);
blocksInLoop.add(li->_preHeader);
TR_BlockCloner cloner(_cfg, true);
ListIterator<TR::Block> bIt(&blocksInLoop);
TR::Block *block = NULL;
for (block = bIt.getFirst(); block; block = bIt.getNext())
{
if (block->getNumber() < _nodesInCFG)
{
TR::Block *clonedBlock = cloner.cloneBlocks(block, block);
// Append the clone to the end of method
//
_endTree->join(clonedBlock->getEntry());
clonedBlock->getExit()->setNextTreeTop(NULL);
_endTree = clonedBlock->getExit();
// Record the orig -> clone mapping
//
blockMapper[block->getNumber()] = clonedBlock;
/*if (trace())
{
traceMsg(comp(), "Cloned block (%d): %d\n",
block->getNumber(), blockMapper[block->getNumber()]->getNumber());
}
*/
}
}
// Fix the clone's edges except the exit edges
//
for (block = bIt.getFirst(); block; block = bIt.getNext())
{
TR::Block *clonedBlock = blockMapper[block->getNumber()];
if (trace())
traceMsg(comp(), "\tprocessing edges for: block [%d] => cloned block [%d]\n",
block->getNumber(), clonedBlock->getNumber());
if (block == li->_loopTest && !isMainOrResidual)
{
if (trace())
traceMsg(comp(), "\tskipping edge from non-main non-residual loop test block [%d]\n",
block->getNumber());
continue;
}
//skip exit edges. Those will be fixed later.
for (auto edge = block->getSuccessors().begin(); edge != block->getSuccessors().end(); ++edge)
{
TR::Block *dest = toBlock((*edge)->getTo());
TR::Block *clonedDest = blockMapper[dest->getNumber()];
if (trace())
traceMsg(comp(), "\t for edge: [%d] => [%d]\n", clonedBlock->getNumber(),
clonedDest ? clonedDest->getNumber() : dest->getNumber());
if (clonedDest)
redirect(clonedBlock, dest, clonedDest);
else
if (trace())
traceMsg(comp(), "\t skipping exit edge to [%d]\n", dest->getNumber());
}
}
if (trace())
{
comp()->dumpMethodTrees("stripMining: trees after loop duplication");
///comp()->getDebug()->print(comp()->getOutFile(), _cfg);
}
}
void TR_StripMiner::transformLoop(LoopInfo *li)
{
TR_RegionStructure *loop = li->_region;
TR::Block *ph = li->_preHeader;
TR::TreeTop *phEntry = ph->getEntry();
TR::Node *phNode = phEntry->getNode();
TR::Block *lt = li->_loopTest;
TR::TreeTop *ltTree = lt->getLastRealTreeTop();
intptr_t stripLength = li->_stripLen;
TR::Block *clonedPh = _mainBlockMapper[ph->getNumber()];
TR::TreeTop *clonedPhEntry = clonedPh->getEntry();
TR::Node *clonedPhNode = clonedPhEntry->getNode();
TR::Block *clonedLt = _mainBlockMapper[lt->getNumber()];
TR::TreeTop *clonedLtTree = clonedLt->getLastRealTreeTop();
bool isInt32 = ltTree->getNode()->getOpCode().isBooleanCompare() && // isCompare only returns true for signed compare -- a better name would be isCompareArith()
ltTree->getNode()->getSecondChild()->getDataType() == TR::Int32;
// Check to see if overflow test is needed
bool testOverflow = true;
TR::Node *limitNode = ltTree->getNode()->getSecondChild();
if (limitNode->getOpCode().isLoadConst())
{
intptr_t limit = limitNode->getType().isInt32() ?
limitNode->getInt() : limitNode->getLongInt();
if ((li->_increasing && limit < limit + li->_stripLen) ||
(!li->_increasing && limit > limit - li->_stripLen))
{
if (trace())
traceMsg(comp(), "No overflow test for %s loop %d: limit = %ld, stripLength = %ld\n",
li->_increasing ? "increasing" : "decreasing",
loop->getNumber(), limit, li->_stripLen);
testOverflow = false;
}
}
// If overflow test is needed, create an if block to test:
// N > TR::getMaxSigned<TR::Int32>() - stripLength or N < TR::getMinSigned<TR::Int32>() + stripLength
TR::Block *ifOverBlock = NULL;
if (testOverflow)
{
ifOverBlock = TR::Block::createEmptyBlock(phNode, comp(), ph->getFrequency(), ph);
TR::ILOpCodes opCode;
TR::Node *overflowNode;
int64_t constVal;
if (li->_increasing)
{
opCode = isInt32 ? TR::ificmpgt : TR::iflcmpgt;
constVal = (TR::getMaxSigned<TR::Int32>() - stripLength);
}
else
{
opCode = isInt32 ? TR::ificmplt : TR::iflcmplt;
constVal = (TR::getMinSigned<TR::Int32>() + stripLength);
}
overflowNode = isInt32 ? TR::Node::iconst(phNode, (int32_t)constVal) :
TR::Node::lconst(phNode, constVal);
TR::Node *ifOverNode = TR::Node::createif(opCode, limitNode->duplicateTree(), overflowNode, phEntry);
TR::TreeTop *ifOverTree = TR::TreeTop::create(comp(), ifOverNode);
ifOverBlock->append(ifOverTree);
_cfg->addNode(ifOverBlock);
_endTree->join(ifOverBlock->getEntry());
ifOverBlock->getExit()->setNextTreeTop(NULL);
_endTree = ifOverBlock->getExit();
if (trace())
traceMsg(comp(), "\tcreating overflow test [%p] in block [%d]\n", ifOverNode, ifOverBlock->getNumber());
// Point the original loop pre-header's predecessor to the if over block
if (trace())
traceMsg(comp(), "\tfixing predecessor edges of original loop pre-header [%d] :\n",
ph->getNumber());
for (auto edge = ph->getPredecessors().begin(); edge != ph->getPredecessors().end(); ++edge)
{
TR::Block *fromBlock = toBlock((*edge)->getFrom());
if (trace())
traceMsg(comp(), "\t for edge: [%d] => [%d]\n", fromBlock->getNumber(), ph->getNumber());
redirect(fromBlock, ph, ifOverBlock);
li->_edgesToRemove.add(*edge);
}
// Add an edge: if over -> pre-header
//
if (trace())
traceMsg(comp(), "\t adding edge: overflow test block [%d] => original pre-header [%d]\n",
ifOverBlock->getNumber(), ph->getNumber());
_cfg->addEdge(ifOverBlock, ph);
}
// Create an empty block as an outer loop header
//
TR::Block *outerHeader = TR::Block::createEmptyBlock(clonedPhNode, comp(),
clonedPh->getFrequency(), clonedPh);
_cfg->addNode(outerHeader);
_endTree->join(outerHeader->getEntry());
outerHeader->getExit()->setNextTreeTop(NULL);
_endTree = outerHeader->getExit();
outerHeader->setFrequency((int32_t) ((float) outerHeader->getFrequency()/10));
// If we need an offset loop to get to the beginning of a leaf
if (li->_needOffsetLoop)
{
TR::Block *offsetLoopTest = createStartOffsetLoop(li, outerHeader);
TR::Block *offsetLoopPh = _offsetBlockMapper[ph->getNumber()];
if (testOverflow)
{
// Add a goto block to transfer control to offsetLoop
TR::Block *gotoBlock = createGotoBlock(ifOverBlock, offsetLoopPh);
gotoBlock->setFrequency((int32_t) ((float) gotoBlock->getFrequency()/10));
if (trace())
{
traceMsg(comp(),
"\t adding edges: overflow test block [%d] => goto [%d]; " \
"goto [%d] => start position loop [%d]\n",
ifOverBlock->getNumber(), gotoBlock->getNumber(),
gotoBlock->getNumber(), offsetLoopPh->getNumber());
}
}
else
{
// Point the original loop pre-header's predecessor to offsetLoop
if (trace())
traceMsg(comp(), "\tfixing edges: preds of pre-header [%d] -> offset loop [%d]\n",
ph->getNumber(), offsetLoopPh->getNumber());
for (auto edge = ph->getPredecessors().begin(); edge != ph->getPredecessors().end(); ++edge)
{
TR::Block *fromBlock = toBlock((*edge)->getFrom());
if (trace())
traceMsg(comp(), "\t for edge: [%d] => [%d]\n", fromBlock->getNumber(), ph->getNumber());
redirect(fromBlock, ph, offsetLoopPh);
li->_edgesToRemove.add(*edge);
}
}
}
else
{
if (testOverflow)
{
// Add an edge: if over -> outer header
//
if (trace())
traceMsg(comp(), "\t adding edge: overflow test block [%d] => outer pre-header [%d]\n",
ifOverBlock->getNumber(), outerHeader->getNumber());
_cfg->addEdge(ifOverBlock, outerHeader);
}
else
{
// Point the original loop pre-header's predecessor to outer header
if (trace())
traceMsg(comp(), "\tfixing edges: preds of pre-header [%d] -> outer header [%d]\n",
ph->getNumber(), outerHeader->getNumber());
for (auto edge = ph->getPredecessors().begin(); edge != ph->getPredecessors().end(); ++edge)
{
TR::Block *fromBlock = toBlock((*edge)->getFrom());
if (trace())
traceMsg(comp(), "\t for edge: [%d] => [%d]\n", fromBlock->getNumber(), ph->getNumber());
redirect(fromBlock, ph, outerHeader);
li->_edgesToRemove.add(*edge);
}
}
}
////////////////////////////////////////
// Create a main strip mined loop
///////////////////////////////////////
if (trace())
traceMsg(comp(), "<stripMining loop=%d outer header=%d>\n", li->_regionNum,
outerHeader->getNumber());
TR::Block *branchBlock = stripMineLoop(li, outerHeader);
//////////////////////////////////////////
////add pre/post loops if needed and fix up
////////////////////////////////////
// If there is a pre-offset, create a goto block to the preloop pre-header
//
if (li->_preOffset > 0)
{
TR::Block *pre = _preBlockMapper[ph->getNumber()];
TR::Block *preLt = _preBlockMapper[lt->getNumber()];
TR::Block *gotoBlock = createGotoBlock(outerHeader, pre);
gotoBlock->setFrequency((int32_t) ((float) gotoBlock->getFrequency()/10));
if (trace())
{
traceMsg(comp(),
"\t adding edges: outer header [%d] => goto [%d]; " \
"goto [%d] => preloop pre-header [%d]\n",
outerHeader->getNumber(), gotoBlock->getNumber(),
gotoBlock->getNumber(), pre->getNumber());
}
/* Create and insert an if block: i < i + pre-offset */
TR::Block *ifBlock = createLoopTest(li, preLoop);
/* Fix the edges */
if (trace())
traceMsg(comp(), "\t fixing preloop loop test successor edges:\n");
for (auto edge = lt->getSuccessors().begin(); edge != lt->getSuccessors().end(); ++edge)
{
TR::Block *fromBlock = _preBlockMapper[(*edge)->getFrom()->getNumber()];
TR::Block *dest = toBlock((*edge)->getTo());
TR::Block *clonedDest = _preBlockMapper[dest->getNumber()];
if (clonedDest)
{
TR::Block *oldDest = li->_branchToExit ? clonedDest : dest;
/* preloop's loop test -> if block */
redirect(fromBlock, oldDest, ifBlock);
/* if block -> cloned destination */
redirect(ifBlock, oldDest, clonedDest);
}
else
{
/* preloop's loop test -> exit block */
redirect(fromBlock, dest, dest);
/* if block -> cloned pre-header */
redirect(ifBlock, dest, branchBlock);
}
}
}
else
{
/* Create a goto block to the cloned loop's pre-header */
TR::Block *gotoBlock = createGotoBlock(outerHeader, branchBlock);
if (trace())
traceMsg(comp(),
"\t adding edges: outer header [%d] => goto [%d]; " \
"goto [%d] => branch [%d]\n",
outerHeader->getNumber(), gotoBlock->getNumber(),
gotoBlock->getNumber(), branchBlock->getNumber());
}
/* If there is a post-offset, redirect cloned loop's exit edges to the postloop pre-header */
if (li->_postOffset > 0)
{
TR::Block *post = _postBlockMapper[ph->getNumber()];
TR::Block *postLt = _postBlockMapper[lt->getNumber()];
/* Create and insert an if block: i < i + post-offset */
TR::Block *ifBlock = createLoopTest(li, postLoop);
/* Fix the edges */
if (trace())
traceMsg(comp(), "\t fixing postloop loop test successor edges:\n");
for (auto edge = lt->getSuccessors().begin(); edge != lt->getSuccessors().end(); ++edge)
{
TR::Block *fromBlock = _postBlockMapper[(*edge)->getFrom()->getNumber()];
TR::Block *dest = toBlock((*edge)->getTo());
TR::Block *clonedDest = _postBlockMapper[dest->getNumber()];
if (clonedDest)
{
TR::Block *oldDest = li->_branchToExit ? clonedDest : dest;
/* postloop's loop test -> if block */
redirect(fromBlock, oldDest, ifBlock);
/* if block -> cloned destination */
redirect(ifBlock, oldDest, clonedDest);
}
else
{
/* postloop's loop test -> exit block */
redirect(fromBlock, dest, dest);
/* if block -> outer header */
redirect(ifBlock, dest, outerHeader);
}
}
}
/* Remove all unwanted edges */
ListIterator<TR::CFGEdge> eIt(&li->_edgesToRemove);
TR::CFGEdge *edge;
for (edge = eIt.getFirst(); edge; edge = eIt.getNext())
{
_cfg->removeEdge(edge);
if (trace())
traceMsg(comp(), "\t removing edge: [%d] => [%d]\n", edge->getFrom()->getNumber(),
edge->getTo()->getNumber());
}
if (trace())
{
comp()->dumpMethodTrees("stripMining: trees after loop transformation");
///comp()->getDebug()->print(comp()->getOutFile(), _cfg);
}
}
TR::Block *TR_StripMiner::createStartOffsetLoop(LoopInfo *li, TR::Block *outerHeader)
{
// create a new block which contains the new loop test
// (i & stripLen) > 0
// this positions the start value of the iv at the beginning of an arraylet
//
TR::Block *ltBlock = _offsetBlockMapper[li->_loopTest->getNumber()];
TR::Node *ltNode = ltBlock->getLastRealTreeTop()->getNode();
TR::Block *newLtBlock = TR::Block::createEmptyBlock(ltNode, comp(), ltBlock->getFrequency(), ltBlock);
TR::Node *newLtNode = ltNode->duplicateTree();
newLtBlock->append(TR::TreeTop::create(comp(), newLtNode));
_endTree->join(newLtBlock->getEntry());
newLtBlock->getExit()->setNextTreeTop(NULL);
_endTree = newLtBlock->getExit();
_cfg->addNode(newLtBlock);
bool isInt32 = li->_piv->getSymRef()->getSymbol()->getType().isInt32();
// modify the looptest as
// ifXcmple --> exit
// xand
// xload
// stripLen-1
// zeroNode
//
TR::Node *iNode = TR::Node::createLoad(newLtNode, li->_piv->getSymRef());
TR::ILOpCodes iandOp = isInt32 ? TR::iand : TR::land;
TR::Node *stripLenNode = isInt32 ? TR::Node::iconst(newLtNode, static_cast<int32_t>(li->_stripLen-1)) :
TR::Node::lconst(newLtNode, (int64_t)(li->_stripLen-1));
TR::Node *iAndNode = TR::Node::create(iandOp, 2, iNode, stripLenNode);
TR::Node *zeroNode = isInt32 ? TR::Node::iconst(newLtNode, 0) :
TR::Node::lconst(newLtNode, (int64_t)0);
newLtNode->getFirstChild()->recursivelyDecReferenceCount();
newLtNode->getSecondChild()->recursivelyDecReferenceCount();
newLtNode->setAndIncChild(0, iAndNode);
newLtNode->setAndIncChild(1, zeroNode);
TR::Node::recreate(newLtNode, isInt32 ? TR::ificmple : TR::iflcmple);
// now fixup the edges
//
TR::Block *oldDest = NULL;
TR::Block *origExit = NULL;
if (li->_branchToExit)
{
// backedge is the fall-through
//