-
Notifications
You must be signed in to change notification settings - Fork 392
/
FPCompareAnalyser.cpp
672 lines (617 loc) · 26.8 KB
/
FPCompareAnalyser.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
/*******************************************************************************
* 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 "x/codegen/FPCompareAnalyser.hpp"
#include <stddef.h>
#include <stdint.h>
#include "codegen/CodeGenerator.hpp"
#include "codegen/Instruction.hpp"
#include "codegen/Machine.hpp"
#include "codegen/MemoryReference.hpp"
#include "codegen/Register.hpp"
#include "codegen/RegisterDependency.hpp"
#include "codegen/TreeEvaluator.hpp"
#include "compile/Compilation.hpp"
#include "control/Options.hpp"
#include "control/Options_inlines.hpp"
#include "il/ILOpCodes.hpp"
#include "il/ILOps.hpp"
#include "il/Node.hpp"
#include "il/Node_inlines.hpp"
#include "x/codegen/FPTreeEvaluator.hpp"
#include "codegen/X86Instruction.hpp"
#include "codegen/InstOpCode.hpp"
static bool isUnevaluatedZero(TR::Node *child)
{
if (child->getRegister() == NULL)
{
switch (child->getOpCodeValue())
{
case TR::iconst:
case TR::sconst:
case TR::bconst:
return (child->getInt() == 0);
case TR::lconst:
return (child->getLongInt() == 0);
case TR::fconst:
return (child->getFloatBits() == 0 || child->getFloatBits() == 0x80000000); // hex for ieee float -0.0
case TR::dconst:
return (child->getDoubleBits() == 0 || child->getDoubleBits() == IEEE_DOUBLE_NEGATIVE_0_0);
case TR::i2f:
case TR::s2f:
case TR::b2f:
case TR::l2f:
case TR::d2f:
case TR::i2d:
case TR::s2d:
case TR::b2d:
case TR::l2d:
case TR::f2d:
return isUnevaluatedZero(child->getFirstChild());
default:
return false;
}
}
return false;
}
TR::Register *TR_X86FPCompareAnalyser::fpCompareAnalyser(TR::Node *root,
TR::InstOpCode::Mnemonic cmpRegRegOpCode,
TR::InstOpCode::Mnemonic cmpRegMemOpCode,
TR::InstOpCode::Mnemonic cmpiRegRegOpCode,
bool useFCOMIInstructions)
{
TR::Node *firstChild,
*secondChild;
TR::ILOpCodes cmpOp = root->getOpCodeValue();
bool reverseMemOp = false;
bool reverseCmpOp = false;
TR::Compilation* comp = _cg->comp();
TR::InstOpCode::Mnemonic cmpInstr = useFCOMIInstructions ? cmpiRegRegOpCode : cmpRegRegOpCode;
// Some operators must have their operands swapped to improve the generated
// code needed to evaluate the result of the comparison.
//
bool mustSwapOperands = (cmpOp == TR::iffcmple ||
cmpOp == TR::ifdcmple ||
cmpOp == TR::iffcmpgtu ||
cmpOp == TR::ifdcmpgtu ||
cmpOp == TR::fcmple ||
cmpOp == TR::dcmple ||
cmpOp == TR::fcmpgtu ||
cmpOp == TR::dcmpgtu ||
(useFCOMIInstructions &&
(cmpOp == TR::iffcmplt ||
cmpOp == TR::ifdcmplt ||
cmpOp == TR::iffcmpgeu ||
cmpOp == TR::ifdcmpgeu ||
cmpOp == TR::fcmplt ||
cmpOp == TR::dcmplt ||
cmpOp == TR::fcmpgeu ||
cmpOp == TR::dcmpgeu))) ? true : false;
// Some operators should not have their operands swapped to improve the generated
// code needed to evaluate the result of the comparison.
//
bool preventOperandSwapping = (cmpOp == TR::iffcmpltu ||
cmpOp == TR::ifdcmpltu ||
cmpOp == TR::iffcmpge ||
cmpOp == TR::ifdcmpge ||
cmpOp == TR::fcmpltu ||
cmpOp == TR::dcmpltu ||
cmpOp == TR::fcmpge ||
cmpOp == TR::dcmpge ||
(useFCOMIInstructions &&
(cmpOp == TR::iffcmpgt ||
cmpOp == TR::ifdcmpgt ||
cmpOp == TR::iffcmpleu ||
cmpOp == TR::ifdcmpleu ||
cmpOp == TR::fcmpgt ||
cmpOp == TR::dcmpgt ||
cmpOp == TR::fcmpleu ||
cmpOp == TR::dcmpleu))) ? true : false;
// For correctness, don't swap operands of these operators.
//
if (cmpOp == TR::fcmpg || cmpOp == TR::fcmpl ||
cmpOp == TR::dcmpg || cmpOp == TR::dcmpl)
{
preventOperandSwapping = true;
}
// Initial operand evaluation ordering.
//
if (preventOperandSwapping || (!mustSwapOperands && _cg->whichChildToEvaluate(root) == 0))
{
firstChild = root->getFirstChild();
secondChild = root->getSecondChild();
setReversedOperands(false);
}
else
{
firstChild = root->getSecondChild();
secondChild = root->getFirstChild();
setReversedOperands(true);
}
TR::Register *firstRegister = firstChild->getRegister();
TR::Register *secondRegister = secondChild->getRegister();
setInputs(firstChild,
firstRegister,
secondChild,
secondRegister,
useFCOMIInstructions,
// If either 'preventOperandSwapping' or 'mustSwapOperands' is set then the
// initial operand ordering set above must be maintained.
//
preventOperandSwapping || mustSwapOperands);
// Make sure any required operand ordering is respected.
//
if ((getCmpReg2Reg1() || getCmpReg2Mem1()) &&
(mustSwapOperands || preventOperandSwapping))
{
reverseCmpOp = getCmpReg2Reg1() ? true : false;
reverseMemOp = getCmpReg2Mem1() ? true : false;
}
// If we are not comparing with a memory operand, one of them evaluates
// to a zero, and the zero is not already on the stack, then we can use
// FTST to save a register.
//
// (With a memory operand, either the constant zero needs to be loaded
// to use FCOM, or the memory operand needs to be loaded to use FTST,
// so there is no gain in using FTST.)
//
// If the constant zero is in the target register, using FTST means the
// comparison will be reversed. We cannot do this if the initial ordering
// of the operands must be maintained.
//
// Finally, if FTST is used and this is the last use of the target, the
// target register may need to be explicitly popped.
//
TR::Register *targetRegisterForFTST = NULL;
TR::Node *targetChildForFTST = NULL;
if (getEvalChild1() && isUnevaluatedZero(firstChild)) // do we need getEvalChild1() here?
{
if ( ((getCmpReg1Reg2() || reverseCmpOp) && !(preventOperandSwapping || mustSwapOperands)) ||
(getCmpReg2Reg1() && !reverseCmpOp))
{
if (getEvalChild2())
{
secondRegister = _cg->evaluate(secondChild);
}
targetRegisterForFTST = secondRegister;
targetChildForFTST = secondChild;
notReversedOperands();
}
}
else if (getEvalChild2() && isUnevaluatedZero(secondChild)) // do we need getEvalChild2() here?
{
if ( (getCmpReg1Reg2() || reverseCmpOp) ||
(getCmpReg2Reg1() && !reverseCmpOp && !(preventOperandSwapping || mustSwapOperands)) )
{
if (getEvalChild1())
{
firstRegister = _cg->evaluate(firstChild);
}
targetRegisterForFTST = firstRegister;
targetChildForFTST = firstChild;
}
}
if (!targetRegisterForFTST)
{
// If we have a choice, evaluate the target operand last. By doing so, we
// help out the register assigner because the target must be TOS. This
// avoids an unneccessary FXCH for the target.
//
if (getEvalChild1() && getEvalChild2())
{
if (getCmpReg1Reg2() || getCmpReg1Mem2())
{
secondRegister = _cg->evaluate(secondChild);
firstRegister = _cg->evaluate(firstChild);
}
else
{
firstRegister = _cg->evaluate(firstChild);
secondRegister = _cg->evaluate(secondChild);
}
}
else
{
if (getEvalChild1())
{
firstRegister = _cg->evaluate(firstChild);
}
if (getEvalChild2())
{
secondRegister = _cg->evaluate(secondChild);
}
}
}
// Generate the compare instruction.
//
if (targetRegisterForFTST)
{
generateFPRegInstruction(TR::InstOpCode::FTSTReg, root, targetRegisterForFTST, _cg);
}
else if (!useFCOMIInstructions && (getCmpReg1Mem2() || reverseMemOp))
{
TR::MemoryReference *tempMR = generateX86MemoryReference(secondChild, _cg);
generateFPRegMemInstruction(cmpRegMemOpCode, root, firstRegister, tempMR, _cg);
tempMR->decNodeReferenceCounts(_cg);
}
else if (!useFCOMIInstructions && getCmpReg2Mem1())
{
TR::MemoryReference *tempMR = generateX86MemoryReference(firstChild, _cg);
generateFPRegMemInstruction(cmpRegMemOpCode, root, secondRegister, tempMR, _cg);
notReversedOperands();
tempMR->decNodeReferenceCounts(_cg);
}
else if (getCmpReg1Reg2() || reverseCmpOp)
{
generateFPCompareRegRegInstruction(cmpInstr, root, firstRegister, secondRegister, _cg);
}
else if (getCmpReg2Reg1())
{
generateFPCompareRegRegInstruction(cmpInstr, root, secondRegister, firstRegister, _cg);
notReversedOperands();
}
_cg->decReferenceCount(firstChild);
_cg->decReferenceCount(secondChild);
// Evaluate the comparison.
//
if (getReversedOperands())
{
cmpOp = TR::ILOpCode(cmpOp).getOpCodeForSwapChildren();
TR::Node::recreate(root, cmpOp);
}
if (useFCOMIInstructions && !targetRegisterForFTST)
{
return NULL;
}
// We must manually move the FP condition flags to the EFLAGS register if we don't
// use the FCOMI instructions.
//
TR::Register *accRegister = _cg->allocateRegister();
TR::RegisterDependencyConditions *dependencies = generateRegisterDependencyConditions((uint8_t)1, 1, _cg);
dependencies->addPreCondition(accRegister, TR::RealRegister::eax, _cg);
dependencies->addPostCondition(accRegister, TR::RealRegister::eax, _cg);
generateRegInstruction(TR::InstOpCode::STSWAcc, root, accRegister, dependencies, _cg);
// Pop the FTST target register if it is not used any more.
//
if (targetRegisterForFTST &&
targetChildForFTST && targetChildForFTST->getReferenceCount() == 0)
{
generateFPSTiST0RegRegInstruction(TR::InstOpCode::FSTRegReg, root, targetRegisterForFTST, targetRegisterForFTST, _cg);
}
return accRegister;
}
void TR_X86FPCompareAnalyser::setInputs(TR::Node *firstChild,
TR::Register *firstRegister,
TR::Node *secondChild,
TR::Register *secondRegister,
bool disallowMemoryFormInstructions,
bool disallowOperandSwapping)
{
if (firstRegister)
{
setReg1();
}
if (secondRegister)
{
setReg2();
}
if (!disallowMemoryFormInstructions &&
firstChild->getOpCode().isMemoryReference() &&
firstChild->getReferenceCount() == 1)
{
setMem1();
}
if (!disallowMemoryFormInstructions &&
secondChild->getOpCode().isMemoryReference() &&
secondChild->getReferenceCount() == 1)
{
setMem2();
}
if (firstChild->getReferenceCount() == 1)
{
setClob1();
}
if (secondChild->getReferenceCount() == 1)
{
setClob2();
}
if (disallowOperandSwapping)
{
setNoOperandSwapping();
}
}
const uint8_t TR_X86FPCompareAnalyser::_actionMap[NUM_FPCOMPARE_ACTION_SETS] =
{
// This table occupies NUM_FPCOMPARE_ACTION_SETS bytes of storage.
// NS = No swapping of operands allowed
// R1 = Child1 in register R2 = Child2 in register
// M1 = Child1 in memory M2 = Child2 in memory
// C1 = Child1 is clobberable C2 = Child2 is clobberable
// Operand swapping allowed.
//
// NS R1 M1 C1 R2 M2 C2
/* 0 0 0 0 0 0 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 0 0 0 0 0 0 1 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg2Reg1,
/* 0 0 0 0 0 1 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 0 0 0 0 0 1 1 */ fpEvalChild1 | fpCmpReg1Mem2,
/* 0 0 0 0 1 0 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 0 0 0 0 1 0 1 */ fpEvalChild1 | fpCmpReg2Reg1,
/* 0 0 0 0 1 1 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 0 0 0 0 1 1 1 */ fpEvalChild1 | fpCmpReg2Reg1,
/* 0 0 0 1 0 0 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 0 0 0 1 0 0 1 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 0 0 0 1 0 1 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 0 0 0 1 0 1 1 */ fpEvalChild1 | fpCmpReg1Mem2,
/* 0 0 0 1 1 0 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 0 0 0 1 1 0 1 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 0 0 0 1 1 1 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 0 0 0 1 1 1 1 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 0 0 1 0 0 0 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 0 0 1 0 0 0 1 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg2Reg1,
/* 0 0 1 0 0 1 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 0 0 1 0 0 1 1 */ fpEvalChild1 | fpCmpReg1Mem2,
/* 0 0 1 0 1 0 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 0 0 1 0 1 0 1 */ fpEvalChild1 | fpCmpReg2Reg1,
/* 0 0 1 0 1 1 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 0 0 1 0 1 1 1 */ fpEvalChild1 | fpCmpReg2Reg1,
/* 0 0 1 1 0 0 0 */ fpEvalChild2 | fpCmpReg2Mem1,
/* 0 0 1 1 0 0 1 */ fpEvalChild2 | fpCmpReg2Mem1,
/* 0 0 1 1 0 1 0 */ fpEvalChild2 | fpCmpReg2Mem1,
/* 0 0 1 1 0 1 1 */ fpEvalChild1 | fpCmpReg1Mem2,
/* 0 0 1 1 1 0 0 */ fpCmpReg2Mem1,
/* 0 0 1 1 1 0 1 */ fpCmpReg2Mem1,
/* 0 0 1 1 1 1 0 */ fpCmpReg2Mem1,
/* 0 0 1 1 1 1 1 */ fpCmpReg2Mem1,
/* 0 1 0 0 0 0 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 0 1 0 0 0 0 1 */ fpEvalChild2 | fpCmpReg2Reg1,
/* 0 1 0 0 0 1 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 0 1 0 0 0 1 1 */ fpCmpReg1Mem2,
/* 0 1 0 0 1 0 0 */ fpCmpReg1Reg2,
/* 0 1 0 0 1 0 1 */ fpCmpReg2Reg1,
/* 0 1 0 0 1 1 0 */ fpCmpReg1Reg2,
/* 0 1 0 0 1 1 1 */ fpCmpReg2Reg1,
/* 0 1 0 1 0 0 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 0 1 0 1 0 0 1 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 0 1 0 1 0 1 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 0 1 0 1 0 1 1 */ fpCmpReg1Mem2,
/* 0 1 0 1 1 0 0 */ fpCmpReg1Reg2,
/* 0 1 0 1 1 0 1 */ fpCmpReg1Reg2,
/* 0 1 0 1 1 1 0 */ fpCmpReg1Reg2,
/* 0 1 0 1 1 1 1 */ fpCmpReg1Reg2,
/* 0 1 1 0 0 0 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 0 1 1 0 0 0 1 */ fpEvalChild2 | fpCmpReg2Reg1,
/* 0 1 1 0 0 1 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 0 1 1 0 0 1 1 */ fpCmpReg1Mem2,
/* 0 1 1 0 1 0 0 */ fpCmpReg1Reg2,
/* 0 1 1 0 1 0 1 */ fpCmpReg2Reg1,
/* 0 1 1 0 1 1 0 */ fpCmpReg1Reg2,
/* 0 1 1 0 1 1 1 */ fpCmpReg2Reg1,
/* 0 1 1 1 0 0 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 0 1 1 1 0 0 1 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 0 1 1 1 0 1 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 0 1 1 1 0 1 1 */ fpCmpReg1Mem2,
/* 0 1 1 1 1 0 0 */ fpCmpReg1Reg2,
/* 0 1 1 1 1 0 1 */ fpCmpReg1Reg2,
/* 0 1 1 1 1 1 0 */ fpCmpReg1Reg2,
/* 0 1 1 1 1 1 1 */ fpCmpReg1Reg2,
// Operand swapping disallowed.
//
// NS R1 M1 C1 R2 M2 C2
/* 1 0 0 0 0 0 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 1 0 0 0 0 0 1 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 1 0 0 0 0 1 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 1 0 0 0 0 1 1 */ fpEvalChild1 | fpCmpReg1Mem2,
/* 1 0 0 0 1 0 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 0 0 1 0 1 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 0 0 1 1 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 0 0 1 1 1 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 0 1 0 0 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 1 0 0 1 0 0 1 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 1 0 0 1 0 1 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 1 0 0 1 0 1 1 */ fpEvalChild1 | fpCmpReg1Mem2,
/* 1 0 0 1 1 0 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 0 1 1 0 1 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 0 1 1 1 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 0 1 1 1 1 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 1 0 0 0 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 1 0 1 0 0 0 1 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 1 0 1 0 0 1 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 1 0 1 0 0 1 1 */ fpEvalChild1 | fpCmpReg1Mem2,
/* 1 0 1 0 1 0 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 1 0 1 0 1 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 1 0 1 1 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 1 0 1 1 1 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 1 1 0 0 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 1 0 1 1 0 0 1 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 1 0 1 1 0 1 0 */ fpEvalChild1 | fpEvalChild2 | fpCmpReg1Reg2,
/* 1 0 1 1 0 1 1 */ fpEvalChild1 | fpCmpReg1Mem2,
/* 1 0 1 1 1 0 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 1 1 1 0 1 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 1 1 1 1 0 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 0 1 1 1 1 1 */ fpEvalChild1 | fpCmpReg1Reg2,
/* 1 1 0 0 0 0 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 1 1 0 0 0 0 1 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 1 1 0 0 0 1 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 1 1 0 0 0 1 1 */ fpCmpReg1Mem2,
/* 1 1 0 0 1 0 0 */ fpCmpReg1Reg2,
/* 1 1 0 0 1 0 1 */ fpCmpReg1Reg2,
/* 1 1 0 0 1 1 0 */ fpCmpReg1Reg2,
/* 1 1 0 0 1 1 1 */ fpCmpReg1Reg2,
/* 1 1 0 1 0 0 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 1 1 0 1 0 0 1 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 1 1 0 1 0 1 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 1 1 0 1 0 1 1 */ fpCmpReg1Mem2,
/* 1 1 0 1 1 0 0 */ fpCmpReg1Reg2,
/* 1 1 0 1 1 0 1 */ fpCmpReg1Reg2,
/* 1 1 0 1 1 1 0 */ fpCmpReg1Reg2,
/* 1 1 0 1 1 1 1 */ fpCmpReg1Reg2,
/* 1 1 1 0 0 0 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 1 1 1 0 0 0 1 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 1 1 1 0 0 1 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 1 1 1 0 0 1 1 */ fpCmpReg1Mem2,
/* 1 1 1 0 1 0 0 */ fpCmpReg1Reg2,
/* 1 1 1 0 1 0 1 */ fpCmpReg1Reg2,
/* 1 1 1 0 1 1 0 */ fpCmpReg1Reg2,
/* 1 1 1 0 1 1 1 */ fpCmpReg1Reg2,
/* 1 1 1 1 0 0 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 1 1 1 1 0 0 1 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 1 1 1 1 0 1 0 */ fpEvalChild2 | fpCmpReg1Reg2,
/* 1 1 1 1 0 1 1 */ fpCmpReg1Mem2,
/* 1 1 1 1 1 0 0 */ fpCmpReg1Reg2,
/* 1 1 1 1 1 0 1 */ fpCmpReg1Reg2,
/* 1 1 1 1 1 1 0 */ fpCmpReg1Reg2,
/* 1 1 1 1 1 1 1 */ fpCmpReg1Reg2
};
TR::Register *TR_IA32XMMCompareAnalyser::xmmCompareAnalyser(TR::Node *root,
TR::InstOpCode::Mnemonic cmpRegRegOpCode,
TR::InstOpCode::Mnemonic cmpRegMemOpCode)
{
TR::Node *firstChild,
*secondChild;
TR::ILOpCodes cmpOp = root->getOpCodeValue();
bool reverseMemOp = false;
bool reverseCmpOp = false;
// Some operators must have their operands swapped to improve the generated
// code needed to evaluate the result of the comparison.
//
bool mustSwapOperands = (cmpOp == TR::iffcmple ||
cmpOp == TR::ifdcmple ||
cmpOp == TR::iffcmpgtu ||
cmpOp == TR::ifdcmpgtu ||
cmpOp == TR::fcmple ||
cmpOp == TR::dcmple ||
cmpOp == TR::fcmpgtu ||
cmpOp == TR::dcmpgtu ||
cmpOp == TR::iffcmplt ||
cmpOp == TR::ifdcmplt ||
cmpOp == TR::iffcmpgeu ||
cmpOp == TR::ifdcmpgeu ||
cmpOp == TR::fcmplt ||
cmpOp == TR::dcmplt ||
cmpOp == TR::fcmpgeu ||
cmpOp == TR::dcmpgeu) ? true : false;
// Some operators should not have their operands swapped to improve the generated
// code needed to evaluate the result of the comparison.
//
bool preventOperandSwapping = (cmpOp == TR::iffcmpltu ||
cmpOp == TR::ifdcmpltu ||
cmpOp == TR::iffcmpge ||
cmpOp == TR::ifdcmpge ||
cmpOp == TR::fcmpltu ||
cmpOp == TR::dcmpltu ||
cmpOp == TR::fcmpge ||
cmpOp == TR::dcmpge ||
cmpOp == TR::iffcmpgt ||
cmpOp == TR::ifdcmpgt ||
cmpOp == TR::iffcmpleu ||
cmpOp == TR::ifdcmpleu ||
cmpOp == TR::fcmpgt ||
cmpOp == TR::dcmpgt ||
cmpOp == TR::fcmpleu ||
cmpOp == TR::dcmpleu) ? true : false;
// For correctness, don't swap operands of these operators.
//
if (cmpOp == TR::fcmpg || cmpOp == TR::fcmpl ||
cmpOp == TR::dcmpg || cmpOp == TR::dcmpl)
{
preventOperandSwapping = true;
}
// Initial operand evaluation ordering.
//
if (preventOperandSwapping || (!mustSwapOperands && _cg->whichChildToEvaluate(root) == 0))
{
firstChild = root->getFirstChild();
secondChild = root->getSecondChild();
setReversedOperands(false);
}
else
{
firstChild = root->getSecondChild();
secondChild = root->getFirstChild();
setReversedOperands(true);
}
TR::Register *firstRegister = firstChild->getRegister();
TR::Register *secondRegister = secondChild->getRegister();
setInputs(firstChild,
firstRegister,
secondChild,
secondRegister,
false,
// If either 'preventOperandSwapping' or 'mustSwapOperands' is set then the
// initial operand ordering set above must be maintained.
//
preventOperandSwapping || mustSwapOperands);
// Make sure any required operand ordering is respected.
//
if ((getCmpReg2Reg1() || getCmpReg2Mem1()) &&
(mustSwapOperands || preventOperandSwapping))
{
reverseCmpOp = getCmpReg2Reg1() ? true : false;
reverseMemOp = getCmpReg2Mem1() ? true : false;
}
// Evaluate the children if necessary.
//
if (getEvalChild1())
{
_cg->evaluate(firstChild);
}
if (getEvalChild2())
{
_cg->evaluate(secondChild);
}
TR::TreeEvaluator::coerceFPOperandsToXMMRs(root, _cg);
firstRegister = firstChild->getRegister();
secondRegister = secondChild->getRegister();
// Generate the compare instruction.
//
if (getCmpReg1Mem2() || reverseMemOp)
{
TR::MemoryReference *tempMR = generateX86MemoryReference(secondChild, _cg);
generateRegMemInstruction(cmpRegMemOpCode, root, firstRegister, tempMR, _cg);
tempMR->decNodeReferenceCounts(_cg);
}
else if (getCmpReg2Mem1())
{
TR::MemoryReference *tempMR = generateX86MemoryReference(firstChild, _cg);
generateRegMemInstruction(cmpRegMemOpCode, root, secondRegister, tempMR, _cg);
notReversedOperands();
tempMR->decNodeReferenceCounts(_cg);
}
else if (getCmpReg1Reg2() || reverseCmpOp)
{
generateRegRegInstruction(cmpRegRegOpCode, root, firstRegister, secondRegister, _cg);
}
else if (getCmpReg2Reg1())
{
generateRegRegInstruction(cmpRegRegOpCode, root, secondRegister, firstRegister, _cg);
notReversedOperands();
}
_cg->decReferenceCount(firstChild);
_cg->decReferenceCount(secondChild);
// Update the opcode on the root node if we have swapped its children.
// TODO: Reverse the children too, or else this looks wrong in the log file
//
if (getReversedOperands())
{
cmpOp = TR::ILOpCode(cmpOp).getOpCodeForSwapChildren();
TR::Node::recreate(root, cmpOp);
}
return NULL;
}