0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1 //===-- Analysis.cpp - CodeGen LLVM IR Analysis Utilities -----------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
2 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
3 // The LLVM Compiler Infrastructure
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
4 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
5 // This file is distributed under the University of Illinois Open Source
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
6 // License. See LICENSE.TXT for details.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
7 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
8 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
9 //
|
|
77
|
10 // This file defines several CodeGen-specific LLVM IR analysis utilities.
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
11 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
12 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
13
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
14 #include "llvm/CodeGen/Analysis.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
15 #include "llvm/Analysis/ValueTracking.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
16 #include "llvm/CodeGen/MachineFunction.h"
|
|
134
|
17 #include "llvm/CodeGen/TargetInstrInfo.h"
|
|
|
18 #include "llvm/CodeGen/TargetLowering.h"
|
|
|
19 #include "llvm/CodeGen/TargetSubtargetInfo.h"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
20 #include "llvm/IR/DataLayout.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
21 #include "llvm/IR/DerivedTypes.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
22 #include "llvm/IR/Function.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
23 #include "llvm/IR/Instructions.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
24 #include "llvm/IR/IntrinsicInst.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
25 #include "llvm/IR/LLVMContext.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
26 #include "llvm/IR/Module.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
27 #include "llvm/Support/ErrorHandling.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
28 #include "llvm/Support/MathExtras.h"
|
|
77
|
29 #include "llvm/Transforms/Utils/GlobalStatus.h"
|
|
|
30
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
31 using namespace llvm;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
32
|
|
83
|
33 /// Compute the linearized index of a member in a nested aggregate/struct/array
|
|
|
34 /// by recursing and accumulating CurIndex as long as there are indices in the
|
|
|
35 /// index list.
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
36 unsigned llvm::ComputeLinearIndex(Type *Ty,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
37 const unsigned *Indices,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
38 const unsigned *IndicesEnd,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
39 unsigned CurIndex) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
40 // Base case: We're done.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
41 if (Indices && Indices == IndicesEnd)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
42 return CurIndex;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
43
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
44 // Given a struct type, recursively traverse the elements.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
45 if (StructType *STy = dyn_cast<StructType>(Ty)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
46 for (StructType::element_iterator EB = STy->element_begin(),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
47 EI = EB,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
48 EE = STy->element_end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
49 EI != EE; ++EI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
50 if (Indices && *Indices == unsigned(EI - EB))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
51 return ComputeLinearIndex(*EI, Indices+1, IndicesEnd, CurIndex);
|
|
77
|
52 CurIndex = ComputeLinearIndex(*EI, nullptr, nullptr, CurIndex);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
53 }
|
|
83
|
54 assert(!Indices && "Unexpected out of bound");
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
55 return CurIndex;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
56 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
57 // Given an array type, recursively traverse the elements.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
58 else if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
59 Type *EltTy = ATy->getElementType();
|
|
83
|
60 unsigned NumElts = ATy->getNumElements();
|
|
|
61 // Compute the Linear offset when jumping one element of the array
|
|
|
62 unsigned EltLinearOffset = ComputeLinearIndex(EltTy, nullptr, nullptr, 0);
|
|
|
63 if (Indices) {
|
|
|
64 assert(*Indices < NumElts && "Unexpected out of bound");
|
|
|
65 // If the indice is inside the array, compute the index to the requested
|
|
|
66 // elt and recurse inside the element with the end of the indices list
|
|
|
67 CurIndex += EltLinearOffset* *Indices;
|
|
|
68 return ComputeLinearIndex(EltTy, Indices+1, IndicesEnd, CurIndex);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
69 }
|
|
83
|
70 CurIndex += EltLinearOffset*NumElts;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
71 return CurIndex;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
72 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
73 // We haven't found the type we're looking for, so keep searching.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
74 return CurIndex + 1;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
75 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
76
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
77 /// ComputeValueVTs - Given an LLVM IR type, compute a sequence of
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
78 /// EVTs that represent all the individual underlying
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
79 /// non-aggregate types that comprise it.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
80 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
81 /// If Offsets is non-null, it points to a vector to be filled in
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
82 /// with the in-memory offsets of each of the individual values.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
83 ///
|
|
95
|
84 void llvm::ComputeValueVTs(const TargetLowering &TLI, const DataLayout &DL,
|
|
|
85 Type *Ty, SmallVectorImpl<EVT> &ValueVTs,
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
86 SmallVectorImpl<uint64_t> *Offsets,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
87 uint64_t StartingOffset) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
88 // Given a struct type, recursively traverse the elements.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
89 if (StructType *STy = dyn_cast<StructType>(Ty)) {
|
|
95
|
90 const StructLayout *SL = DL.getStructLayout(STy);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
91 for (StructType::element_iterator EB = STy->element_begin(),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
92 EI = EB,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
93 EE = STy->element_end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
94 EI != EE; ++EI)
|
|
95
|
95 ComputeValueVTs(TLI, DL, *EI, ValueVTs, Offsets,
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
96 StartingOffset + SL->getElementOffset(EI - EB));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
97 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
98 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
99 // Given an array type, recursively traverse the elements.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
100 if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
101 Type *EltTy = ATy->getElementType();
|
|
95
|
102 uint64_t EltSize = DL.getTypeAllocSize(EltTy);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
103 for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i)
|
|
95
|
104 ComputeValueVTs(TLI, DL, EltTy, ValueVTs, Offsets,
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
105 StartingOffset + i * EltSize);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
106 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
107 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
108 // Interpret void as zero return values.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
109 if (Ty->isVoidTy())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
110 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
111 // Base case: we can get an EVT for this LLVM IR type.
|
|
95
|
112 ValueVTs.push_back(TLI.getValueType(DL, Ty));
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
113 if (Offsets)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
114 Offsets->push_back(StartingOffset);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
115 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
116
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
117 /// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V.
|
|
83
|
118 GlobalValue *llvm::ExtractTypeInfo(Value *V) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
119 V = V->stripPointerCasts();
|
|
83
|
120 GlobalValue *GV = dyn_cast<GlobalValue>(V);
|
|
|
121 GlobalVariable *Var = dyn_cast<GlobalVariable>(V);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
122
|
|
83
|
123 if (Var && Var->getName() == "llvm.eh.catch.all.value") {
|
|
|
124 assert(Var->hasInitializer() &&
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
125 "The EH catch-all value must have an initializer");
|
|
83
|
126 Value *Init = Var->getInitializer();
|
|
|
127 GV = dyn_cast<GlobalValue>(Init);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
128 if (!GV) V = cast<ConstantPointerNull>(Init);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
129 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
130
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
131 assert((GV || isa<ConstantPointerNull>(V)) &&
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
132 "TypeInfo must be a global variable or NULL");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
133 return GV;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
134 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
135
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
136 /// hasInlineAsmMemConstraint - Return true if the inline asm instruction being
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
137 /// processed uses a memory 'm' constraint.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
138 bool
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
139 llvm::hasInlineAsmMemConstraint(InlineAsm::ConstraintInfoVector &CInfos,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
140 const TargetLowering &TLI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
141 for (unsigned i = 0, e = CInfos.size(); i != e; ++i) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
142 InlineAsm::ConstraintInfo &CI = CInfos[i];
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
143 for (unsigned j = 0, ee = CI.Codes.size(); j != ee; ++j) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
144 TargetLowering::ConstraintType CType = TLI.getConstraintType(CI.Codes[j]);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
145 if (CType == TargetLowering::C_Memory)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
146 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
147 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
148
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
149 // Indirect operand accesses access memory.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
150 if (CI.isIndirect)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
151 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
152 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
153
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
154 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
155 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
156
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
157 /// getFCmpCondCode - Return the ISD condition code corresponding to
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
158 /// the given LLVM IR floating-point condition code. This includes
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
159 /// consideration of global floating-point math flags.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
160 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
161 ISD::CondCode llvm::getFCmpCondCode(FCmpInst::Predicate Pred) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
162 switch (Pred) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
163 case FCmpInst::FCMP_FALSE: return ISD::SETFALSE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
164 case FCmpInst::FCMP_OEQ: return ISD::SETOEQ;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
165 case FCmpInst::FCMP_OGT: return ISD::SETOGT;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
166 case FCmpInst::FCMP_OGE: return ISD::SETOGE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
167 case FCmpInst::FCMP_OLT: return ISD::SETOLT;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
168 case FCmpInst::FCMP_OLE: return ISD::SETOLE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
169 case FCmpInst::FCMP_ONE: return ISD::SETONE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
170 case FCmpInst::FCMP_ORD: return ISD::SETO;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
171 case FCmpInst::FCMP_UNO: return ISD::SETUO;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
172 case FCmpInst::FCMP_UEQ: return ISD::SETUEQ;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
173 case FCmpInst::FCMP_UGT: return ISD::SETUGT;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
174 case FCmpInst::FCMP_UGE: return ISD::SETUGE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
175 case FCmpInst::FCMP_ULT: return ISD::SETULT;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
176 case FCmpInst::FCMP_ULE: return ISD::SETULE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
177 case FCmpInst::FCMP_UNE: return ISD::SETUNE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
178 case FCmpInst::FCMP_TRUE: return ISD::SETTRUE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
179 default: llvm_unreachable("Invalid FCmp predicate opcode!");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
180 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
181 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
182
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
183 ISD::CondCode llvm::getFCmpCodeWithoutNaN(ISD::CondCode CC) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
184 switch (CC) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
185 case ISD::SETOEQ: case ISD::SETUEQ: return ISD::SETEQ;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
186 case ISD::SETONE: case ISD::SETUNE: return ISD::SETNE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
187 case ISD::SETOLT: case ISD::SETULT: return ISD::SETLT;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
188 case ISD::SETOLE: case ISD::SETULE: return ISD::SETLE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
189 case ISD::SETOGT: case ISD::SETUGT: return ISD::SETGT;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
190 case ISD::SETOGE: case ISD::SETUGE: return ISD::SETGE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
191 default: return CC;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
192 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
193 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
194
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
195 /// getICmpCondCode - Return the ISD condition code corresponding to
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
196 /// the given LLVM IR integer condition code.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
197 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
198 ISD::CondCode llvm::getICmpCondCode(ICmpInst::Predicate Pred) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
199 switch (Pred) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
200 case ICmpInst::ICMP_EQ: return ISD::SETEQ;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
201 case ICmpInst::ICMP_NE: return ISD::SETNE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
202 case ICmpInst::ICMP_SLE: return ISD::SETLE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
203 case ICmpInst::ICMP_ULE: return ISD::SETULE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
204 case ICmpInst::ICMP_SGE: return ISD::SETGE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
205 case ICmpInst::ICMP_UGE: return ISD::SETUGE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
206 case ICmpInst::ICMP_SLT: return ISD::SETLT;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
207 case ICmpInst::ICMP_ULT: return ISD::SETULT;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
208 case ICmpInst::ICMP_SGT: return ISD::SETGT;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
209 case ICmpInst::ICMP_UGT: return ISD::SETUGT;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
210 default:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
211 llvm_unreachable("Invalid ICmp predicate opcode!");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
212 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
213 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
214
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
215 static bool isNoopBitcast(Type *T1, Type *T2,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
216 const TargetLoweringBase& TLI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
217 return T1 == T2 || (T1->isPointerTy() && T2->isPointerTy()) ||
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
218 (isa<VectorType>(T1) && isa<VectorType>(T2) &&
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
219 TLI.isTypeLegal(EVT::getEVT(T1)) && TLI.isTypeLegal(EVT::getEVT(T2)));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
220 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
221
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
222 /// Look through operations that will be free to find the earliest source of
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
223 /// this value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
224 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
225 /// @param ValLoc If V has aggegate type, we will be interested in a particular
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
226 /// scalar component. This records its address; the reverse of this list gives a
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
227 /// sequence of indices appropriate for an extractvalue to locate the important
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
228 /// value. This value is updated during the function and on exit will indicate
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
229 /// similar information for the Value returned.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
230 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
231 /// @param DataBits If this function looks through truncate instructions, this
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
232 /// will record the smallest size attained.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
233 static const Value *getNoopInput(const Value *V,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
234 SmallVectorImpl<unsigned> &ValLoc,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
235 unsigned &DataBits,
|
|
95
|
236 const TargetLoweringBase &TLI,
|
|
|
237 const DataLayout &DL) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
238 while (true) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
239 // Try to look through V1; if V1 is not an instruction, it can't be looked
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
240 // through.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
241 const Instruction *I = dyn_cast<Instruction>(V);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
242 if (!I || I->getNumOperands() == 0) return V;
|
|
77
|
243 const Value *NoopInput = nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
244
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
245 Value *Op = I->getOperand(0);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
246 if (isa<BitCastInst>(I)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
247 // Look through truly no-op bitcasts.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
248 if (isNoopBitcast(Op->getType(), I->getType(), TLI))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
249 NoopInput = Op;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
250 } else if (isa<GetElementPtrInst>(I)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
251 // Look through getelementptr
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
252 if (cast<GetElementPtrInst>(I)->hasAllZeroIndices())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
253 NoopInput = Op;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
254 } else if (isa<IntToPtrInst>(I)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
255 // Look through inttoptr.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
256 // Make sure this isn't a truncating or extending cast. We could
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
257 // support this eventually, but don't bother for now.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
258 if (!isa<VectorType>(I->getType()) &&
|
|
95
|
259 DL.getPointerSizeInBits() ==
|
|
|
260 cast<IntegerType>(Op->getType())->getBitWidth())
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
261 NoopInput = Op;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
262 } else if (isa<PtrToIntInst>(I)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
263 // Look through ptrtoint.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
264 // Make sure this isn't a truncating or extending cast. We could
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
265 // support this eventually, but don't bother for now.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
266 if (!isa<VectorType>(I->getType()) &&
|
|
95
|
267 DL.getPointerSizeInBits() ==
|
|
|
268 cast<IntegerType>(I->getType())->getBitWidth())
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
269 NoopInput = Op;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
270 } else if (isa<TruncInst>(I) &&
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
271 TLI.allowTruncateForTailCall(Op->getType(), I->getType())) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
272 DataBits = std::min(DataBits, I->getType()->getPrimitiveSizeInBits());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
273 NoopInput = Op;
|
|
121
|
274 } else if (auto CS = ImmutableCallSite(I)) {
|
|
|
275 const Value *ReturnedOp = CS.getReturnedArgOperand();
|
|
|
276 if (ReturnedOp && isNoopBitcast(ReturnedOp->getType(), I->getType(), TLI))
|
|
|
277 NoopInput = ReturnedOp;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
278 } else if (const InsertValueInst *IVI = dyn_cast<InsertValueInst>(V)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
279 // Value may come from either the aggregate or the scalar
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
280 ArrayRef<unsigned> InsertLoc = IVI->getIndices();
|
|
95
|
281 if (ValLoc.size() >= InsertLoc.size() &&
|
|
|
282 std::equal(InsertLoc.begin(), InsertLoc.end(), ValLoc.rbegin())) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
283 // The type being inserted is a nested sub-type of the aggregate; we
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
284 // have to remove those initial indices to get the location we're
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
285 // interested in for the operand.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
286 ValLoc.resize(ValLoc.size() - InsertLoc.size());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
287 NoopInput = IVI->getInsertedValueOperand();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
288 } else {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
289 // The struct we're inserting into has the value we're interested in, no
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
290 // change of address.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
291 NoopInput = Op;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
292 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
293 } else if (const ExtractValueInst *EVI = dyn_cast<ExtractValueInst>(V)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
294 // The part we're interested in will inevitably be some sub-section of the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
295 // previous aggregate. Combine the two paths to obtain the true address of
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
296 // our element.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
297 ArrayRef<unsigned> ExtractLoc = EVI->getIndices();
|
|
95
|
298 ValLoc.append(ExtractLoc.rbegin(), ExtractLoc.rend());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
299 NoopInput = Op;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
300 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
301 // Terminate if we couldn't find anything to look through.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
302 if (!NoopInput)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
303 return V;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
304
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
305 V = NoopInput;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
306 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
307 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
308
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
309 /// Return true if this scalar return value only has bits discarded on its path
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
310 /// from the "tail call" to the "ret". This includes the obvious noop
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
311 /// instructions handled by getNoopInput above as well as free truncations (or
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
312 /// extensions prior to the call).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
313 static bool slotOnlyDiscardsData(const Value *RetVal, const Value *CallVal,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
314 SmallVectorImpl<unsigned> &RetIndices,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
315 SmallVectorImpl<unsigned> &CallIndices,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
316 bool AllowDifferingSizes,
|
|
95
|
317 const TargetLoweringBase &TLI,
|
|
|
318 const DataLayout &DL) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
319
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
320 // Trace the sub-value needed by the return value as far back up the graph as
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
321 // possible, in the hope that it will intersect with the value produced by the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
322 // call. In the simple case with no "returned" attribute, the hope is actually
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
323 // that we end up back at the tail call instruction itself.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
324 unsigned BitsRequired = UINT_MAX;
|
|
95
|
325 RetVal = getNoopInput(RetVal, RetIndices, BitsRequired, TLI, DL);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
326
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
327 // If this slot in the value returned is undef, it doesn't matter what the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
328 // call puts there, it'll be fine.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
329 if (isa<UndefValue>(RetVal))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
330 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
331
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
332 // Now do a similar search up through the graph to find where the value
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
333 // actually returned by the "tail call" comes from. In the simple case without
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
334 // a "returned" attribute, the search will be blocked immediately and the loop
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
335 // a Noop.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
336 unsigned BitsProvided = UINT_MAX;
|
|
95
|
337 CallVal = getNoopInput(CallVal, CallIndices, BitsProvided, TLI, DL);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
338
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
339 // There's no hope if we can't actually trace them to (the same part of!) the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
340 // same value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
341 if (CallVal != RetVal || CallIndices != RetIndices)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
342 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
343
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
344 // However, intervening truncates may have made the call non-tail. Make sure
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
345 // all the bits that are needed by the "ret" have been provided by the "tail
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
346 // call". FIXME: with sufficiently cunning bit-tracking, we could look through
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
347 // extensions too.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
348 if (BitsProvided < BitsRequired ||
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
349 (!AllowDifferingSizes && BitsProvided != BitsRequired))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
350 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
351
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
352 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
353 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
354
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
355 /// For an aggregate type, determine whether a given index is within bounds or
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
356 /// not.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
357 static bool indexReallyValid(CompositeType *T, unsigned Idx) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
358 if (ArrayType *AT = dyn_cast<ArrayType>(T))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
359 return Idx < AT->getNumElements();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
360
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
361 return Idx < cast<StructType>(T)->getNumElements();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
362 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
363
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
364 /// Move the given iterators to the next leaf type in depth first traversal.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
365 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
366 /// Performs a depth-first traversal of the type as specified by its arguments,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
367 /// stopping at the next leaf node (which may be a legitimate scalar type or an
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
368 /// empty struct or array).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
369 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
370 /// @param SubTypes List of the partial components making up the type from
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
371 /// outermost to innermost non-empty aggregate. The element currently
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
372 /// represented is SubTypes.back()->getTypeAtIndex(Path.back() - 1).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
373 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
374 /// @param Path Set of extractvalue indices leading from the outermost type
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
375 /// (SubTypes[0]) to the leaf node currently represented.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
376 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
377 /// @returns true if a new type was found, false otherwise. Calling this
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
378 /// function again on a finished iterator will repeatedly return
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
379 /// false. SubTypes.back()->getTypeAtIndex(Path.back()) is either an empty
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
380 /// aggregate or a non-aggregate
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
381 static bool advanceToNextLeafType(SmallVectorImpl<CompositeType *> &SubTypes,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
382 SmallVectorImpl<unsigned> &Path) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
383 // First march back up the tree until we can successfully increment one of the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
384 // coordinates in Path.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
385 while (!Path.empty() && !indexReallyValid(SubTypes.back(), Path.back() + 1)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
386 Path.pop_back();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
387 SubTypes.pop_back();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
388 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
389
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
390 // If we reached the top, then the iterator is done.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
391 if (Path.empty())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
392 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
393
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
394 // We know there's *some* valid leaf now, so march back down the tree picking
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
395 // out the left-most element at each node.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
396 ++Path.back();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
397 Type *DeeperType = SubTypes.back()->getTypeAtIndex(Path.back());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
398 while (DeeperType->isAggregateType()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
399 CompositeType *CT = cast<CompositeType>(DeeperType);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
400 if (!indexReallyValid(CT, 0))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
401 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
402
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
403 SubTypes.push_back(CT);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
404 Path.push_back(0);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
405
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
406 DeeperType = CT->getTypeAtIndex(0U);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
407 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
408
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
409 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
410 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
411
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
412 /// Find the first non-empty, scalar-like type in Next and setup the iterator
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
413 /// components.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
414 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
415 /// Assuming Next is an aggregate of some kind, this function will traverse the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
416 /// tree from left to right (i.e. depth-first) looking for the first
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
417 /// non-aggregate type which will play a role in function return.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
418 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
419 /// For example, if Next was {[0 x i64], {{}, i32, {}}, i32} then we would setup
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
420 /// Path as [1, 1] and SubTypes as [Next, {{}, i32, {}}] to represent the first
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
421 /// i32 in that type.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
422 static bool firstRealType(Type *Next,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
423 SmallVectorImpl<CompositeType *> &SubTypes,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
424 SmallVectorImpl<unsigned> &Path) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
425 // First initialise the iterator components to the first "leaf" node
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
426 // (i.e. node with no valid sub-type at any index, so {} does count as a leaf
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
427 // despite nominally being an aggregate).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
428 while (Next->isAggregateType() &&
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
429 indexReallyValid(cast<CompositeType>(Next), 0)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
430 SubTypes.push_back(cast<CompositeType>(Next));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
431 Path.push_back(0);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
432 Next = cast<CompositeType>(Next)->getTypeAtIndex(0U);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
433 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
434
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
435 // If there's no Path now, Next was originally scalar already (or empty
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
436 // leaf). We're done.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
437 if (Path.empty())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
438 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
439
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
440 // Otherwise, use normal iteration to keep looking through the tree until we
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
441 // find a non-aggregate type.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
442 while (SubTypes.back()->getTypeAtIndex(Path.back())->isAggregateType()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
443 if (!advanceToNextLeafType(SubTypes, Path))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
444 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
445 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
446
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
447 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
448 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
449
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
450 /// Set the iterator data-structures to the next non-empty, non-aggregate
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
451 /// subtype.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
452 static bool nextRealType(SmallVectorImpl<CompositeType *> &SubTypes,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
453 SmallVectorImpl<unsigned> &Path) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
454 do {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
455 if (!advanceToNextLeafType(SubTypes, Path))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
456 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
457
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
458 assert(!Path.empty() && "found a leaf but didn't set the path?");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
459 } while (SubTypes.back()->getTypeAtIndex(Path.back())->isAggregateType());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
460
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
461 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
462 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
463
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
464
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
465 /// Test if the given instruction is in a position to be optimized
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
466 /// with a tail-call. This roughly means that it's in a block with
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
467 /// a return and there's nothing that needs to be scheduled
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
468 /// between it and the return.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
469 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
470 /// This function only tests target-independent requirements.
|
|
77
|
471 bool llvm::isInTailCallPosition(ImmutableCallSite CS, const TargetMachine &TM) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
472 const Instruction *I = CS.getInstruction();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
473 const BasicBlock *ExitBB = I->getParent();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
474 const TerminatorInst *Term = ExitBB->getTerminator();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
475 const ReturnInst *Ret = dyn_cast<ReturnInst>(Term);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
476
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
477 // The block must end in a return statement or unreachable.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
478 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
479 // FIXME: Decline tailcall if it's not guaranteed and if the block ends in
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
480 // an unreachable, for now. The way tailcall optimization is currently
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
481 // implemented means it will add an epilogue followed by a jump. That is
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
482 // not profitable. Also, if the callee is a special function (e.g.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
483 // longjmp on x86), it can end up causing miscompilation that has not
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
484 // been fully understood.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
485 if (!Ret &&
|
|
77
|
486 (!TM.Options.GuaranteedTailCallOpt || !isa<UnreachableInst>(Term)))
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
487 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
488
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
489 // If I will have a chain, make sure no other instruction that will have a
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
490 // chain interposes between I and the return.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
491 if (I->mayHaveSideEffects() || I->mayReadFromMemory() ||
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
492 !isSafeToSpeculativelyExecute(I))
|
|
77
|
493 for (BasicBlock::const_iterator BBI = std::prev(ExitBB->end(), 2);; --BBI) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
494 if (&*BBI == I)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
495 break;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
496 // Debug info intrinsics do not get in the way of tail call optimization.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
497 if (isa<DbgInfoIntrinsic>(BBI))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
498 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
499 if (BBI->mayHaveSideEffects() || BBI->mayReadFromMemory() ||
|
|
95
|
500 !isSafeToSpeculativelyExecute(&*BBI))
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
501 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
502 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
503
|
|
95
|
504 const Function *F = ExitBB->getParent();
|
|
77
|
505 return returnTypeIsEligibleForTailCall(
|
|
95
|
506 F, I, Ret, *TM.getSubtargetImpl(*F)->getTargetLowering());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
507 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
508
|
|
120
|
509 bool llvm::attributesPermitTailCall(const Function *F, const Instruction *I,
|
|
|
510 const ReturnInst *Ret,
|
|
|
511 const TargetLoweringBase &TLI,
|
|
|
512 bool *AllowDifferingSizes) {
|
|
|
513 // ADS may be null, so don't write to it directly.
|
|
|
514 bool DummyADS;
|
|
|
515 bool &ADS = AllowDifferingSizes ? *AllowDifferingSizes : DummyADS;
|
|
|
516 ADS = true;
|
|
|
517
|
|
121
|
518 AttrBuilder CallerAttrs(F->getAttributes(), AttributeList::ReturnIndex);
|
|
120
|
519 AttrBuilder CalleeAttrs(cast<CallInst>(I)->getAttributes(),
|
|
121
|
520 AttributeList::ReturnIndex);
|
|
120
|
521
|
|
|
522 // Noalias is completely benign as far as calling convention goes, it
|
|
|
523 // shouldn't affect whether the call is a tail call.
|
|
|
524 CallerAttrs.removeAttribute(Attribute::NoAlias);
|
|
|
525 CalleeAttrs.removeAttribute(Attribute::NoAlias);
|
|
|
526
|
|
|
527 if (CallerAttrs.contains(Attribute::ZExt)) {
|
|
|
528 if (!CalleeAttrs.contains(Attribute::ZExt))
|
|
|
529 return false;
|
|
|
530
|
|
|
531 ADS = false;
|
|
|
532 CallerAttrs.removeAttribute(Attribute::ZExt);
|
|
|
533 CalleeAttrs.removeAttribute(Attribute::ZExt);
|
|
|
534 } else if (CallerAttrs.contains(Attribute::SExt)) {
|
|
|
535 if (!CalleeAttrs.contains(Attribute::SExt))
|
|
|
536 return false;
|
|
|
537
|
|
|
538 ADS = false;
|
|
|
539 CallerAttrs.removeAttribute(Attribute::SExt);
|
|
|
540 CalleeAttrs.removeAttribute(Attribute::SExt);
|
|
|
541 }
|
|
|
542
|
|
|
543 // If they're still different, there's some facet we don't understand
|
|
|
544 // (currently only "inreg", but in future who knows). It may be OK but the
|
|
|
545 // only safe option is to reject the tail call.
|
|
|
546 return CallerAttrs == CalleeAttrs;
|
|
|
547 }
|
|
|
548
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
549 bool llvm::returnTypeIsEligibleForTailCall(const Function *F,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
550 const Instruction *I,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
551 const ReturnInst *Ret,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
552 const TargetLoweringBase &TLI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
553 // If the block ends with a void return or unreachable, it doesn't matter
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
554 // what the call's return type is.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
555 if (!Ret || Ret->getNumOperands() == 0) return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
556
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
557 // If the return value is undef, it doesn't matter what the call's
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
558 // return type is.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
559 if (isa<UndefValue>(Ret->getOperand(0))) return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
560
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
561 // Make sure the attributes attached to each return are compatible.
|
|
120
|
562 bool AllowDifferingSizes;
|
|
|
563 if (!attributesPermitTailCall(F, I, Ret, TLI, &AllowDifferingSizes))
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
564 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
565
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
566 const Value *RetVal = Ret->getOperand(0), *CallVal = I;
|
|
121
|
567 // Intrinsic like llvm.memcpy has no return value, but the expanded
|
|
|
568 // libcall may or may not have return value. On most platforms, it
|
|
|
569 // will be expanded as memcpy in libc, which returns the first
|
|
|
570 // argument. On other platforms like arm-none-eabi, memcpy may be
|
|
|
571 // expanded as library call without return value, like __aeabi_memcpy.
|
|
|
572 const CallInst *Call = cast<CallInst>(I);
|
|
|
573 if (Function *F = Call->getCalledFunction()) {
|
|
|
574 Intrinsic::ID IID = F->getIntrinsicID();
|
|
|
575 if (((IID == Intrinsic::memcpy &&
|
|
|
576 TLI.getLibcallName(RTLIB::MEMCPY) == StringRef("memcpy")) ||
|
|
|
577 (IID == Intrinsic::memmove &&
|
|
|
578 TLI.getLibcallName(RTLIB::MEMMOVE) == StringRef("memmove")) ||
|
|
|
579 (IID == Intrinsic::memset &&
|
|
|
580 TLI.getLibcallName(RTLIB::MEMSET) == StringRef("memset"))) &&
|
|
|
581 RetVal == Call->getArgOperand(0))
|
|
|
582 return true;
|
|
|
583 }
|
|
|
584
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
585 SmallVector<unsigned, 4> RetPath, CallPath;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
586 SmallVector<CompositeType *, 4> RetSubTypes, CallSubTypes;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
587
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
588 bool RetEmpty = !firstRealType(RetVal->getType(), RetSubTypes, RetPath);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
589 bool CallEmpty = !firstRealType(CallVal->getType(), CallSubTypes, CallPath);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
590
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
591 // Nothing's actually returned, it doesn't matter what the callee put there
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
592 // it's a valid tail call.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
593 if (RetEmpty)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
594 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
595
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
596 // Iterate pairwise through each of the value types making up the tail call
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
597 // and the corresponding return. For each one we want to know whether it's
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
598 // essentially going directly from the tail call to the ret, via operations
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
599 // that end up not generating any code.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
600 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
601 // We allow a certain amount of covariance here. For example it's permitted
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
602 // for the tail call to define more bits than the ret actually cares about
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
603 // (e.g. via a truncate).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
604 do {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
605 if (CallEmpty) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
606 // We've exhausted the values produced by the tail call instruction, the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
607 // rest are essentially undef. The type doesn't really matter, but we need
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
608 // *something*.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
609 Type *SlotType = RetSubTypes.back()->getTypeAtIndex(RetPath.back());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
610 CallVal = UndefValue::get(SlotType);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
611 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
612
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
613 // The manipulations performed when we're looking through an insertvalue or
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
614 // an extractvalue would happen at the front of the RetPath list, so since
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
615 // we have to copy it anyway it's more efficient to create a reversed copy.
|
|
95
|
616 SmallVector<unsigned, 4> TmpRetPath(RetPath.rbegin(), RetPath.rend());
|
|
|
617 SmallVector<unsigned, 4> TmpCallPath(CallPath.rbegin(), CallPath.rend());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
618
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
619 // Finally, we can check whether the value produced by the tail call at this
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
620 // index is compatible with the value we return.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
621 if (!slotOnlyDiscardsData(RetVal, CallVal, TmpRetPath, TmpCallPath,
|
|
95
|
622 AllowDifferingSizes, TLI,
|
|
|
623 F->getParent()->getDataLayout()))
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
624 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
625
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
626 CallEmpty = !nextRealType(CallSubTypes, CallPath);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
627 } while(nextRealType(RetSubTypes, RetPath));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
628
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
629 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
630 }
|
|
77
|
631
|
|
95
|
632 static void collectFuncletMembers(
|
|
|
633 DenseMap<const MachineBasicBlock *, int> &FuncletMembership, int Funclet,
|
|
|
634 const MachineBasicBlock *MBB) {
|
|
100
|
635 SmallVector<const MachineBasicBlock *, 16> Worklist = {MBB};
|
|
|
636 while (!Worklist.empty()) {
|
|
|
637 const MachineBasicBlock *Visiting = Worklist.pop_back_val();
|
|
|
638 // Don't follow blocks which start new funclets.
|
|
|
639 if (Visiting->isEHPad() && Visiting != MBB)
|
|
|
640 continue;
|
|
95
|
641
|
|
100
|
642 // Add this MBB to our funclet.
|
|
|
643 auto P = FuncletMembership.insert(std::make_pair(Visiting, Funclet));
|
|
95
|
644
|
|
100
|
645 // Don't revisit blocks.
|
|
|
646 if (!P.second) {
|
|
|
647 assert(P.first->second == Funclet && "MBB is part of two funclets!");
|
|
|
648 continue;
|
|
|
649 }
|
|
95
|
650
|
|
100
|
651 // Returns are boundaries where funclet transfer can occur, don't follow
|
|
|
652 // successors.
|
|
|
653 if (Visiting->isReturnBlock())
|
|
|
654 continue;
|
|
95
|
655
|
|
100
|
656 for (const MachineBasicBlock *Succ : Visiting->successors())
|
|
|
657 Worklist.push_back(Succ);
|
|
|
658 }
|
|
95
|
659 }
|
|
|
660
|
|
|
661 DenseMap<const MachineBasicBlock *, int>
|
|
|
662 llvm::getFuncletMembership(const MachineFunction &MF) {
|
|
|
663 DenseMap<const MachineBasicBlock *, int> FuncletMembership;
|
|
|
664
|
|
|
665 // We don't have anything to do if there aren't any EH pads.
|
|
121
|
666 if (!MF.hasEHFunclets())
|
|
95
|
667 return FuncletMembership;
|
|
|
668
|
|
|
669 int EntryBBNumber = MF.front().getNumber();
|
|
|
670 bool IsSEH = isAsynchronousEHPersonality(
|
|
134
|
671 classifyEHPersonality(MF.getFunction().getPersonalityFn()));
|
|
95
|
672
|
|
|
673 const TargetInstrInfo *TII = MF.getSubtarget().getInstrInfo();
|
|
|
674 SmallVector<const MachineBasicBlock *, 16> FuncletBlocks;
|
|
|
675 SmallVector<const MachineBasicBlock *, 16> UnreachableBlocks;
|
|
|
676 SmallVector<const MachineBasicBlock *, 16> SEHCatchPads;
|
|
|
677 SmallVector<std::pair<const MachineBasicBlock *, int>, 16> CatchRetSuccessors;
|
|
|
678 for (const MachineBasicBlock &MBB : MF) {
|
|
|
679 if (MBB.isEHFuncletEntry()) {
|
|
|
680 FuncletBlocks.push_back(&MBB);
|
|
|
681 } else if (IsSEH && MBB.isEHPad()) {
|
|
|
682 SEHCatchPads.push_back(&MBB);
|
|
|
683 } else if (MBB.pred_empty()) {
|
|
|
684 UnreachableBlocks.push_back(&MBB);
|
|
|
685 }
|
|
|
686
|
|
|
687 MachineBasicBlock::const_iterator MBBI = MBB.getFirstTerminator();
|
|
120
|
688
|
|
95
|
689 // CatchPads are not funclets for SEH so do not consider CatchRet to
|
|
|
690 // transfer control to another funclet.
|
|
120
|
691 if (MBBI == MBB.end() || MBBI->getOpcode() != TII->getCatchReturnOpcode())
|
|
95
|
692 continue;
|
|
|
693
|
|
|
694 // FIXME: SEH CatchPads are not necessarily in the parent function:
|
|
|
695 // they could be inside a finally block.
|
|
|
696 const MachineBasicBlock *Successor = MBBI->getOperand(0).getMBB();
|
|
|
697 const MachineBasicBlock *SuccessorColor = MBBI->getOperand(1).getMBB();
|
|
|
698 CatchRetSuccessors.push_back(
|
|
|
699 {Successor, IsSEH ? EntryBBNumber : SuccessorColor->getNumber()});
|
|
|
700 }
|
|
|
701
|
|
|
702 // We don't have anything to do if there aren't any EH pads.
|
|
|
703 if (FuncletBlocks.empty())
|
|
|
704 return FuncletMembership;
|
|
|
705
|
|
|
706 // Identify all the basic blocks reachable from the function entry.
|
|
|
707 collectFuncletMembers(FuncletMembership, EntryBBNumber, &MF.front());
|
|
|
708 // All blocks not part of a funclet are in the parent function.
|
|
|
709 for (const MachineBasicBlock *MBB : UnreachableBlocks)
|
|
|
710 collectFuncletMembers(FuncletMembership, EntryBBNumber, MBB);
|
|
|
711 // Next, identify all the blocks inside the funclets.
|
|
|
712 for (const MachineBasicBlock *MBB : FuncletBlocks)
|
|
|
713 collectFuncletMembers(FuncletMembership, MBB->getNumber(), MBB);
|
|
|
714 // SEH CatchPads aren't really funclets, handle them separately.
|
|
|
715 for (const MachineBasicBlock *MBB : SEHCatchPads)
|
|
|
716 collectFuncletMembers(FuncletMembership, EntryBBNumber, MBB);
|
|
|
717 // Finally, identify all the targets of a catchret.
|
|
|
718 for (std::pair<const MachineBasicBlock *, int> CatchRetPair :
|
|
|
719 CatchRetSuccessors)
|
|
|
720 collectFuncletMembers(FuncletMembership, CatchRetPair.second,
|
|
|
721 CatchRetPair.first);
|
|
|
722 return FuncletMembership;
|
|
|
723 }
|
