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
|
//
// Copyright (c) Microsoft. All rights reserved.
// Licensed under the MIT license. See LICENSE file in the project root for full license information.
//
/*XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XX XX
XX Lower XX
XX XX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
*/
#ifndef _LOWER_H_
#define _LOWER_H_
#include "compiler.h"
#include "phase.h"
#include "lsra.h"
class Lowering : public Phase
{
public:
inline Lowering(Compiler* compiler, LinearScanInterface* lsra)
: Phase(compiler, "Lowering", PHASE_LOWERING),
vtableCallTemp(BAD_VAR_NUM)
{
m_lsra = (LinearScan *)lsra;
assert(m_lsra);
}
virtual void DoPhase();
private:
// Friends
static Compiler::fgWalkResult LowerNodeHelper (GenTreePtr* ppTree, Compiler::fgWalkData* data);
static Compiler::fgWalkResult DecompNodeHelper (GenTreePtr* ppTree, Compiler::fgWalkData* data);
static Compiler::fgWalkResult TreeInfoInitHelper(GenTreePtr* ppTree, Compiler::fgWalkData* data);
// Member Functions
void DecomposeNode(GenTreePtr* tree, Compiler::fgWalkData* data);
void LowerNode(GenTreePtr* tree, Compiler::fgWalkData* data);
GenTreeStmt* LowerMorphAndSeqTree(GenTree *tree);
void CheckVSQuirkStackPaddingNeeded(GenTreeCall* call);
// ------------------------------
// Call Lowering
// ------------------------------
void LowerCall (GenTree* call);
void LowerJmpMethod (GenTree* jmp);
void LowerRet (GenTree* ret);
GenTree* LowerDelegateInvoke (GenTreeCall* call);
GenTree* LowerIndirectNonvirtCall (GenTreeCall* call);
GenTree* LowerDirectCall (GenTreeCall* call);
GenTree* LowerNonvirtPinvokeCall (GenTreeCall* call);
GenTree* LowerTailCallViaHelper (GenTreeCall* callNode, GenTree *callTarget);
void LowerFastTailCall (GenTreeCall* callNode);
void InsertProfTailCallHook (GenTreeCall* callNode, GenTree *insertionPoint);
GenTree* LowerVirtualVtableCall (GenTreeCall* call);
GenTree* LowerVirtualStubCall (GenTreeCall* call);
void LowerArgsForCall (GenTreeCall* call);
GenTree* NewPutArg (GenTreeCall* call, GenTreePtr arg, fgArgTabEntryPtr fp, var_types type);
void LowerArg (GenTreeCall* call, GenTreePtr *ppTree);
void InsertPInvokeCallProlog (GenTreeCall* call);
void InsertPInvokeCallEpilog (GenTreeCall* call);
void InsertPInvokeMethodProlog();
void InsertPInvokeMethodEpilog(BasicBlock *returnBB);
GenTree *SetGCState(int cns);
GenTree *CreateReturnTrapSeq();
enum FrameLinkAction { PushFrame, PopFrame };
GenTree *CreateFrameLinkUpdate(FrameLinkAction);
GenTree *AddrGen(ssize_t addr, regNumber reg = REG_NA);
GenTree *AddrGen(void *addr, regNumber reg = REG_NA);
// return concatenation of two trees, which currently uses a comma and really should not
// because we're not supposed to have commas in codegen
GenTree *Concat(GenTree *first, GenTree *second)
{
// if any is null, it must be the first
if (first == nullptr)
{
return second;
}
else if (second == nullptr)
{
return first;
}
else
{
return comp->gtNewOperNode(GT_COMMA, TYP_I_IMPL, first, second);
}
}
GenTree* Ind(GenTree* tree)
{
return comp->gtNewOperNode(GT_IND, TYP_I_IMPL, tree);
}
GenTree* PhysReg(regNumber reg, var_types type = TYP_I_IMPL)
{
return comp->gtNewPhysRegNode(reg, type);
}
GenTree* PhysRegDst(regNumber reg, GenTree* src)
{
return comp->gtNewPhysRegNode(reg, src);
}
GenTree* ThisReg(GenTreeCall* call)
{
return PhysReg(comp->codeGen->genGetThisArgReg(call), TYP_REF);
}
GenTree* Offset(GenTree* base, unsigned offset)
{
var_types resultType = (base->TypeGet() == TYP_REF) ? TYP_BYREF : base->TypeGet();
return new(comp, GT_LEA) GenTreeAddrMode(resultType, base, nullptr, 0, offset);
}
// returns true if the tree can use the read-modify-write memory instruction form
bool isRMWRegOper(GenTreePtr tree);
// return true if this call target is within range of a pc-rel call on the machine
bool IsCallTargetInRange(void *addr);
void TreeNodeInfoInit(GenTree* stmt);
void TreeNodeInfoInit(GenTreePtr* tree, GenTree* parent);
#ifdef _TARGET_ARM_
void TreeNodeInfoInitCall(GenTreePtr tree, TreeNodeInfo &info, int &srcCount, int &dstCount);
#endif // _TARGET_ARM_
void TreeNodeInfoInitStructArg(GenTreePtr structArg);
#ifdef FEATURE_SIMD
void TreeNodeInfoInitSIMD(GenTree* tree, LinearScan* lsra);
#endif // FEATURE_SIMD
void SpliceInUnary(GenTreePtr parent, GenTreePtr* ppChild, GenTreePtr newNode);
void DumpNodeInfoMap();
// Per tree node member functions
void LowerInd(GenTreePtr* ppTree);
void LowerAddrMode(GenTreePtr* ppTree, GenTree* before, Compiler::fgWalkData* data, bool isIndir);
void LowerAdd(GenTreePtr* ppTree, Compiler::fgWalkData* data);
// Remove the nodes that are no longer used after an addressing mode is constructed under a GT_IND
void LowerIndCleanupHelper(GenTreeAddrMode* addrMode, GenTreePtr tree);
void LowerSwitch(GenTreePtr* ppTree);
void LowerCast(GenTreePtr* ppTree);
void LowerCntBlockOp(GenTreePtr* ppTree);
void SetMulOpCounts(GenTreePtr tree);
void LowerCmp(GenTreePtr tree);
#if !CPU_LOAD_STORE_ARCH
bool LowerStoreInd(GenTreePtr tree);
#endif
void LowerStoreLoc(GenTreeLclVarCommon* tree);
void HandleIndirAddressExpression(GenTree *indirTree, GenTree* tree);
void LowerGCWriteBarrier(GenTree *tree);
void LowerArrElem(GenTree **ppTree, Compiler::fgWalkData* data);
// Utility functions
void MorphBlkIntoHelperCall (GenTreePtr pTree, GenTreePtr treeStmt);
public:
static bool IndirsAreEquivalent (GenTreePtr pTreeA, GenTreePtr pTreeB);
private:
static bool NodesAreEquivalentLeaves (GenTreePtr candidate, GenTreePtr storeInd);
void SetStoreIndOpCounts (GenTreePtr storeInd,
GenTreePtr indirCandidate);
GenTreePtr CreateLocalTempAsg (GenTreePtr rhs, unsigned refCount, GenTreePtr *ppLclVar = nullptr);
GenTreePtr CreateAsgByRefNonGcStmt (Compiler* comp,
BasicBlock* block,
GenTreePtr srcObj,
GenTreePtr dstObj,
GenTreePtr index,
unsigned scale,
unsigned offset);
bool AreSourcesPossiblyModified (GenTree* use, GenTree* src1, GenTree *src2);
void ReplaceNode (GenTree** ppTreeLocation,
GenTree* replacementNode,
GenTree* stmt,
BasicBlock* block);
void UnlinkNode (GenTree** ppParentLink, GenTree* stmt, BasicBlock* block);
void SimpleLinkNodeAfter (GenTree* prevTree, GenTree* newTree);
// return true if 'childNode' is an immediate that can be contained
// by the 'parentNode' (i.e. folded into an instruction)
// for example small enough and non-relocatable
bool IsContainableImmed(GenTree* parentNode, GenTree* childNode);
// Makes 'childNode' contained in the 'parentNode'
void MakeSrcContained(GenTreePtr parentNode, GenTreePtr childNode);
// Checks and makes 'childNode' contained in the 'parentNode'
bool CheckImmedAndMakeContained(GenTree* parentNode, GenTree* childNode);
LinearScan *m_lsra;
BasicBlock *currBlock;
unsigned vtableCallTemp; // local variable we use as a temp for vtable calls
};
#endif // _LOWER_H_
|
