/
OpMemToMem.cpp
2737 lines (2323 loc) · 103 KB
/
OpMemToMem.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, 2019 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 "z/codegen/OpMemToMem.hpp"
#include <limits.h>
#include <stdio.h>
#include "codegen/CodeGenerator.hpp"
#include "codegen/FrontEnd.hpp"
#include "codegen/RealRegister.hpp"
#include "codegen/Register.hpp"
#include "codegen/RegisterDependency.hpp"
#include "codegen/TreeEvaluator.hpp"
#include "codegen/S390Evaluator.hpp"
#include "compile/SymbolReferenceTable.hpp"
#include "control/Options.hpp"
#include "control/Options_inlines.hpp"
#include "env/CompilerEnv.hpp"
#include "env/jittypes.h"
#include "il/AliasSetInterface.hpp"
#include "il/ILOpCodes.hpp"
#include "il/ILOps.hpp"
#include "il/Node.hpp"
#include "il/Symbol.hpp"
#include "il/SymbolReference.hpp"
#include "il/symbol/LabelSymbol.hpp"
#include "il/symbol/ResolvedMethodSymbol.hpp"
#include "infra/List.hpp"
#include "runtime/Runtime.hpp"
#include "z/codegen/S390GenerateInstructions.hpp"
#include "z/codegen/S390OutOfLineCodeSection.hpp"
bool useLockedLitPoolBaseRegister(TR::CodeGenerator *cg)
{
if (cg->isLiteralPoolOnDemandOn())
return false;
return true;
}
TR::Register *allocateRegForLiteralPoolBase(TR::CodeGenerator *cg)
{
if (useLockedLitPoolBaseRegister(cg))
return cg->getLitPoolRealRegister();
else
return cg->allocateRegister();
}
/**
* Generate the loop that will perform a memory-to-memory instruction
* on 256 bytes.
* The format of the loop is:
* <copy length (in bytes) into _itersReg>
* <shift by 8 to determine number of loop iterations on 256 bytes>
* <if 0, branch around loop>
* <make virtual call out to specific loop body routine>
* <generate BRCT to branch back based on _itersReg>
* <create register dependencies for internal control flow>
*
* generate a loop of 256 byte mem ops
*/
TR::Instruction *
MemToMemVarLenMacroOp::generateLoop()
{
TR::Compilation *comp = _cg->comp();
bool needs64BitOpCode = TR::Compiler->target.is64Bit();
if (useEXForRemainder())
{
// need to do this before the branch or some
// instructions may not be executed. this is a problem
// when nodes from memrefs are commoned with something
// down below the branch label
generateSrcMemRef(0);
generateDstMemRef(0);
// non-Java specialization
if (!_lengthMinusOne)
{
generateRIInstruction(_cg, (needs64BitOpCode) ? TR::InstOpCode::AGHI : TR::InstOpCode::AHI, _rootNode, _regLen, -1);
}
if (_lengthMinusOne)
generateRRInstruction(_cg, TR::InstOpCode::LTR, _rootNode, _regLen, _regLen); //Because transformLengthMinusOneForMemoryOps uses TR::iadd
_doneLabel = generateLabelSymbol(_cg);
_startControlFlow = generateS390BranchInstruction(_cg, TR::InstOpCode::BRC, TR::InstOpCode::COND_BL, _rootNode, _doneLabel);
}
if (getKind() == MemToMemMacroOp::IsMemInit)
generateInstruction(0, 1);
if (!needsLoop()) return NULL;
TR::LabelSymbol * topOfLoop = generateLabelSymbol(_cg);
TR::LabelSymbol * bottomOfLoop = generateLabelSymbol(_cg);
//
// But first, load up the branch address into raReg for two reasons:
// 1) to avoid the AGI on the indirection and (more importantly)
// 2) to ensure that no wierd spilling happens if the code decides it needs
// to allocate a register at this point for the literal pool base address.
intptrj_t helper = 0;
if (!useEXForRemainder())
{
helper = getHelper();
if (_raReg == NULL)
_raReg = _cg->allocateRegister();
//use literal for aot to make it easier for relocation
if (comp->compileRelocatableCode())
{
generateRegLitRefInstruction(_cg, TR::InstOpCode::getLoadOpCode(), _rootNode, _raReg, (uintptrj_t)getHelperSymRef(), TR_HelperAddress, NULL, NULL, NULL);
}
else
{
genLoadAddressConstant(_cg, _rootNode, helper, _raReg);
}
}
if (_itersReg == NULL)
_itersReg = _cg->allocateRegister();
if (needs64BitOpCode)
{
generateRSInstruction(_cg, TR::InstOpCode::SRAG, _rootNode, _itersReg, _regLen, 8);
}
else
{
if (TR::Compiler->target.cpu.getSupportsArch(TR::CPU::z196))
{
generateRSInstruction(_cg, TR::InstOpCode::SRAK, _rootNode, _itersReg, _regLen, 8);
}
else
{
generateRRInstruction(_cg, TR::InstOpCode::LR, _rootNode, _itersReg, _regLen);
generateRSInstruction(_cg, TR::InstOpCode::SRA, _rootNode, _itersReg, 8);
}
}
generateS390BranchInstruction(_cg, TR::InstOpCode::BRC, TR::InstOpCode::COND_BE, _rootNode, bottomOfLoop);
generateS390LabelInstruction(_cg, TR::InstOpCode::LABEL, _rootNode, topOfLoop);
generateInstruction(0, 256);
generateRXInstruction(_cg, TR::InstOpCode::LA, _srcNode, _srcReg, new (_cg->trHeapMemory()) TR::MemoryReference(_srcReg, 256, _cg));
if (_srcReg != _dstReg)
{
generateRXInstruction(_cg, TR::InstOpCode::LA, _dstNode, _dstReg, new (_cg->trHeapMemory()) TR::MemoryReference(_dstReg, 256, _cg));
}
generateS390BranchInstruction(_cg, TR::InstOpCode::BRCT, _rootNode, _itersReg, topOfLoop);
if (TR::Compiler->target.cpu.getSupportsArch(TR::CPU::z10) && !comp->getOption(TR_DisableInlineEXTarget))
{
if (useEXForRemainder())
{
generateSrcMemRef(0);
generateDstMemRef(0);
generateS390BranchInstruction(_cg, TR::InstOpCode::BRC, TR::InstOpCode::COND_MASK15, _rootNode, bottomOfLoop);
generateS390LabelInstruction(_cg, TR::InstOpCode::LABEL, _rootNode, _EXTargetLabel = generateLabelSymbol(_cg));
// This instruction will be used as the target of the EXRL in the remainder calculation
generateInstruction(0, 1);
}
}
TR::Instruction * cursor = generateS390LabelInstruction(_cg, TR::InstOpCode::LABEL, _rootNode, bottomOfLoop);
_cg->stopUsingRegister(_itersReg);
if (!useEXForRemainder())
_cg->stopUsingRegister(_raReg);
return cursor;
}
bool
MemToMemVarLenMacroOp::needsLoop()
{
int64_t maxLength = 0;
if (_cg->inlineNDmemcpyWithPad(_rootNode, &maxLength))
{
if (maxLength == 0 || maxLength > 256)
return true;
else
return false;
}
return true;
}
TR::Instruction *
MemToMemMacroOp::genSrcLoadAddress(int32_t offset, TR::Instruction *cursor)
{
TR_ASSERT(_srcMR,"_srcMR must be non-NULL when _srcReg is NULL for node %p\n",_srcNode);
_srcRegTemp = _cg->allocateRegister();
cursor = _cg->genLoadAddressToRegister(_srcRegTemp, reuseS390MemoryReference(_srcMR, offset, _srcNode, _cg, false), _srcNode, cursor);
_srcReg = _srcRegTemp;
_srcMR = NULL; // use _srcReg from here on out in generateInstruction
return cursor;
}
TR::Instruction *
MemToMemMacroOp::genDstLoadAddress(int32_t offset, TR::Instruction *cursor)
{
TR_ASSERT(_dstMR,"_dstMR must be non-NULL when _dstReg is NULL for node %p\n",_dstNode);
_dstRegTemp = _cg->allocateRegister();
cursor = _cg->genLoadAddressToRegister(_dstRegTemp, reuseS390MemoryReference(_dstMR, offset, _dstNode, _cg, false), _dstNode, cursor);
_dstReg = _dstRegTemp;
_dstMR = NULL; // use _dstReg from here on out in generateInstruction
return cursor;
}
/**
* Very similar to the variable length logic in MemToMemVarLenMacroOp::generateLoop, except that
* since the length is constant, the header of the loop is different,
* and we can skip the loop generation if the amount to copy is
* small enough.
*/
TR::Instruction *
MemToMemConstLenMacroOp::generateLoop()
{
//extend support of array size upto uint64_t
//TR_ASSERT(((uint64_t)INT_MAX*8) > _length, "_length should not exceed the maximum array size in bytes,INT_MAX*8 = 0x%x%x, _length = 0x%x%x",(((uint64_t)INT_MAX*8) >>32), (uint32_t)((uint64_t)INT_MAX*8), (_length >> 32), (uint32_t)_length);
uint64_t len = (uint64_t)_length;
TR::Compilation *comp = _cg->comp();
int64_t largeCopies = (len == 0) ? 0 : (len - 1) / 256;
TR::Instruction * cursor = (_cursor == NULL ? _cg->getAppendInstruction() : _cursor);
// if the length is small, just generate one instruction
if (len <= (uint64_t)256)
{
return cursor;
}
// if a series of instructions can be done instead of a loop of them, do so, but only if it will not exceed the 4K displacement on XC
if (largeCopies != 0 && largeCopies < _maxCopies)
{
int64_t copies = largeCopies;
int32_t remaining = 0;
if (!_srcMR && !_srcReg)
{
_srcMR = generateS390MemoryReference(_cg, _rootNode, _srcNode, 0, true);
cursor = _cg->getAppendInstruction();
}
if (!_dstMR && !_dstReg)
{
_dstMR = generateS390MemoryReference(_cg, _rootNode, _dstNode, 0, true);
cursor = _cg->getAppendInstruction();
}
int32_t srcMROffset = _srcMR ? _srcMR->getOffset() : 0;
// the offset may put the displacement beyond 4K
if (largeCopies * 256 + _offset + srcMROffset >= 4096)
{
// this early LA isn't needed for correctness as the later generated SS instructions will enforce the limits but doing
// this upfront instead saves possibly multiple fixup LAs later on
if (_srcReg == NULL)
cursor = genSrcLoadAddress(_offset, cursor);
else
cursor = generateRXInstruction(_cg, TR::InstOpCode::LA, _srcNode, _srcReg, new (_cg->trHeapMemory()) TR::MemoryReference(_srcReg, _offset, _cg), cursor);
_offset = 0;
}
if (_srcReg == NULL || _dstReg == NULL || _srcReg != _dstReg)
{
int32_t dstMROffset = _dstMR ? _dstMR->getOffset() : 0;
bool dstRegIsATemp = false;
// _offset only applies when srcReg == dstReg see use in initStg
if (largeCopies * 256 + dstMROffset >= 4096)
{
// this early LA isn't needed for correctness as the later generated SS instructions will enforce the limits but doing
// this upfront instead saves possibly multiple fixup LAs later on
if (_dstReg == NULL)
cursor = genDstLoadAddress(0, cursor);
else
cursor = generateRXInstruction(_cg, TR::InstOpCode::LA, _dstNode, _dstReg, new (_cg->trHeapMemory()) TR::MemoryReference(_dstReg, 0, _cg), cursor);
}
}
if (_inNestedICF)
{
_nestedICFDeps = generateRegisterDependencyConditions(0, 6, _cg);
if (_srcMR) _nestedICFDeps->addAssignAnyPostCondOnMemRef(_srcMR);
if (_dstMR) _nestedICFDeps->addAssignAnyPostCondOnMemRef(_dstMR);
if (_srcReg) _nestedICFDeps->addPostConditionIfNotAlreadyInserted(_srcReg, TR::RealRegister::AssignAny);
if (_dstReg) _nestedICFDeps->addPostConditionIfNotAlreadyInserted(_dstReg, TR::RealRegister::AssignAny);
}
setDependencies(false); //Normal dependencies are definitely not necessary
while (largeCopies > 0)
{
cursor = generateInstruction(_offset + (copies - largeCopies) * 256, 256, cursor);
--largeCopies;
}
len = len - copies * 256;
_length = (int64_t)len;
_offset = _offset + copies * 256;
_cursor = cursor;
return cursor;
}
//If the length is at the THRESHOLD=77825 i.e., 4096*19+1, MVCL becomes a better choice.
//In general, MVCL shows performance gain over LOOP with MVCs when the length is
//within [4K*i+1, 4K*i+4089], i=19,20,...,4095.
//Notice that within the small range [4K*i-7, 4K*i], MVCL is significantly degraded. (3 times slower than normal detected)
//In order to use MVCL, we have also to make sure that the use is safe. i.e., src and dst are NOT aliased.
const uint64_t MVCL_THRESHOLD_LOW = 77825; // MVCL is only considered when the length >= 4096*19+1
const uint64_t MVCL_THRESHOLD_HIGH = 16777216; // 2^24 is technically the maximum length for an MVCL
bool inRange = len >= MVCL_THRESHOLD_LOW && len < MVCL_THRESHOLD_HIGH &&
(len % 4096) >= (uint64_t)1 && (len % 4096) <= (uint64_t)4089;
bool aliasingPattern = false;
TR::SymbolReference * srcSymRef = NULL;
int32_t srcMemClass = 0;
uint64_t srcOffset = 0;
TR::SymbolReference * dstSymRef = NULL;
int32_t dstMemClass = 0;
uint64_t dstOffset = 0;
if (inRange && (aliasingPattern || !_cg->storageMayOverlap(_srcNode, len, _dstNode, len)) && !_cg->inlineNDmemcpyWithPad(_rootNode))
{
TR::InstOpCode::Mnemonic opCode = TR::InstOpCode::MVCL;
if (_dstReg == NULL)
genDstLoadAddress(0, NULL);
TR::Register *targetEvenRegister = _dstReg;
TR::Node *targetAddress = _dstNode;
TR::Register *targetOddRegister = _cg->allocateRegister();
generateLoad32BitConstant(_cg, _rootNode, len, targetOddRegister, true);
if (_srcReg == NULL)
genSrcLoadAddress(0, NULL);
TR::Register *sourceEvenRegister = _srcReg;
TR::Node *sourceAddress = _srcNode;
TR::Register *sourceOddRegister = _cg->allocateRegister();
generateLoad32BitConstant(_cg, _rootNode, len, sourceOddRegister, true);
TR::RegisterPair * sourcePairRegister = _cg->allocateConsecutiveRegisterPair(sourceOddRegister,sourceEvenRegister);
TR::RegisterPair * targetPairRegister = _cg->allocateConsecutiveRegisterPair(targetOddRegister,targetEvenRegister);
TR::RegisterDependencyConditions * dependencies = _cg->createDepsForRRMemoryInstructions(_rootNode, sourcePairRegister, targetPairRegister);
TR::Instruction * cursor = generateRRInstruction(_cg, opCode, _rootNode, targetPairRegister, sourcePairRegister);
_cg->stopUsingRegister(sourcePairRegister);
_cg->stopUsingRegister(targetPairRegister);
_cg->stopUsingRegister(targetOddRegister);
_cg->stopUsingRegister(sourceOddRegister);
if (!_inNestedICF)
cursor->setDependencyConditions(dependencies);
else
_nestedICFDeps = dependencies;
setDependencies(false); //Normal dependencies are definitely not necessary
_cursor = cursor;
_length = 0;
return cursor;
}
TR_ASSERT( needsLoop(), "We are generating a loop but needsLoop is false");
if (_srcReg == NULL)
cursor = genSrcLoadAddress(0, cursor);
if (_dstReg == NULL)
cursor = genDstLoadAddress(0, cursor);
//
// At this point, we need to generate a loop since the length is large
//
TR::LabelSymbol * topOfLoop = generateLabelSymbol(_cg);
TR::LabelSymbol * bottomOfLoop = generateLabelSymbol(_cg);
if (_itersReg == NULL)
_itersReg = (_tmpReg == NULL ? _cg->allocateRegister() : _tmpReg);
if (TR::Compiler->target.is64Bit())
cursor = genLoadLongConstant(_cg, _rootNode, largeCopies, _itersReg, cursor, NULL, NULL);
else
cursor = generateLoad32BitConstant(_cg, _rootNode, largeCopies, _itersReg, true, cursor, NULL, NULL);
_startControlFlow = cursor = generateS390LabelInstruction(_cg, TR::InstOpCode::LABEL, _rootNode, topOfLoop, cursor);
cursor = generateInstruction(_offset, 256, cursor);
cursor = generateRXInstruction(_cg, TR::InstOpCode::LA, _srcNode, _srcReg, new (_cg->trHeapMemory()) TR::MemoryReference(_srcReg, 256, _cg), cursor);
if (_srcReg != _dstReg)
{
cursor = generateRXInstruction(_cg, TR::InstOpCode::LA, _dstNode, _dstReg, new (_cg->trHeapMemory()) TR::MemoryReference(_dstReg, 256, _cg), cursor);
}
cursor = generateS390BranchInstruction(_cg, TR::InstOpCode::BRCT, _rootNode, _itersReg, topOfLoop, cursor);
cursor = generateS390LabelInstruction(_cg, TR::InstOpCode::LABEL, _rootNode, bottomOfLoop, cursor);
len = len - (largeCopies * 256);
_length = (int64_t)len;
_cursor = cursor;
_cg->stopUsingRegister(_itersReg);
return cursor;
}
TR::Instruction *
MemToMemConstLenMacroOp::generateRemainder()
{
TR::Compilation *comp = _cg->comp();
uint64_t len = (uint64_t)_length;
TR::Instruction * cursor = (_cursor == NULL ? _cg->getAppendInstruction() : _cursor);
if (len >= MemToMemMacroOp::MIN_LENGTH_FOR_SS_INSTRUCTION)
{
cursor = generateInstruction(_offset, len, cursor);
}
_cursor = cursor;
return cursor;
}
/**
* Very similar to the variable length logic in MemToMemVarLenMacroOp::generateLoop, except that
* since the length is constant, the header of the loop is different,
* and we can skip the loop generation if the amount to copy is
* small enough.
*/
TR::Instruction *
MemInitConstLenMacroOp::generateLoop()
{
//extend support of array size upto int64_t, the type of length.
//TR_ASSERT(((uint64_t)INT_MAX*8) > _length, "_length should not exceed the maximum array size in bytes,INT_MAX*8 = 0x%x%x, _length = 0x%x%x",(((uint64_t)INT_MAX*8) >>32), (uint32_t)((uint64_t)INT_MAX*8), (_length >> 32), (uint32_t)_length);
uint64_t len = uint64_t(_length);
TR::Compilation *comp = _cg->comp();
if (_dstReg!=NULL)
{
_dstMR=new (_cg->trHeapMemory()) TR::MemoryReference(_dstReg, _offset, _cg);
}
else
{
_dstMR= generateS390MemoryReference(_cg, _rootNode, _dstNode , _offset, true);
}
TR::Instruction * cursor = _cg->getAppendInstruction();
if(len >= (uint64_t)1)
{
if (_useByteVal)
cursor = generateSIInstruction(_cg, TR::InstOpCode::MVI, _rootNode, _dstMR, _byteVal, cursor);
else
cursor = generateRXInstruction(_cg, TR::InstOpCode::STC, _rootNode, _initReg, _dstMR, cursor);
--len;
}
int64_t largeCopies = (len == 0) ? 0 : (len - 1) / 256;
// if the length is small, just generate one instruction
if (len <= (uint64_t)256)
{
_length = (int64_t)len;
setDependencies(false); // Make sure we do not generate dependencies or internalControlFlow
return cursor;
}
// if a series of instructions can be done instead of a loop of them, do so, but only if it will not exceed the 4K displacement on XC
if (largeCopies != 0 && largeCopies < _maxCopies)
{
int64_t copies = largeCopies;
int32_t remaining = 0;
// the offset may put the displacement beyond 4K
if (largeCopies * 256 + _offset >= 4096)
{
cursor = generateRXInstruction(_cg, TR::InstOpCode::LA, _srcNode, _srcReg, new (_cg->trHeapMemory()) TR::MemoryReference(_srcReg, _offset, _cg), cursor);
_offset = 0;
}
int32_t local_offset = 0;
while (largeCopies > 0)
{
local_offset = _offset + (copies - largeCopies) * 256;
cursor = generateSS1Instruction(_cg, TR::InstOpCode::MVC, _rootNode, 255, new (_cg->trHeapMemory()) TR::MemoryReference(_dstReg, local_offset + 1, _cg),
new (_cg->trHeapMemory()) TR::MemoryReference(_srcReg, local_offset, _cg), cursor);
--largeCopies;
}
len = len - copies * 256;
_length = (int64_t)len;
_offset = _offset + copies * 256;
_cursor = cursor;
setDependencies(false); // Make sure we do not generate dependencies or internalControlFlow
return cursor;
}
//
// At this point, we need to generate a loop since the length is large
//
TR::LabelSymbol * topOfLoop = generateLabelSymbol(_cg);
TR::LabelSymbol * bottomOfLoop = generateLabelSymbol(_cg);
if (_itersReg == NULL)
_itersReg = (_tmpReg == NULL ? _cg->allocateRegister() : _tmpReg);
if (TR::Compiler->target.is64Bit())
cursor = genLoadLongConstant(_cg, _rootNode, largeCopies, _itersReg, cursor, NULL, NULL);
else
cursor = generateLoad32BitConstant(_cg, _rootNode, largeCopies, _itersReg, true, cursor, NULL, NULL);
_startControlFlow = cursor = generateS390LabelInstruction(_cg, TR::InstOpCode::LABEL, _rootNode, topOfLoop, cursor);
cursor = generateSS1Instruction(_cg, TR::InstOpCode::MVC, _rootNode, 255, new (_cg->trHeapMemory()) TR::MemoryReference(_dstReg, _offset + 1, _cg),
new (_cg->trHeapMemory()) TR::MemoryReference(_srcReg, _offset, _cg), cursor);
cursor = generateRXInstruction(_cg, TR::InstOpCode::LA, _srcNode, _srcReg, new (_cg->trHeapMemory()) TR::MemoryReference(_srcReg, 256, _cg), cursor);
if (_srcReg != _dstReg)
{
cursor = generateRXInstruction(_cg, TR::InstOpCode::LA, _dstNode, _dstReg, new (_cg->trHeapMemory()) TR::MemoryReference(_dstReg, 256, _cg), cursor);
}
cursor = generateS390BranchInstruction(_cg, TR::InstOpCode::BRCT, _rootNode, _itersReg, topOfLoop, cursor);
cursor = generateS390LabelInstruction(_cg, TR::InstOpCode::LABEL, _rootNode, bottomOfLoop, cursor);
len = len - (uint64_t)(largeCopies * 256);
_length = (int64_t)len;
_cursor = cursor;
_cg->stopUsingRegister(_itersReg);
return cursor;
}
TR::Instruction *
MemInitConstLenMacroOp::generateRemainder()
{
TR::Compilation *comp = _cg->comp();
uint64_t len = (uint64_t)_length;
TR::Instruction * cursor = (_cursor == NULL ? _cg->getAppendInstruction() : _cursor);
if (len >= MemToMemMacroOp::MIN_LENGTH_FOR_SS_INSTRUCTION)
{
cursor = generateInstruction(_offset, len, cursor);
}
_cursor = cursor;
return cursor;
}
intptrj_t
MemInitVarLenMacroOp::getHelper()
{
return (intptrj_t) _cg->symRefTab()->findOrCreateRuntimeHelper(TR_S390arraySetGeneralHelper, false, false, false)->getMethodAddress();
}
intptrj_t
MemClearVarLenMacroOp::getHelper()
{
return (intptrj_t) _cg->symRefTab()->findOrCreateRuntimeHelper(TR_S390arraySetZeroHelper, false, false, false)->getMethodAddress();
}
intptrj_t
MemCpyVarLenMacroOp::getHelper()
{
return (intptrj_t) _cg->symRefTab()->findOrCreateRuntimeHelper(TR_S390arrayCopyHelper, false, false, false)->getMethodAddress();
}
intptrj_t
MemCmpVarLenMacroOp::getHelper()
{
return (intptrj_t) _cg->symRefTab()->findOrCreateRuntimeHelper(TR_S390arrayCmpHelper, false, false, false)->getMethodAddress();
}
intptrj_t
BitOpMemVarLenMacroOp::getHelper()
{
switch(_opcode)
{
case TR::InstOpCode::XC:
return (intptrj_t) _cg->symRefTab()->findOrCreateRuntimeHelper(TR_S390arrayXORHelper, false, false, false)->getMethodAddress();
case TR::InstOpCode::NC:
return (intptrj_t) _cg->symRefTab()->findOrCreateRuntimeHelper(TR_S390arrayANDHelper, false, false, false)->getMethodAddress();
case TR::InstOpCode::OC:
return (intptrj_t) _cg->symRefTab()->findOrCreateRuntimeHelper(TR_S390arrayORHelper, false, false, false)->getMethodAddress();
default:
TR_ASSERT( 0, "not support");
}
return 0;
}
TR::SymbolReference *
MemInitVarLenMacroOp::getHelperSymRef()
{
return _cg->getSymRef(TR_S390arraySetGeneralHelper);
}
TR::SymbolReference *
MemClearVarLenMacroOp::getHelperSymRef()
{
return _cg->getSymRef(TR_S390arraySetZeroHelper);
}
TR::SymbolReference *
MemCpyVarLenMacroOp::getHelperSymRef()
{
return _cg->getSymRef(TR_S390arrayCopyHelper);
}
TR::SymbolReference *
MemCmpVarLenMacroOp::getHelperSymRef()
{
return _cg->getSymRef(TR_S390arrayCmpHelper);
}
TR::SymbolReference *
BitOpMemVarLenMacroOp::getHelperSymRef()
{
switch(_opcode)
{
case TR::InstOpCode::XC:
return _cg->getSymRef(TR_S390arrayXORHelper);
case TR::InstOpCode::NC:
return _cg->getSymRef(TR_S390arrayANDHelper);
case TR::InstOpCode::OC:
return _cg->getSymRef(TR_S390arrayORHelper);
default:
TR_ASSERT( 0, "not support");
}
return 0;
}
TR::RegisterDependencyConditions *
MemInitConstLenMacroOp::generateDependencies()
{
if(!(_dstReg || _itersReg || _initReg) || !needDependencies())
return NULL;
TR::RegisterDependencyConditions * dependencies;
if (noLoop())
{
dependencies = generateRegisterDependencyConditions(0, 2, _cg);
if (_dstReg) dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny);
if (_initReg) dependencies->addPostCondition(_initReg, TR::RealRegister::AssignAny);
}
else
{
dependencies = generateRegisterDependencyConditions(0, 3, _cg);
if (useEXForRemainder())
{
dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny, RefsAndDefsDependentRegister);
if (_initReg) dependencies->addPostCondition(_initReg, TR::RealRegister::AssignAny);
dependencies->addPostCondition(_itersReg, TR::RealRegister::AssignAny);
}
else
{
dependencies->addPostCondition(_dstReg, TR::RealRegister::GPR1, RefsAndDefsDependentRegister);
if (_initReg) dependencies->addPostCondition(_initReg, TR::RealRegister::GPR2);
dependencies->addPostCondition(_itersReg, TR::RealRegister::GPR0);
}
}
return dependencies;
}
TR::RegisterDependencyConditions *
MemClearConstLenMacroOp::generateDependencies()
{
if(!(_dstReg || _itersReg))
return NULL;
TR::RegisterDependencyConditions * dependencies = NULL;
if (needDependencies())
{
if (noLoop())
{
dependencies = generateRegisterDependencyConditions(0, 1, _cg);
if (_dstReg!=NULL) dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny);
}
else
{
dependencies = generateRegisterDependencyConditions(0, 2, _cg);
if (useEXForRemainder())
{
dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_itersReg, TR::RealRegister::AssignAny);
}
else
{
dependencies->addPostCondition(_dstReg, TR::RealRegister::GPR1, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_itersReg, TR::RealRegister::GPR0);
}
}
}
return dependencies;
}
TR::RegisterDependencyConditions *
MemCpyConstLenMacroOp::generateDependencies()
{
if(!(_dstReg || _srcReg || _itersReg))
return NULL;
TR::RegisterDependencyConditions * dependencies = NULL;
if (needDependencies())
{
if (noLoop())
{
dependencies = generateRegisterDependencyConditions(0, 2, _cg);
if (_dstReg) dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny);
if (_srcReg) dependencies->addPostCondition(_srcReg, TR::RealRegister::AssignAny);
}
else
{
dependencies = generateRegisterDependencyConditions(0, 3, _cg);
if (useEXForRemainder())
{
dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_srcReg, TR::RealRegister::AssignAny, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_itersReg, TR::RealRegister::AssignAny);
}
else
{
dependencies->addPostCondition(_dstReg, TR::RealRegister::GPR1, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_srcReg, TR::RealRegister::GPR2, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_itersReg, TR::RealRegister::GPR0);
}
}
if (_inNestedICF)
{
TR_ASSERT(!_nestedICFDeps, "needDependencies should not be true if _nestedICFDeps have already been created");
_nestedICFDeps = dependencies;
}
}
return dependencies;
}
TR::RegisterDependencyConditions *
BitOpMemConstLenMacroOp::generateDependencies()
{
if(!(_dstReg || _srcReg || _itersReg ))
return NULL;
TR::RegisterDependencyConditions * dependencies;
if (noLoop())
{
dependencies = generateRegisterDependencyConditions(0, 2, _cg);
if (_dstReg!=NULL) dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny);
if (_srcReg!=NULL) dependencies->addPostCondition(_srcReg, TR::RealRegister::AssignAny);
}
else
{
dependencies = generateRegisterDependencyConditions(0, 3, _cg);
if (useEXForRemainder())
{
dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_srcReg, TR::RealRegister::AssignAny, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_itersReg, TR::RealRegister::AssignAny);
}
else
{
dependencies->addPostCondition(_dstReg, TR::RealRegister::GPR1, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_srcReg, TR::RealRegister::GPR2, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_itersReg, TR::RealRegister::GPR0);
}
}
return dependencies;
}
TR::RegisterDependencyConditions *
MemCmpConstLenMacroOp::generateDependencies()
{
if(!(_dstReg || _srcReg || _itersReg || _resultReg))
return NULL;
TR::RegisterDependencyConditions * dependencies;
if (noLoop())
{
dependencies = generateRegisterDependencyConditions(0, 3, _cg);
if (_dstReg) dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny);
if (_srcReg) dependencies->addPostCondition(_srcReg, TR::RealRegister::AssignAny);
dependencies->addPostCondition(_resultReg, TR::RealRegister::AssignAny);
}
else
{
dependencies = generateRegisterDependencyConditions(0, 3, _cg);
if (useEXForRemainder())
{
dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_srcReg, TR::RealRegister::AssignAny, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_itersReg, TR::RealRegister::AssignAny);
}
else
{
dependencies->addPostCondition(_dstReg, TR::RealRegister::GPR1, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_srcReg, TR::RealRegister::GPR2, RefsAndDefsDependentRegister);
dependencies->addPostCondition(_itersReg, TR::RealRegister::GPR0);
}
dependencies->addPostCondition(_resultReg, TR::RealRegister::AssignAny);
}
return dependencies;
}
TR::RegisterDependencyConditions *
MemInitVarLenMacroOp::generateDependencies()
{
if(!(_raReg || _dstReg || _srcReg || _initReg || _itersReg || _regLen || _litReg || _litPoolReg))
return NULL;
TR::RegisterDependencyConditions * dependencies = generateRegisterDependencyConditions(0, 7, _cg);
if (_raReg) dependencies->addPostCondition(_raReg, _cg->getReturnAddressRegister());
if (useEXForRemainder())
{
if (_dstReg) dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny);
if (_initReg) dependencies->addPostCondition(_initReg, TR::RealRegister::AssignAny);
if (_itersReg) dependencies->addPostCondition(_itersReg, TR::RealRegister::AssignAny);
}
else
{
if (_dstReg) dependencies->addPostCondition(_dstReg, TR::RealRegister::GPR1);
if (_initReg) dependencies->addPostCondition(_initReg, TR::RealRegister::GPR2);
if (_itersReg) dependencies->addPostCondition(_itersReg, TR::RealRegister::GPR0);
}
if (_regLen) dependencies->addPostCondition(_regLen, TR::RealRegister::AssignAny);
if (_litReg) dependencies->addPostCondition(_litReg, TR::RealRegister::AssignAny);
if (_litPoolReg) dependencies->addPostCondition(_litPoolReg, TR::RealRegister::AssignAny);
return dependencies;
}
TR::RegisterDependencyConditions *
MemClearVarLenMacroOp::generateDependencies()
{
if(!(_raReg || _dstReg || _itersReg || _regLen || _litReg))
return NULL;
TR::RegisterDependencyConditions * dependencies = generateRegisterDependencyConditions(0, 5, _cg);
if (useEXForRemainder())
{
if (_dstReg) dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny);
if (_itersReg) dependencies->addPostCondition(_itersReg, TR::RealRegister::AssignAny);
}
else
{
if (_dstReg) dependencies->addPostCondition(_dstReg, TR::RealRegister::GPR1);
if (_itersReg) dependencies->addPostCondition(_itersReg, TR::RealRegister::GPR0);
}
if (_raReg) dependencies->addPostCondition(_raReg, _cg->getReturnAddressRegister());
if (_regLen) dependencies->addPostCondition(_regLen, TR::RealRegister::AssignAny);
if (_litReg) dependencies->addPostCondition(_litReg, TR::RealRegister::AssignAny);
return dependencies;
}
TR::RegisterDependencyConditions *
MemCpyVarLenMacroOp::generateDependencies()
{
if(!(_raReg || _dstReg || _srcReg || _itersReg || _regLen || _litReg))
return NULL;
TR::RegisterDependencyConditions * dependencies = generateRegisterDependencyConditions(0, 6, _cg);
if (_raReg) dependencies->addPostCondition(_raReg, _cg->getReturnAddressRegister());
if (useEXForRemainder())
{
if (_dstReg) dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny);
if (_srcReg) dependencies->addPostCondition(_srcReg, TR::RealRegister::AssignAny);
if (_itersReg) dependencies->addPostCondition(_itersReg, TR::RealRegister::AssignAny);
}
else
{
if (_dstReg) dependencies->addPostCondition(_dstReg, TR::RealRegister::GPR1);
if (_srcReg) dependencies->addPostCondition(_srcReg, TR::RealRegister::GPR2);
if (_itersReg) dependencies->addPostCondition(_itersReg, TR::RealRegister::GPR0);
}
if (_regLen) dependencies->addPostCondition(_regLen, TR::RealRegister::AssignAny);
if (_litReg) dependencies->addPostCondition(_litReg, TR::RealRegister::AssignAny);
return dependencies;
}
TR::RegisterDependencyConditions *
BitOpMemVarLenMacroOp::generateDependencies()
{
if(!(_raReg || _dstReg || _srcReg || _itersReg || _regLen || _litReg))
return NULL;
TR::RegisterDependencyConditions * dependencies = generateRegisterDependencyConditions(0, 6, _cg);
if (_raReg) dependencies->addPostCondition(_raReg, _cg->getReturnAddressRegister());
if (useEXForRemainder())
{
if (_dstReg) dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny);
if (_srcReg) dependencies->addPostCondition(_srcReg, TR::RealRegister::AssignAny);
if (_itersReg) dependencies->addPostCondition(_itersReg, TR::RealRegister::AssignAny);
}
else
{
if (_dstReg) dependencies->addPostCondition(_dstReg, TR::RealRegister::GPR1);
if (_srcReg) dependencies->addPostCondition(_srcReg, TR::RealRegister::GPR2);
if (_itersReg) dependencies->addPostCondition(_itersReg, TR::RealRegister::GPR0);
}
if (_regLen) dependencies->addPostCondition(_regLen, TR::RealRegister::AssignAny);
if (_litReg) dependencies->addPostCondition(_litReg, TR::RealRegister::AssignAny);
return dependencies;
}
TR::RegisterDependencyConditions *
MemCmpVarLenMacroOp::generateDependencies()
{
if(!(_raReg || _dstReg || _srcReg || _itersReg || _regLen || _litReg || _resultReg || _litPoolReg))
return NULL;
TR::RegisterDependencyConditions * dependencies = generateRegisterDependencyConditions(0, 8, _cg);
if (_raReg) dependencies->addPostCondition(_raReg, _cg->getReturnAddressRegister());
if (useEXForRemainder())
{
if (_dstReg) dependencies->addPostCondition(_dstReg, TR::RealRegister::AssignAny);
if (_srcReg) dependencies->addPostCondition(_srcReg, TR::RealRegister::AssignAny);
if (_itersReg) dependencies->addPostCondition(_itersReg, TR::RealRegister::AssignAny);
}
else
{
if (_dstReg) dependencies->addPostCondition(_dstReg, TR::RealRegister::GPR1);
if (_srcReg) dependencies->addPostCondition(_srcReg, TR::RealRegister::GPR2);
if (_itersReg) dependencies->addPostCondition(_itersReg, TR::RealRegister::GPR0);
}
if (_resultReg) dependencies->addPostCondition(_resultReg, TR::RealRegister::AssignAny);
if (_regLen) dependencies->addPostCondition(_regLen, TR::RealRegister::AssignAny);
if (_litReg) dependencies->addPostCondition(_litReg, TR::RealRegister::AssignAny);
if (_litPoolReg) dependencies->addPostCondition(_litPoolReg, TR::RealRegister::AssignAny);
return dependencies;
}
TR::Instruction *
MemToMemVarLenMacroOp::generateRemainder()
{
if (useEXForRemainder())
{
TR::Compilation* comp = _cg->comp();
TR::Instruction* cursor = NULL;
if (!TR::Compiler->target.cpu.getSupportsArch(TR::CPU::z10) || comp->getOption(TR_DisableInlineEXTarget) || !needsLoop())
{
cursor = generateInstruction(0, 1);
}
// re use _itersReg for lit pool register, since we don't need it anymore
// not doing this can cause problems as generateEXDispatch will allocate a new register for lit pool
// we can't do that because MemToMemVarLenMacroOp uses internal control flow
if(_srcReg == NULL) // Make sure base register is added to dependencies
{
_srcReg = _srcMR->getBaseRegister();