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
|
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
/*XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX XX
XX Register Requirements for ARM XX
XX XX
XX This encapsulates all the logic for setting register requirements for XX
XX the ARM architecture. XX
XX XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
#include "jitpch.h"
#ifdef _MSC_VER
#pragma hdrstop
#endif
#ifndef LEGACY_BACKEND // This file is ONLY used for the RyuJIT backend that uses the linear scan register allocator
#ifdef _TARGET_ARM_
#include "jit.h"
#include "sideeffects.h"
#include "lower.h"
#include "lsra.h"
//------------------------------------------------------------------------
// TreeNodeInfoInitReturn: Set the NodeInfo for a GT_RETURN.
//
// Arguments:
// tree - The node of interest
//
// Return Value:
// None.
//
void LinearScan::TreeNodeInfoInitReturn(GenTree* tree)
{
TreeNodeInfo* info = &(tree->gtLsraInfo);
GenTree* op1 = tree->gtGetOp1();
assert(info->dstCount == 0);
if (tree->TypeGet() == TYP_LONG)
{
assert((op1->OperGet() == GT_LONG) && op1->isContained());
GenTree* loVal = op1->gtGetOp1();
GenTree* hiVal = op1->gtGetOp2();
info->srcCount = 2;
loVal->gtLsraInfo.setSrcCandidates(this, RBM_LNGRET_LO);
hiVal->gtLsraInfo.setSrcCandidates(this, RBM_LNGRET_HI);
}
else
{
regMaskTP useCandidates = RBM_NONE;
info->srcCount = ((tree->TypeGet() == TYP_VOID) || op1->isContained()) ? 0 : 1;
if (varTypeIsStruct(tree))
{
// op1 has to be either an lclvar or a multi-reg returning call
if (op1->OperGet() != GT_LCL_VAR)
{
noway_assert(op1->IsMultiRegCall());
ReturnTypeDesc* retTypeDesc = op1->AsCall()->GetReturnTypeDesc();
info->srcCount = retTypeDesc->GetReturnRegCount();
useCandidates = retTypeDesc->GetABIReturnRegs();
}
}
else
{
// Non-struct type return - determine useCandidates
switch (tree->TypeGet())
{
case TYP_VOID:
useCandidates = RBM_NONE;
break;
case TYP_FLOAT:
useCandidates = RBM_FLOATRET;
break;
case TYP_DOUBLE:
useCandidates = RBM_DOUBLERET;
break;
case TYP_LONG:
useCandidates = RBM_LNGRET;
break;
default:
useCandidates = RBM_INTRET;
break;
}
}
if (useCandidates != RBM_NONE)
{
tree->gtOp.gtOp1->gtLsraInfo.setSrcCandidates(this, useCandidates);
}
}
}
void LinearScan::TreeNodeInfoInitLclHeap(GenTree* tree)
{
TreeNodeInfo* info = &(tree->gtLsraInfo);
assert(info->dstCount == 1);
// Need a variable number of temp regs (see genLclHeap() in codegenarm.cpp):
// Here '-' means don't care.
//
// Size? Init Memory? # temp regs
// 0 - 0
// const and <=4 str instr - hasPspSym ? 1 : 0
// const and <PageSize No hasPspSym ? 1 : 0
// >4 ptr words Yes hasPspSym ? 2 : 1
// Non-const Yes hasPspSym ? 2 : 1
// Non-const No hasPspSym ? 2 : 1
bool hasPspSym;
#if FEATURE_EH_FUNCLETS
hasPspSym = (compiler->lvaPSPSym != BAD_VAR_NUM);
#else
hasPspSym = false;
#endif
GenTreePtr size = tree->gtOp.gtOp1;
if (size->IsCnsIntOrI())
{
assert(size->isContained());
info->srcCount = 0;
size_t sizeVal = size->gtIntCon.gtIconVal;
if (sizeVal == 0)
{
info->internalIntCount = 0;
}
else
{
sizeVal = AlignUp(sizeVal, STACK_ALIGN);
size_t cntStackAlignedWidthItems = (sizeVal >> STACK_ALIGN_SHIFT);
// For small allocations up to 4 store instructions
if (cntStackAlignedWidthItems <= 4)
{
info->internalIntCount = 0;
}
else if (!compiler->info.compInitMem)
{
// No need to initialize allocated stack space.
if (sizeVal < compiler->eeGetPageSize())
{
info->internalIntCount = 0;
}
else
{
info->internalIntCount = 1;
}
}
else
{
info->internalIntCount = 1;
}
if (hasPspSym)
{
info->internalIntCount++;
}
}
}
else
{
// target (regCnt) + tmp + [psp]
info->srcCount = 1;
info->internalIntCount = hasPspSym ? 2 : 1;
}
// If we are needed in temporary registers we should be sure that
// it's different from target (regCnt)
if (info->internalIntCount > 0)
{
info->isInternalRegDelayFree = true;
}
}
//------------------------------------------------------------------------
// TreeNodeInfoInit: Set the register requirements for RA.
//
// Notes:
// Takes care of annotating the register requirements
// for every TreeNodeInfo struct that maps to each tree node.
//
// Preconditions:
// LSRA has been initialized and there is a TreeNodeInfo node
// already allocated and initialized for every tree in the IR.
//
// Postconditions:
// Every TreeNodeInfo instance has the right annotations on register
// requirements needed by LSRA to build the Interval Table (source,
// destination and internal [temp] register counts).
//
void LinearScan::TreeNodeInfoInit(GenTree* tree)
{
unsigned kind = tree->OperKind();
TreeNodeInfo* info = &(tree->gtLsraInfo);
RegisterType registerType = TypeGet(tree);
if (tree->isContained())
{
info->dstCount = 0;
assert(info->srcCount == 0);
return;
}
// Set the default dstCount. This may be modified below.
info->dstCount = tree->IsValue() ? 1 : 0;
switch (tree->OperGet())
{
GenTree* op1;
GenTree* op2;
case GT_STORE_LCL_FLD:
case GT_STORE_LCL_VAR:
TreeNodeInfoInitStoreLoc(tree->AsLclVarCommon());
break;
case GT_NOP:
// A GT_NOP is either a passthrough (if it is void, or if it has
// a child), but must be considered to produce a dummy value if it
// has a type but no child
info->srcCount = 0;
if (tree->TypeGet() != TYP_VOID && tree->gtOp.gtOp1 == nullptr)
{
assert(info->dstCount == 1);
}
else
{
assert(info->dstCount == 0);
}
break;
case GT_INTRINSIC:
{
// TODO-ARM: Implement other type of intrinsics (round, sqrt and etc.)
// Both operand and its result must be of the same floating point type.
op1 = tree->gtOp.gtOp1;
assert(varTypeIsFloating(op1));
assert(op1->TypeGet() == tree->TypeGet());
switch (tree->gtIntrinsic.gtIntrinsicId)
{
case CORINFO_INTRINSIC_Abs:
case CORINFO_INTRINSIC_Sqrt:
info->srcCount = 1;
assert(info->dstCount == 1);
break;
default:
NYI_ARM("LinearScan::TreeNodeInfoInit for GT_INTRINSIC");
break;
}
}
break;
case GT_CAST:
{
info->srcCount = 1;
assert(info->dstCount == 1);
// Non-overflow casts to/from float/double are done using SSE2 instructions
// and that allow the source operand to be either a reg or memop. Given the
// fact that casts from small int to float/double are done as two-level casts,
// the source operand is always guaranteed to be of size 4 or 8 bytes.
var_types castToType = tree->CastToType();
GenTreePtr castOp = tree->gtCast.CastOp();
var_types castOpType = castOp->TypeGet();
if (tree->gtFlags & GTF_UNSIGNED)
{
castOpType = genUnsignedType(castOpType);
}
#ifdef DEBUG
if (!tree->gtOverflow() && (varTypeIsFloating(castToType) || varTypeIsFloating(castOpType)))
{
// If converting to float/double, the operand must be 4 or 8 byte in size.
if (varTypeIsFloating(castToType))
{
unsigned opSize = genTypeSize(castOpType);
assert(opSize == 4 || opSize == 8);
}
}
#endif // DEBUG
if (varTypeIsLong(castOpType))
{
assert((castOp->OperGet() == GT_LONG) && castOp->isContained());
info->srcCount = 2;
}
// FloatToIntCast needs a temporary register
if (varTypeIsFloating(castOpType) && varTypeIsIntOrI(tree))
{
info->setInternalCandidates(this, RBM_ALLFLOAT);
info->internalFloatCount = 1;
info->isInternalRegDelayFree = true;
}
Lowering::CastInfo castInfo;
// Get information about the cast.
Lowering::getCastDescription(tree, &castInfo);
if (castInfo.requiresOverflowCheck)
{
var_types srcType = castOp->TypeGet();
emitAttr cmpSize = EA_ATTR(genTypeSize(srcType));
// If we cannot store data in an immediate for instructions,
// then we will need to reserve a temporary register.
if (!castInfo.signCheckOnly) // In case of only sign check, temp regs are not needeed.
{
if (castInfo.unsignedSource || castInfo.unsignedDest)
{
// check typeMask
bool canStoreTypeMask = emitter::emitIns_valid_imm_for_alu(castInfo.typeMask);
if (!canStoreTypeMask)
{
info->internalIntCount = 1;
}
}
else
{
// For comparing against the max or min value
bool canStoreMaxValue =
emitter::emitIns_valid_imm_for_cmp(castInfo.typeMax, INS_FLAGS_DONT_CARE);
bool canStoreMinValue =
emitter::emitIns_valid_imm_for_cmp(castInfo.typeMin, INS_FLAGS_DONT_CARE);
if (!canStoreMaxValue || !canStoreMinValue)
{
info->internalIntCount = 1;
}
}
}
}
}
break;
case GT_JTRUE:
info->srcCount = 0;
assert(info->dstCount == 0);
break;
case GT_JMP:
info->srcCount = 0;
assert(info->dstCount == 0);
break;
case GT_SWITCH:
// This should never occur since switch nodes must not be visible at this
// point in the JIT.
info->srcCount = 0;
noway_assert(!"Switch must be lowered at this point");
break;
case GT_JMPTABLE:
info->srcCount = 0;
assert(info->dstCount == 1);
break;
case GT_SWITCH_TABLE:
info->srcCount = 2;
assert(info->dstCount == 0);
break;
case GT_ASG:
case GT_ASG_ADD:
case GT_ASG_SUB:
noway_assert(!"We should never hit any assignment operator in lowering");
info->srcCount = 0;
break;
case GT_ADD_LO:
case GT_ADD_HI:
case GT_SUB_LO:
case GT_SUB_HI:
case GT_ADD:
case GT_SUB:
if (varTypeIsFloating(tree->TypeGet()))
{
// overflow operations aren't supported on float/double types.
assert(!tree->gtOverflow());
// No implicit conversions at this stage as the expectation is that
// everything is made explicit by adding casts.
assert(tree->gtOp.gtOp1->TypeGet() == tree->gtOp.gtOp2->TypeGet());
info->srcCount = 2;
assert(info->dstCount == 1);
break;
}
__fallthrough;
case GT_AND:
case GT_OR:
case GT_XOR:
info->srcCount = tree->gtOp.gtOp2->isContained() ? 1 : 2;
assert(info->dstCount == 1);
break;
case GT_RETURNTRAP:
// this just turns into a compare of its child with an int
// + a conditional call
info->srcCount = 1;
assert(info->dstCount == 0);
break;
case GT_MUL:
if (tree->gtOverflow())
{
// Need a register different from target reg to check for overflow.
info->internalIntCount = 1;
info->isInternalRegDelayFree = true;
}
__fallthrough;
case GT_DIV:
case GT_MULHI:
case GT_UDIV:
{
info->srcCount = 2;
assert(info->dstCount == 1);
}
break;
case GT_MUL_LONG:
info->srcCount = 2;
info->dstCount = 2;
break;
case GT_LIST:
case GT_FIELD_LIST:
case GT_ARGPLACE:
case GT_NO_OP:
case GT_START_NONGC:
case GT_PROF_HOOK:
info->srcCount = 0;
assert(info->dstCount == 0);
break;
case GT_LONG:
if (tree->IsUnusedValue())
{
// An unused GT_LONG node needs to consume its sources.
info->srcCount = 2;
info->dstCount = 0;
}
else
{
// Passthrough. Should have been marked contained.
info->srcCount = 0;
assert(info->dstCount == 0);
}
break;
case GT_CNS_DBL:
info->srcCount = 0;
assert(info->dstCount == 1);
if (tree->TypeGet() == TYP_FLOAT)
{
// An int register for float constant
info->internalIntCount = 1;
}
else
{
// TYP_DOUBLE
assert(tree->TypeGet() == TYP_DOUBLE);
// Two int registers for double constant
info->internalIntCount = 2;
}
break;
case GT_RETURN:
TreeNodeInfoInitReturn(tree);
break;
case GT_RETFILT:
assert(info->dstCount == 0);
if (tree->TypeGet() == TYP_VOID)
{
info->srcCount = 0;
}
else
{
assert(tree->TypeGet() == TYP_INT);
info->srcCount = 1;
info->setSrcCandidates(this, RBM_INTRET);
tree->gtOp.gtOp1->gtLsraInfo.setSrcCandidates(this, RBM_INTRET);
}
break;
case GT_ARR_BOUNDS_CHECK:
#ifdef FEATURE_SIMD
case GT_SIMD_CHK:
#endif // FEATURE_SIMD
{
// Consumes arrLen & index - has no result
info->srcCount = 2;
assert(info->dstCount == 0);
}
break;
case GT_ARR_ELEM:
// These must have been lowered to GT_ARR_INDEX
noway_assert(!"We should never see a GT_ARR_ELEM in lowering");
info->srcCount = 0;
assert(info->dstCount == 0);
break;
case GT_ARR_INDEX:
info->srcCount = 2;
assert(info->dstCount == 1);
info->internalIntCount = 1;
info->isInternalRegDelayFree = true;
// For GT_ARR_INDEX, the lifetime of the arrObj must be extended because it is actually used multiple
// times while the result is being computed.
tree->AsArrIndex()->ArrObj()->gtLsraInfo.isDelayFree = true;
info->hasDelayFreeSrc = true;
break;
case GT_ARR_OFFSET:
// This consumes the offset, if any, the arrObj and the effective index,
// and produces the flattened offset for this dimension.
assert(info->dstCount == 1);
if (tree->gtArrOffs.gtOffset->isContained())
{
info->srcCount = 2;
}
else
{
// Here we simply need an internal register, which must be different
// from any of the operand's registers, but may be the same as targetReg.
info->internalIntCount = 1;
info->srcCount = 3;
}
break;
case GT_LEA:
{
GenTreeAddrMode* lea = tree->AsAddrMode();
int offset = lea->Offset();
// This LEA is instantiating an address, so we set up the srcCount and dstCount here.
info->srcCount = 0;
if (lea->HasBase())
{
info->srcCount++;
}
if (lea->HasIndex())
{
info->srcCount++;
}
assert(info->dstCount == 1);
// An internal register may be needed too; the logic here should be in sync with the
// genLeaInstruction()'s requirements for a such register.
if (lea->HasBase() && lea->HasIndex())
{
if (offset != 0)
{
// We need a register when we have all three: base reg, index reg and a non-zero offset.
info->internalIntCount = 1;
}
}
else if (lea->HasBase())
{
if (!emitter::emitIns_valid_imm_for_add(offset, INS_FLAGS_DONT_CARE))
{
// We need a register when we have an offset that is too large to encode in the add instruction.
info->internalIntCount = 1;
}
}
}
break;
case GT_NEG:
info->srcCount = 1;
assert(info->dstCount == 1);
break;
case GT_NOT:
info->srcCount = 1;
assert(info->dstCount == 1);
break;
case GT_LSH:
case GT_RSH:
case GT_RSZ:
case GT_ROR:
case GT_LSH_HI:
case GT_RSH_LO:
TreeNodeInfoInitShiftRotate(tree);
break;
case GT_EQ:
case GT_NE:
case GT_LT:
case GT_LE:
case GT_GE:
case GT_GT:
case GT_CMP:
TreeNodeInfoInitCmp(tree);
break;
case GT_CKFINITE:
info->srcCount = 1;
assert(info->dstCount == 1);
info->internalIntCount = 1;
break;
case GT_CALL:
TreeNodeInfoInitCall(tree->AsCall());
break;
case GT_STORE_BLK:
case GT_STORE_OBJ:
case GT_STORE_DYN_BLK:
TreeNodeInfoInitBlockStore(tree->AsBlk());
break;
case GT_INIT_VAL:
// Always a passthrough of its child's value.
assert(!"INIT_VAL should always be contained");
break;
case GT_LCLHEAP:
TreeNodeInfoInitLclHeap(tree);
break;
case GT_STOREIND:
{
assert(info->dstCount == 0);
GenTree* src = tree->gtOp.gtOp2;
if (compiler->codeGen->gcInfo.gcIsWriteBarrierAsgNode(tree))
{
TreeNodeInfoInitGCWriteBarrier(tree);
break;
}
TreeNodeInfoInitIndir(tree->AsIndir());
// No contained source on ARM.
assert(!src->isContained());
info->srcCount++;
}
break;
case GT_NULLCHECK:
// Although NULLCHECK is defined as GTK_NOVALUE, it requires a target
// register on ARM, as it is implemented as a load.
info->dstCount = 1;
info->srcCount = 1;
info->isLocalDefUse = true;
// null check is an indirection on an addr
TreeNodeInfoInitIndir(tree->AsIndir());
break;
case GT_IND:
assert(info->dstCount == 1);
info->srcCount = 1;
TreeNodeInfoInitIndir(tree->AsIndir());
break;
case GT_CATCH_ARG:
info->srcCount = 0;
assert(info->dstCount == 1);
info->setDstCandidates(this, RBM_EXCEPTION_OBJECT);
break;
case GT_CLS_VAR:
info->srcCount = 0;
// GT_CLS_VAR, by the time we reach the backend, must always
// be a pure use.
// It will produce a result of the type of the
// node, and use an internal register for the address.
assert(info->dstCount == 1);
assert((tree->gtFlags & (GTF_VAR_DEF | GTF_VAR_USEASG)) == 0);
info->internalIntCount = 1;
break;
case GT_COPY:
info->srcCount = 1;
#ifdef ARM_SOFTFP
// This case currently only occurs for double types that are passed as TYP_LONG;
// actual long types would have been decomposed by now.
if (tree->TypeGet() == TYP_LONG)
{
info->dstCount = 2;
}
else
#endif
{
assert(info->dstCount == 1);
}
break;
case GT_PUTARG_SPLIT:
TreeNodeInfoInitPutArgSplit(tree->AsPutArgSplit());
break;
case GT_PUTARG_STK:
TreeNodeInfoInitPutArgStk(tree->AsPutArgStk());
break;
case GT_PUTARG_REG:
TreeNodeInfoInitPutArgReg(tree->AsUnOp());
break;
default:
#ifdef DEBUG
char message[256];
_snprintf_s(message, _countof(message), _TRUNCATE, "NYI: Unimplemented node type %s",
GenTree::OpName(tree->OperGet()));
NYIRAW(message);
#else
NYI_ARM("TreeNodeInfoInit default case");
#endif
case GT_LCL_FLD:
case GT_LCL_FLD_ADDR:
case GT_LCL_VAR:
case GT_LCL_VAR_ADDR:
case GT_PHYSREG:
case GT_CLS_VAR_ADDR:
case GT_IL_OFFSET:
case GT_CNS_INT:
case GT_LABEL:
case GT_PINVOKE_PROLOG:
case GT_JCC:
case GT_SETCC:
case GT_MEMORYBARRIER:
case GT_OBJ:
assert(info->dstCount == (tree->IsValue() ? 1 : 0));
if (kind & (GTK_CONST | GTK_LEAF))
{
info->srcCount = 0;
}
else if (kind & (GTK_SMPOP))
{
if (tree->gtGetOp2IfPresent() != nullptr)
{
info->srcCount = 2;
}
else
{
info->srcCount = 1;
}
}
else
{
unreached();
}
break;
case GT_INDEX_ADDR:
info->srcCount = 2;
info->dstCount = 1;
info->internalIntCount = 1;
break;
} // end switch (tree->OperGet())
// We need to be sure that we've set info->srcCount and info->dstCount appropriately
assert((info->dstCount < 2) || tree->IsMultiRegNode());
}
#endif // _TARGET_ARM_
#endif // !LEGACY_BACKEND
|