-
Notifications
You must be signed in to change notification settings - Fork 392
/
CompareAnalyser.hpp
100 lines (80 loc) · 4.02 KB
/
CompareAnalyser.hpp
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
/*******************************************************************************
* 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
*******************************************************************************/
#ifndef IA32COMPAREANALYSER_INCL
#define IA32COMPAREANALYSER_INCL
#include <stdint.h>
#include "codegen/Analyser.hpp"
#include "codegen/CodeGenerator.hpp"
#include "codegen/InstOpCode.hpp"
#define EvalChild1 0x01
#define EvalChild2 0x02
#define CmpReg1Reg2 0x04
#define CmpReg1Mem2 0x08
#define CmpMem1Reg2 0x10
namespace TR { class LabelSymbol; }
namespace TR { class Machine; }
namespace TR { class Node; }
namespace TR { class Register; }
class TR_X86CompareAnalyser : public TR_Analyser
{
static const uint8_t _actionMap[NUM_ACTIONS];
TR::CodeGenerator *_cg;
TR::Machine *_machine;
public:
TR_X86CompareAnalyser(TR::CodeGenerator *cg)
: _cg(cg), _machine(cg->machine())
{}
void integerCompareAnalyser(
TR::Node *root,
TR::InstOpCode::Mnemonic regRegOpCode,
TR::InstOpCode::Mnemonic regMemOpCode,
TR::InstOpCode::Mnemonic memRegOpCode);
void integerCompareAnalyser(
TR::Node *root,
TR::Node *firstChild,
TR::Node *secondChild,
bool determineEvaluationOrder,
TR::InstOpCode::Mnemonic regRegOpCode,
TR::InstOpCode::Mnemonic regMemOpCode,
TR::InstOpCode::Mnemonic memRegOpCode);
void longOrderedCompareAndBranchAnalyser(TR::Node *root,
TR::InstOpCode::Mnemonic lowBranchOpCode,
TR::InstOpCode::Mnemonic highBranchOpCode,
TR::InstOpCode::Mnemonic highReversedBranchOpCode);
void longEqualityCompareAndBranchAnalyser(TR::Node *root,
TR::LabelSymbol *firstBranchLabel,
TR::LabelSymbol *secondBranchLabel,
TR::InstOpCode::Mnemonic secondBranchOp);
TR::Register *longEqualityBooleanAnalyser(TR::Node *root,
TR::InstOpCode::Mnemonic setOpCode,
TR::InstOpCode::Mnemonic combineOpCode);
TR::Register *longOrderedBooleanAnalyser(TR::Node *root,
TR::InstOpCode::Mnemonic highSetOpCode,
TR::InstOpCode::Mnemonic lowSetOpCode);
TR::Register *longCMPAnalyser(TR::Node *root);
bool getEvalChild1() {return (_actionMap[getInputs()] & EvalChild1) ? true : false;}
bool getEvalChild2() {return (_actionMap[getInputs()] & EvalChild2) ? true : false;}
bool getCmpReg1Reg2() {return (_actionMap[getInputs()] & CmpReg1Reg2) ? true : false;}
bool getCmpReg1Mem2() {return (_actionMap[getInputs()] & CmpReg1Mem2) ? true : false;}
bool getCmpMem1Reg2() {return (_actionMap[getInputs()] & CmpMem1Reg2) ? true : false;}
TR::CodeGenerator *cg() { return _cg; }
};
#endif