File: | llvm/include/llvm/IR/Instructions.h |
Warning: | line 2646, column 5 Called C++ object pointer is null |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
1 | //===- IndirectBrExpandPass.cpp - Expand indirectbr to switch -------------===// | ||||||||
2 | // | ||||||||
3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. | ||||||||
4 | // See https://llvm.org/LICENSE.txt for license information. | ||||||||
5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception | ||||||||
6 | // | ||||||||
7 | //===----------------------------------------------------------------------===// | ||||||||
8 | /// \file | ||||||||
9 | /// | ||||||||
10 | /// Implements an expansion pass to turn `indirectbr` instructions in the IR | ||||||||
11 | /// into `switch` instructions. This works by enumerating the basic blocks in | ||||||||
12 | /// a dense range of integers, replacing each `blockaddr` constant with the | ||||||||
13 | /// corresponding integer constant, and then building a switch that maps from | ||||||||
14 | /// the integers to the actual blocks. All of the indirectbr instructions in the | ||||||||
15 | /// function are redirected to this common switch. | ||||||||
16 | /// | ||||||||
17 | /// While this is generically useful if a target is unable to codegen | ||||||||
18 | /// `indirectbr` natively, it is primarily useful when there is some desire to | ||||||||
19 | /// get the builtin non-jump-table lowering of a switch even when the input | ||||||||
20 | /// source contained an explicit indirect branch construct. | ||||||||
21 | /// | ||||||||
22 | /// Note that it doesn't make any sense to enable this pass unless a target also | ||||||||
23 | /// disables jump-table lowering of switches. Doing that is likely to pessimize | ||||||||
24 | /// the code. | ||||||||
25 | /// | ||||||||
26 | //===----------------------------------------------------------------------===// | ||||||||
27 | |||||||||
28 | #include "llvm/ADT/STLExtras.h" | ||||||||
29 | #include "llvm/ADT/Sequence.h" | ||||||||
30 | #include "llvm/ADT/SmallVector.h" | ||||||||
31 | #include "llvm/Analysis/DomTreeUpdater.h" | ||||||||
32 | #include "llvm/CodeGen/TargetPassConfig.h" | ||||||||
33 | #include "llvm/CodeGen/TargetSubtargetInfo.h" | ||||||||
34 | #include "llvm/IR/BasicBlock.h" | ||||||||
35 | #include "llvm/IR/Dominators.h" | ||||||||
36 | #include "llvm/IR/Function.h" | ||||||||
37 | #include "llvm/IR/IRBuilder.h" | ||||||||
38 | #include "llvm/IR/InstIterator.h" | ||||||||
39 | #include "llvm/IR/Instruction.h" | ||||||||
40 | #include "llvm/IR/Instructions.h" | ||||||||
41 | #include "llvm/InitializePasses.h" | ||||||||
42 | #include "llvm/Pass.h" | ||||||||
43 | #include "llvm/Support/Debug.h" | ||||||||
44 | #include "llvm/Support/ErrorHandling.h" | ||||||||
45 | #include "llvm/Support/raw_ostream.h" | ||||||||
46 | #include "llvm/Target/TargetMachine.h" | ||||||||
47 | |||||||||
48 | using namespace llvm; | ||||||||
49 | |||||||||
50 | #define DEBUG_TYPE"indirectbr-expand" "indirectbr-expand" | ||||||||
51 | |||||||||
52 | namespace { | ||||||||
53 | |||||||||
54 | class IndirectBrExpandPass : public FunctionPass { | ||||||||
55 | const TargetLowering *TLI = nullptr; | ||||||||
56 | |||||||||
57 | public: | ||||||||
58 | static char ID; // Pass identification, replacement for typeid | ||||||||
59 | |||||||||
60 | IndirectBrExpandPass() : FunctionPass(ID) { | ||||||||
61 | initializeIndirectBrExpandPassPass(*PassRegistry::getPassRegistry()); | ||||||||
62 | } | ||||||||
63 | |||||||||
64 | void getAnalysisUsage(AnalysisUsage &AU) const override { | ||||||||
65 | AU.addPreserved<DominatorTreeWrapperPass>(); | ||||||||
66 | } | ||||||||
67 | |||||||||
68 | bool runOnFunction(Function &F) override; | ||||||||
69 | }; | ||||||||
70 | |||||||||
71 | } // end anonymous namespace | ||||||||
72 | |||||||||
73 | char IndirectBrExpandPass::ID = 0; | ||||||||
74 | |||||||||
75 | INITIALIZE_PASS_BEGIN(IndirectBrExpandPass, DEBUG_TYPE,static void *initializeIndirectBrExpandPassPassOnce(PassRegistry &Registry) { | ||||||||
76 | "Expand indirectbr instructions", false, false)static void *initializeIndirectBrExpandPassPassOnce(PassRegistry &Registry) { | ||||||||
77 | INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)initializeDominatorTreeWrapperPassPass(Registry); | ||||||||
78 | INITIALIZE_PASS_END(IndirectBrExpandPass, DEBUG_TYPE,PassInfo *PI = new PassInfo( "Expand indirectbr instructions" , "indirectbr-expand", &IndirectBrExpandPass::ID, PassInfo ::NormalCtor_t(callDefaultCtor<IndirectBrExpandPass>), false , false); Registry.registerPass(*PI, true); return PI; } static llvm::once_flag InitializeIndirectBrExpandPassPassFlag; void llvm::initializeIndirectBrExpandPassPass(PassRegistry &Registry ) { llvm::call_once(InitializeIndirectBrExpandPassPassFlag, initializeIndirectBrExpandPassPassOnce , std::ref(Registry)); } | ||||||||
79 | "Expand indirectbr instructions", false, false)PassInfo *PI = new PassInfo( "Expand indirectbr instructions" , "indirectbr-expand", &IndirectBrExpandPass::ID, PassInfo ::NormalCtor_t(callDefaultCtor<IndirectBrExpandPass>), false , false); Registry.registerPass(*PI, true); return PI; } static llvm::once_flag InitializeIndirectBrExpandPassPassFlag; void llvm::initializeIndirectBrExpandPassPass(PassRegistry &Registry ) { llvm::call_once(InitializeIndirectBrExpandPassPassFlag, initializeIndirectBrExpandPassPassOnce , std::ref(Registry)); } | ||||||||
80 | |||||||||
81 | FunctionPass *llvm::createIndirectBrExpandPass() { | ||||||||
82 | return new IndirectBrExpandPass(); | ||||||||
83 | } | ||||||||
84 | |||||||||
85 | bool IndirectBrExpandPass::runOnFunction(Function &F) { | ||||||||
86 | auto &DL = F.getParent()->getDataLayout(); | ||||||||
87 | auto *TPC = getAnalysisIfAvailable<TargetPassConfig>(); | ||||||||
| |||||||||
88 | if (!TPC) | ||||||||
89 | return false; | ||||||||
90 | |||||||||
91 | auto &TM = TPC->getTM<TargetMachine>(); | ||||||||
92 | auto &STI = *TM.getSubtargetImpl(F); | ||||||||
93 | if (!STI.enableIndirectBrExpand()) | ||||||||
94 | return false; | ||||||||
95 | TLI = STI.getTargetLowering(); | ||||||||
96 | |||||||||
97 | Optional<DomTreeUpdater> DTU; | ||||||||
98 | if (auto *DTWP
| ||||||||
99 | DTU.emplace(DTWP->getDomTree(), DomTreeUpdater::UpdateStrategy::Lazy); | ||||||||
100 | |||||||||
101 | SmallVector<IndirectBrInst *, 1> IndirectBrs; | ||||||||
102 | |||||||||
103 | // Set of all potential successors for indirectbr instructions. | ||||||||
104 | SmallPtrSet<BasicBlock *, 4> IndirectBrSuccs; | ||||||||
105 | |||||||||
106 | // Build a list of indirectbrs that we want to rewrite. | ||||||||
107 | for (BasicBlock &BB : F) | ||||||||
108 | if (auto *IBr = dyn_cast<IndirectBrInst>(BB.getTerminator())) { | ||||||||
109 | // Handle the degenerate case of no successors by replacing the indirectbr | ||||||||
110 | // with unreachable as there is no successor available. | ||||||||
111 | if (IBr->getNumSuccessors() == 0) { | ||||||||
112 | (void)new UnreachableInst(F.getContext(), IBr); | ||||||||
113 | IBr->eraseFromParent(); | ||||||||
114 | continue; | ||||||||
115 | } | ||||||||
116 | |||||||||
117 | IndirectBrs.push_back(IBr); | ||||||||
118 | for (BasicBlock *SuccBB : IBr->successors()) | ||||||||
119 | IndirectBrSuccs.insert(SuccBB); | ||||||||
120 | } | ||||||||
121 | |||||||||
122 | if (IndirectBrs.empty()) | ||||||||
123 | return false; | ||||||||
124 | |||||||||
125 | // If we need to replace any indirectbrs we need to establish integer | ||||||||
126 | // constants that will correspond to each of the basic blocks in the function | ||||||||
127 | // whose address escapes. We do that here and rewrite all the blockaddress | ||||||||
128 | // constants to just be those integer constants cast to a pointer type. | ||||||||
129 | SmallVector<BasicBlock *, 4> BBs; | ||||||||
130 | |||||||||
131 | for (BasicBlock &BB : F) { | ||||||||
132 | // Skip blocks that aren't successors to an indirectbr we're going to | ||||||||
133 | // rewrite. | ||||||||
134 | if (!IndirectBrSuccs.count(&BB)) | ||||||||
135 | continue; | ||||||||
136 | |||||||||
137 | auto IsBlockAddressUse = [&](const Use &U) { | ||||||||
138 | return isa<BlockAddress>(U.getUser()); | ||||||||
139 | }; | ||||||||
140 | auto BlockAddressUseIt = llvm::find_if(BB.uses(), IsBlockAddressUse); | ||||||||
141 | if (BlockAddressUseIt == BB.use_end()) | ||||||||
142 | continue; | ||||||||
143 | |||||||||
144 | assert(std::find_if(std::next(BlockAddressUseIt), BB.use_end(),(static_cast <bool> (std::find_if(std::next(BlockAddressUseIt ), BB.use_end(), IsBlockAddressUse) == BB.use_end() && "There should only ever be a single blockaddress use because it is " "a constant and should be uniqued.") ? void (0) : __assert_fail ("std::find_if(std::next(BlockAddressUseIt), BB.use_end(), IsBlockAddressUse) == BB.use_end() && \"There should only ever be a single blockaddress use because it is \" \"a constant and should be uniqued.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/CodeGen/IndirectBrExpandPass.cpp" , 147, __extension__ __PRETTY_FUNCTION__)) | ||||||||
145 | IsBlockAddressUse) == BB.use_end() &&(static_cast <bool> (std::find_if(std::next(BlockAddressUseIt ), BB.use_end(), IsBlockAddressUse) == BB.use_end() && "There should only ever be a single blockaddress use because it is " "a constant and should be uniqued.") ? void (0) : __assert_fail ("std::find_if(std::next(BlockAddressUseIt), BB.use_end(), IsBlockAddressUse) == BB.use_end() && \"There should only ever be a single blockaddress use because it is \" \"a constant and should be uniqued.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/CodeGen/IndirectBrExpandPass.cpp" , 147, __extension__ __PRETTY_FUNCTION__)) | ||||||||
146 | "There should only ever be a single blockaddress use because it is "(static_cast <bool> (std::find_if(std::next(BlockAddressUseIt ), BB.use_end(), IsBlockAddressUse) == BB.use_end() && "There should only ever be a single blockaddress use because it is " "a constant and should be uniqued.") ? void (0) : __assert_fail ("std::find_if(std::next(BlockAddressUseIt), BB.use_end(), IsBlockAddressUse) == BB.use_end() && \"There should only ever be a single blockaddress use because it is \" \"a constant and should be uniqued.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/CodeGen/IndirectBrExpandPass.cpp" , 147, __extension__ __PRETTY_FUNCTION__)) | ||||||||
147 | "a constant and should be uniqued.")(static_cast <bool> (std::find_if(std::next(BlockAddressUseIt ), BB.use_end(), IsBlockAddressUse) == BB.use_end() && "There should only ever be a single blockaddress use because it is " "a constant and should be uniqued.") ? void (0) : __assert_fail ("std::find_if(std::next(BlockAddressUseIt), BB.use_end(), IsBlockAddressUse) == BB.use_end() && \"There should only ever be a single blockaddress use because it is \" \"a constant and should be uniqued.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/CodeGen/IndirectBrExpandPass.cpp" , 147, __extension__ __PRETTY_FUNCTION__)); | ||||||||
148 | |||||||||
149 | auto *BA = cast<BlockAddress>(BlockAddressUseIt->getUser()); | ||||||||
150 | |||||||||
151 | // Skip if the constant was formed but ended up not being used (due to DCE | ||||||||
152 | // or whatever). | ||||||||
153 | if (!BA->isConstantUsed()) | ||||||||
154 | continue; | ||||||||
155 | |||||||||
156 | // Compute the index we want to use for this basic block. We can't use zero | ||||||||
157 | // because null can be compared with block addresses. | ||||||||
158 | int BBIndex = BBs.size() + 1; | ||||||||
159 | BBs.push_back(&BB); | ||||||||
160 | |||||||||
161 | auto *ITy = cast<IntegerType>(DL.getIntPtrType(BA->getType())); | ||||||||
162 | ConstantInt *BBIndexC = ConstantInt::get(ITy, BBIndex); | ||||||||
163 | |||||||||
164 | // Now rewrite the blockaddress to an integer constant based on the index. | ||||||||
165 | // FIXME: This part doesn't properly recognize other uses of blockaddress | ||||||||
166 | // expressions, for instance, where they are used to pass labels to | ||||||||
167 | // asm-goto. This part of the pass needs a rework. | ||||||||
168 | BA->replaceAllUsesWith(ConstantExpr::getIntToPtr(BBIndexC, BA->getType())); | ||||||||
169 | } | ||||||||
170 | |||||||||
171 | if (BBs.empty()) { | ||||||||
172 | // There are no blocks whose address is taken, so any indirectbr instruction | ||||||||
173 | // cannot get a valid input and we can replace all of them with unreachable. | ||||||||
174 | SmallVector<DominatorTree::UpdateType, 8> Updates; | ||||||||
175 | if (DTU) | ||||||||
176 | Updates.reserve(IndirectBrSuccs.size()); | ||||||||
177 | for (auto *IBr : IndirectBrs) { | ||||||||
178 | if (DTU) { | ||||||||
179 | for (BasicBlock *SuccBB : IBr->successors()) | ||||||||
180 | Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); | ||||||||
181 | } | ||||||||
182 | (void)new UnreachableInst(F.getContext(), IBr); | ||||||||
183 | IBr->eraseFromParent(); | ||||||||
184 | } | ||||||||
185 | if (DTU) { | ||||||||
186 | assert(Updates.size() == IndirectBrSuccs.size() &&(static_cast <bool> (Updates.size() == IndirectBrSuccs. size() && "Got unexpected update count.") ? void (0) : __assert_fail ("Updates.size() == IndirectBrSuccs.size() && \"Got unexpected update count.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/CodeGen/IndirectBrExpandPass.cpp" , 187, __extension__ __PRETTY_FUNCTION__)) | ||||||||
187 | "Got unexpected update count.")(static_cast <bool> (Updates.size() == IndirectBrSuccs. size() && "Got unexpected update count.") ? void (0) : __assert_fail ("Updates.size() == IndirectBrSuccs.size() && \"Got unexpected update count.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/CodeGen/IndirectBrExpandPass.cpp" , 187, __extension__ __PRETTY_FUNCTION__)); | ||||||||
188 | DTU->applyUpdates(Updates); | ||||||||
189 | } | ||||||||
190 | return true; | ||||||||
191 | } | ||||||||
192 | |||||||||
193 | BasicBlock *SwitchBB; | ||||||||
194 | Value *SwitchValue; | ||||||||
195 | |||||||||
196 | // Compute a common integer type across all the indirectbr instructions. | ||||||||
197 | IntegerType *CommonITy = nullptr; | ||||||||
198 | for (auto *IBr : IndirectBrs) { | ||||||||
199 | auto *ITy = | ||||||||
200 | cast<IntegerType>(DL.getIntPtrType(IBr->getAddress()->getType())); | ||||||||
201 | if (!CommonITy || ITy->getBitWidth() > CommonITy->getBitWidth()) | ||||||||
202 | CommonITy = ITy; | ||||||||
203 | } | ||||||||
204 | |||||||||
205 | auto GetSwitchValue = [DL, CommonITy](IndirectBrInst *IBr) { | ||||||||
206 | return CastInst::CreatePointerCast( | ||||||||
207 | IBr->getAddress(), CommonITy, | ||||||||
208 | Twine(IBr->getAddress()->getName()) + ".switch_cast", IBr); | ||||||||
209 | }; | ||||||||
210 | |||||||||
211 | SmallVector<DominatorTree::UpdateType, 8> Updates; | ||||||||
212 | |||||||||
213 | if (IndirectBrs.size() == 1) { | ||||||||
214 | // If we only have one indirectbr, we can just directly replace it within | ||||||||
215 | // its block. | ||||||||
216 | IndirectBrInst *IBr = IndirectBrs[0]; | ||||||||
217 | SwitchBB = IBr->getParent(); | ||||||||
218 | SwitchValue = GetSwitchValue(IBr); | ||||||||
219 | if (DTU) { | ||||||||
220 | Updates.reserve(IndirectBrSuccs.size()); | ||||||||
221 | for (BasicBlock *SuccBB : IBr->successors()) | ||||||||
222 | Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); | ||||||||
223 | assert(Updates.size() == IndirectBrSuccs.size() &&(static_cast <bool> (Updates.size() == IndirectBrSuccs. size() && "Got unexpected update count.") ? void (0) : __assert_fail ("Updates.size() == IndirectBrSuccs.size() && \"Got unexpected update count.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/CodeGen/IndirectBrExpandPass.cpp" , 224, __extension__ __PRETTY_FUNCTION__)) | ||||||||
224 | "Got unexpected update count.")(static_cast <bool> (Updates.size() == IndirectBrSuccs. size() && "Got unexpected update count.") ? void (0) : __assert_fail ("Updates.size() == IndirectBrSuccs.size() && \"Got unexpected update count.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/CodeGen/IndirectBrExpandPass.cpp" , 224, __extension__ __PRETTY_FUNCTION__)); | ||||||||
225 | } | ||||||||
226 | IBr->eraseFromParent(); | ||||||||
227 | } else { | ||||||||
228 | // Otherwise we need to create a new block to hold the switch across BBs, | ||||||||
229 | // jump to that block instead of each indirectbr, and phi together the | ||||||||
230 | // values for the switch. | ||||||||
231 | SwitchBB = BasicBlock::Create(F.getContext(), "switch_bb", &F); | ||||||||
232 | auto *SwitchPN = PHINode::Create(CommonITy, IndirectBrs.size(), | ||||||||
233 | "switch_value_phi", SwitchBB); | ||||||||
234 | SwitchValue = SwitchPN; | ||||||||
235 | |||||||||
236 | // Now replace the indirectbr instructions with direct branches to the | ||||||||
237 | // switch block and fill out the PHI operands. | ||||||||
238 | if (DTU) | ||||||||
239 | Updates.reserve(IndirectBrs.size() + 2 * IndirectBrSuccs.size()); | ||||||||
240 | for (auto *IBr : IndirectBrs) { | ||||||||
241 | SwitchPN->addIncoming(GetSwitchValue(IBr), IBr->getParent()); | ||||||||
242 | BranchInst::Create(SwitchBB, IBr); | ||||||||
243 | if (DTU) { | ||||||||
244 | Updates.push_back({DominatorTree::Insert, IBr->getParent(), SwitchBB}); | ||||||||
245 | for (BasicBlock *SuccBB : IBr->successors()) | ||||||||
246 | Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB}); | ||||||||
247 | } | ||||||||
248 | IBr->eraseFromParent(); | ||||||||
249 | } | ||||||||
250 | } | ||||||||
251 | |||||||||
252 | // Now build the switch in the block. The block will have no terminator | ||||||||
253 | // already. | ||||||||
254 | auto *SI = SwitchInst::Create(SwitchValue, BBs[0], BBs.size(), SwitchBB); | ||||||||
255 | |||||||||
256 | // Add a case for each block. | ||||||||
257 | for (int i : llvm::seq<int>(1, BBs.size())) | ||||||||
258 | SI->addCase(ConstantInt::get(CommonITy, i + 1), BBs[i]); | ||||||||
259 | |||||||||
260 | if (DTU) { | ||||||||
261 | // If there were multiple indirectbr's, they may have common successors, | ||||||||
262 | // but in the dominator tree, we only track unique edges. | ||||||||
263 | SmallPtrSet<BasicBlock *, 8> UniqueSuccessors(BBs.begin(), BBs.end()); | ||||||||
264 | Updates.reserve(Updates.size() + UniqueSuccessors.size()); | ||||||||
265 | for (BasicBlock *BB : UniqueSuccessors) | ||||||||
266 | Updates.push_back({DominatorTree::Insert, SwitchBB, BB}); | ||||||||
267 | DTU->applyUpdates(Updates); | ||||||||
268 | } | ||||||||
269 | |||||||||
270 | return true; | ||||||||
271 | } |
1 | //===- llvm/PassAnalysisSupport.h - Analysis Pass Support code --*- C++ -*-===// |
2 | // |
3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
4 | // See https://llvm.org/LICENSE.txt for license information. |
5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
6 | // |
7 | //===----------------------------------------------------------------------===// |
8 | // |
9 | // This file defines stuff that is used to define and "use" Analysis Passes. |
10 | // This file is automatically #included by Pass.h, so: |
11 | // |
12 | // NO .CPP FILES SHOULD INCLUDE THIS FILE DIRECTLY |
13 | // |
14 | // Instead, #include Pass.h |
15 | // |
16 | //===----------------------------------------------------------------------===// |
17 | |
18 | #if !defined(LLVM_PASS_H) || defined(LLVM_PASSANALYSISSUPPORT_H) |
19 | #error "Do not include <PassAnalysisSupport.h>; include <Pass.h> instead" |
20 | #endif |
21 | |
22 | #ifndef LLVM_PASSANALYSISSUPPORT_H |
23 | #define LLVM_PASSANALYSISSUPPORT_H |
24 | |
25 | #include "llvm/ADT/STLExtras.h" |
26 | #include "llvm/ADT/SmallVector.h" |
27 | #include <cassert> |
28 | #include <tuple> |
29 | #include <utility> |
30 | #include <vector> |
31 | |
32 | namespace llvm { |
33 | |
34 | class Function; |
35 | class Pass; |
36 | class PMDataManager; |
37 | class StringRef; |
38 | |
39 | //===----------------------------------------------------------------------===// |
40 | /// Represent the analysis usage information of a pass. This tracks analyses |
41 | /// that the pass REQUIRES (must be available when the pass runs), REQUIRES |
42 | /// TRANSITIVE (must be available throughout the lifetime of the pass), and |
43 | /// analyses that the pass PRESERVES (the pass does not invalidate the results |
44 | /// of these analyses). This information is provided by a pass to the Pass |
45 | /// infrastructure through the getAnalysisUsage virtual function. |
46 | /// |
47 | class AnalysisUsage { |
48 | public: |
49 | using VectorType = SmallVectorImpl<AnalysisID>; |
50 | |
51 | private: |
52 | /// Sets of analyses required and preserved by a pass |
53 | // TODO: It's not clear that SmallVector is an appropriate data structure for |
54 | // this usecase. The sizes were picked to minimize wasted space, but are |
55 | // otherwise fairly meaningless. |
56 | SmallVector<AnalysisID, 8> Required; |
57 | SmallVector<AnalysisID, 2> RequiredTransitive; |
58 | SmallVector<AnalysisID, 2> Preserved; |
59 | SmallVector<AnalysisID, 0> Used; |
60 | bool PreservesAll = false; |
61 | |
62 | void pushUnique(VectorType &Set, AnalysisID ID) { |
63 | if (!llvm::is_contained(Set, ID)) |
64 | Set.push_back(ID); |
65 | } |
66 | |
67 | public: |
68 | AnalysisUsage() = default; |
69 | |
70 | ///@{ |
71 | /// Add the specified ID to the required set of the usage info for a pass. |
72 | AnalysisUsage &addRequiredID(const void *ID); |
73 | AnalysisUsage &addRequiredID(char &ID); |
74 | template<class PassClass> |
75 | AnalysisUsage &addRequired() { |
76 | return addRequiredID(PassClass::ID); |
77 | } |
78 | |
79 | AnalysisUsage &addRequiredTransitiveID(char &ID); |
80 | template<class PassClass> |
81 | AnalysisUsage &addRequiredTransitive() { |
82 | return addRequiredTransitiveID(PassClass::ID); |
83 | } |
84 | ///@} |
85 | |
86 | ///@{ |
87 | /// Add the specified ID to the set of analyses preserved by this pass. |
88 | AnalysisUsage &addPreservedID(const void *ID) { |
89 | pushUnique(Preserved, ID); |
90 | return *this; |
91 | } |
92 | AnalysisUsage &addPreservedID(char &ID) { |
93 | pushUnique(Preserved, &ID); |
94 | return *this; |
95 | } |
96 | /// Add the specified Pass class to the set of analyses preserved by this pass. |
97 | template<class PassClass> |
98 | AnalysisUsage &addPreserved() { |
99 | pushUnique(Preserved, &PassClass::ID); |
100 | return *this; |
101 | } |
102 | ///@} |
103 | |
104 | ///@{ |
105 | /// Add the specified ID to the set of analyses used by this pass if they are |
106 | /// available.. |
107 | AnalysisUsage &addUsedIfAvailableID(const void *ID) { |
108 | pushUnique(Used, ID); |
109 | return *this; |
110 | } |
111 | AnalysisUsage &addUsedIfAvailableID(char &ID) { |
112 | pushUnique(Used, &ID); |
113 | return *this; |
114 | } |
115 | /// Add the specified Pass class to the set of analyses used by this pass. |
116 | template<class PassClass> |
117 | AnalysisUsage &addUsedIfAvailable() { |
118 | pushUnique(Used, &PassClass::ID); |
119 | return *this; |
120 | } |
121 | ///@} |
122 | |
123 | /// Add the Pass with the specified argument string to the set of analyses |
124 | /// preserved by this pass. If no such Pass exists, do nothing. This can be |
125 | /// useful when a pass is trivially preserved, but may not be linked in. Be |
126 | /// careful about spelling! |
127 | AnalysisUsage &addPreserved(StringRef Arg); |
128 | |
129 | /// Set by analyses that do not transform their input at all |
130 | void setPreservesAll() { PreservesAll = true; } |
131 | |
132 | /// Determine whether a pass said it does not transform its input at all |
133 | bool getPreservesAll() const { return PreservesAll; } |
134 | |
135 | /// This function should be called by the pass, iff they do not: |
136 | /// |
137 | /// 1. Add or remove basic blocks from the function |
138 | /// 2. Modify terminator instructions in any way. |
139 | /// |
140 | /// This function annotates the AnalysisUsage info object to say that analyses |
141 | /// that only depend on the CFG are preserved by this pass. |
142 | void setPreservesCFG(); |
143 | |
144 | const VectorType &getRequiredSet() const { return Required; } |
145 | const VectorType &getRequiredTransitiveSet() const { |
146 | return RequiredTransitive; |
147 | } |
148 | const VectorType &getPreservedSet() const { return Preserved; } |
149 | const VectorType &getUsedSet() const { return Used; } |
150 | }; |
151 | |
152 | //===----------------------------------------------------------------------===// |
153 | /// AnalysisResolver - Simple interface used by Pass objects to pull all |
154 | /// analysis information out of pass manager that is responsible to manage |
155 | /// the pass. |
156 | /// |
157 | class AnalysisResolver { |
158 | public: |
159 | AnalysisResolver() = delete; |
160 | explicit AnalysisResolver(PMDataManager &P) : PM(P) {} |
161 | |
162 | PMDataManager &getPMDataManager() { return PM; } |
163 | |
164 | /// Find pass that is implementing PI. |
165 | Pass *findImplPass(AnalysisID PI) { |
166 | Pass *ResultPass = nullptr; |
167 | for (const auto &AnalysisImpl : AnalysisImpls) { |
168 | if (AnalysisImpl.first == PI) { |
169 | ResultPass = AnalysisImpl.second; |
170 | break; |
171 | } |
172 | } |
173 | return ResultPass; |
174 | } |
175 | |
176 | /// Find pass that is implementing PI. Initialize pass for Function F. |
177 | std::tuple<Pass *, bool> findImplPass(Pass *P, AnalysisID PI, Function &F); |
178 | |
179 | void addAnalysisImplsPair(AnalysisID PI, Pass *P) { |
180 | if (findImplPass(PI) == P) |
181 | return; |
182 | std::pair<AnalysisID, Pass*> pir = std::make_pair(PI,P); |
183 | AnalysisImpls.push_back(pir); |
184 | } |
185 | |
186 | /// Clear cache that is used to connect a pass to the analysis (PassInfo). |
187 | void clearAnalysisImpls() { |
188 | AnalysisImpls.clear(); |
189 | } |
190 | |
191 | /// Return analysis result or null if it doesn't exist. |
192 | Pass *getAnalysisIfAvailable(AnalysisID ID) const; |
193 | |
194 | private: |
195 | /// This keeps track of which passes implements the interfaces that are |
196 | /// required by the current pass (to implement getAnalysis()). |
197 | std::vector<std::pair<AnalysisID, Pass *>> AnalysisImpls; |
198 | |
199 | /// PassManager that is used to resolve analysis info |
200 | PMDataManager &PM; |
201 | }; |
202 | |
203 | /// getAnalysisIfAvailable<AnalysisType>() - Subclasses use this function to |
204 | /// get analysis information that might be around, for example to update it. |
205 | /// This is different than getAnalysis in that it can fail (if the analysis |
206 | /// results haven't been computed), so should only be used if you can handle |
207 | /// the case when the analysis is not available. This method is often used by |
208 | /// transformation APIs to update analysis results for a pass automatically as |
209 | /// the transform is performed. |
210 | template<typename AnalysisType> |
211 | AnalysisType *Pass::getAnalysisIfAvailable() const { |
212 | assert(Resolver && "Pass not resident in a PassManager object!")(static_cast <bool> (Resolver && "Pass not resident in a PassManager object!" ) ? void (0) : __assert_fail ("Resolver && \"Pass not resident in a PassManager object!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/PassAnalysisSupport.h" , 212, __extension__ __PRETTY_FUNCTION__)); |
213 | |
214 | const void *PI = &AnalysisType::ID; |
215 | |
216 | Pass *ResultPass = Resolver->getAnalysisIfAvailable(PI); |
217 | if (!ResultPass) return nullptr; |
218 | |
219 | // Because the AnalysisType may not be a subclass of pass (for |
220 | // AnalysisGroups), we use getAdjustedAnalysisPointer here to potentially |
221 | // adjust the return pointer (because the class may multiply inherit, once |
222 | // from pass, once from AnalysisType). |
223 | return (AnalysisType*)ResultPass->getAdjustedAnalysisPointer(PI); |
224 | } |
225 | |
226 | /// getAnalysis<AnalysisType>() - This function is used by subclasses to get |
227 | /// to the analysis information that they claim to use by overriding the |
228 | /// getAnalysisUsage function. |
229 | template<typename AnalysisType> |
230 | AnalysisType &Pass::getAnalysis() const { |
231 | assert(Resolver && "Pass has not been inserted into a PassManager object!")(static_cast <bool> (Resolver && "Pass has not been inserted into a PassManager object!" ) ? void (0) : __assert_fail ("Resolver && \"Pass has not been inserted into a PassManager object!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/PassAnalysisSupport.h" , 231, __extension__ __PRETTY_FUNCTION__)); |
232 | return getAnalysisID<AnalysisType>(&AnalysisType::ID); |
233 | } |
234 | |
235 | template<typename AnalysisType> |
236 | AnalysisType &Pass::getAnalysisID(AnalysisID PI) const { |
237 | assert(PI && "getAnalysis for unregistered pass!")(static_cast <bool> (PI && "getAnalysis for unregistered pass!" ) ? void (0) : __assert_fail ("PI && \"getAnalysis for unregistered pass!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/PassAnalysisSupport.h" , 237, __extension__ __PRETTY_FUNCTION__)); |
238 | assert(Resolver&&"Pass has not been inserted into a PassManager object!")(static_cast <bool> (Resolver&&"Pass has not been inserted into a PassManager object!" ) ? void (0) : __assert_fail ("Resolver&&\"Pass has not been inserted into a PassManager object!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/PassAnalysisSupport.h" , 238, __extension__ __PRETTY_FUNCTION__)); |
239 | // PI *must* appear in AnalysisImpls. Because the number of passes used |
240 | // should be a small number, we just do a linear search over a (dense) |
241 | // vector. |
242 | Pass *ResultPass = Resolver->findImplPass(PI); |
243 | assert(ResultPass &&(static_cast <bool> (ResultPass && "getAnalysis*() called on an analysis that was not " "'required' by pass!") ? void (0) : __assert_fail ("ResultPass && \"getAnalysis*() called on an analysis that was not \" \"'required' by pass!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/PassAnalysisSupport.h" , 245, __extension__ __PRETTY_FUNCTION__)) |
244 | "getAnalysis*() called on an analysis that was not "(static_cast <bool> (ResultPass && "getAnalysis*() called on an analysis that was not " "'required' by pass!") ? void (0) : __assert_fail ("ResultPass && \"getAnalysis*() called on an analysis that was not \" \"'required' by pass!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/PassAnalysisSupport.h" , 245, __extension__ __PRETTY_FUNCTION__)) |
245 | "'required' by pass!")(static_cast <bool> (ResultPass && "getAnalysis*() called on an analysis that was not " "'required' by pass!") ? void (0) : __assert_fail ("ResultPass && \"getAnalysis*() called on an analysis that was not \" \"'required' by pass!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/PassAnalysisSupport.h" , 245, __extension__ __PRETTY_FUNCTION__)); |
246 | |
247 | // Because the AnalysisType may not be a subclass of pass (for |
248 | // AnalysisGroups), we use getAdjustedAnalysisPointer here to potentially |
249 | // adjust the return pointer (because the class may multiply inherit, once |
250 | // from pass, once from AnalysisType). |
251 | return *(AnalysisType*)ResultPass->getAdjustedAnalysisPointer(PI); |
252 | } |
253 | |
254 | /// getAnalysis<AnalysisType>() - This function is used by subclasses to get |
255 | /// to the analysis information that they claim to use by overriding the |
256 | /// getAnalysisUsage function. If as part of the dependencies, an IR |
257 | /// transformation is triggered (e.g. because the analysis requires |
258 | /// BreakCriticalEdges), and Changed is non null, *Changed is updated. |
259 | template <typename AnalysisType> |
260 | AnalysisType &Pass::getAnalysis(Function &F, bool *Changed) { |
261 | assert(Resolver &&"Pass has not been inserted into a PassManager object!")(static_cast <bool> (Resolver &&"Pass has not been inserted into a PassManager object!" ) ? void (0) : __assert_fail ("Resolver &&\"Pass has not been inserted into a PassManager object!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/PassAnalysisSupport.h" , 261, __extension__ __PRETTY_FUNCTION__)); |
262 | |
263 | return getAnalysisID<AnalysisType>(&AnalysisType::ID, F, Changed); |
264 | } |
265 | |
266 | template <typename AnalysisType> |
267 | AnalysisType &Pass::getAnalysisID(AnalysisID PI, Function &F, bool *Changed) { |
268 | assert(PI && "getAnalysis for unregistered pass!")(static_cast <bool> (PI && "getAnalysis for unregistered pass!" ) ? void (0) : __assert_fail ("PI && \"getAnalysis for unregistered pass!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/PassAnalysisSupport.h" , 268, __extension__ __PRETTY_FUNCTION__)); |
269 | assert(Resolver && "Pass has not been inserted into a PassManager object!")(static_cast <bool> (Resolver && "Pass has not been inserted into a PassManager object!" ) ? void (0) : __assert_fail ("Resolver && \"Pass has not been inserted into a PassManager object!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/PassAnalysisSupport.h" , 269, __extension__ __PRETTY_FUNCTION__)); |
270 | // PI *must* appear in AnalysisImpls. Because the number of passes used |
271 | // should be a small number, we just do a linear search over a (dense) |
272 | // vector. |
273 | Pass *ResultPass; |
274 | bool LocalChanged; |
275 | std::tie(ResultPass, LocalChanged) = Resolver->findImplPass(this, PI, F); |
276 | |
277 | assert(ResultPass && "Unable to find requested analysis info")(static_cast <bool> (ResultPass && "Unable to find requested analysis info" ) ? void (0) : __assert_fail ("ResultPass && \"Unable to find requested analysis info\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/PassAnalysisSupport.h" , 277, __extension__ __PRETTY_FUNCTION__)); |
278 | if (Changed) |
279 | *Changed |= LocalChanged; |
280 | else |
281 | assert(!LocalChanged &&(static_cast <bool> (!LocalChanged && "A pass trigged a code update but the update status is lost" ) ? void (0) : __assert_fail ("!LocalChanged && \"A pass trigged a code update but the update status is lost\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/PassAnalysisSupport.h" , 282, __extension__ __PRETTY_FUNCTION__)) |
282 | "A pass trigged a code update but the update status is lost")(static_cast <bool> (!LocalChanged && "A pass trigged a code update but the update status is lost" ) ? void (0) : __assert_fail ("!LocalChanged && \"A pass trigged a code update but the update status is lost\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/PassAnalysisSupport.h" , 282, __extension__ __PRETTY_FUNCTION__)); |
283 | |
284 | // Because the AnalysisType may not be a subclass of pass (for |
285 | // AnalysisGroups), we use getAdjustedAnalysisPointer here to potentially |
286 | // adjust the return pointer (because the class may multiply inherit, once |
287 | // from pass, once from AnalysisType). |
288 | return *(AnalysisType*)ResultPass->getAdjustedAnalysisPointer(PI); |
289 | } |
290 | |
291 | } // end namespace llvm |
292 | |
293 | #endif // LLVM_PASSANALYSISSUPPORT_H |
1 | //===- llvm/ADT/SmallVector.h - 'Normally small' vectors --------*- C++ -*-===// |
2 | // |
3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
4 | // See https://llvm.org/LICENSE.txt for license information. |
5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
6 | // |
7 | //===----------------------------------------------------------------------===// |
8 | // |
9 | // This file defines the SmallVector class. |
10 | // |
11 | //===----------------------------------------------------------------------===// |
12 | |
13 | #ifndef LLVM_ADT_SMALLVECTOR_H |
14 | #define LLVM_ADT_SMALLVECTOR_H |
15 | |
16 | #include "llvm/ADT/iterator_range.h" |
17 | #include "llvm/Support/Compiler.h" |
18 | #include "llvm/Support/ErrorHandling.h" |
19 | #include "llvm/Support/MemAlloc.h" |
20 | #include "llvm/Support/type_traits.h" |
21 | #include <algorithm> |
22 | #include <cassert> |
23 | #include <cstddef> |
24 | #include <cstdlib> |
25 | #include <cstring> |
26 | #include <functional> |
27 | #include <initializer_list> |
28 | #include <iterator> |
29 | #include <limits> |
30 | #include <memory> |
31 | #include <new> |
32 | #include <type_traits> |
33 | #include <utility> |
34 | |
35 | namespace llvm { |
36 | |
37 | /// This is all the stuff common to all SmallVectors. |
38 | /// |
39 | /// The template parameter specifies the type which should be used to hold the |
40 | /// Size and Capacity of the SmallVector, so it can be adjusted. |
41 | /// Using 32 bit size is desirable to shrink the size of the SmallVector. |
42 | /// Using 64 bit size is desirable for cases like SmallVector<char>, where a |
43 | /// 32 bit size would limit the vector to ~4GB. SmallVectors are used for |
44 | /// buffering bitcode output - which can exceed 4GB. |
45 | template <class Size_T> class SmallVectorBase { |
46 | protected: |
47 | void *BeginX; |
48 | Size_T Size = 0, Capacity; |
49 | |
50 | /// The maximum value of the Size_T used. |
51 | static constexpr size_t SizeTypeMax() { |
52 | return std::numeric_limits<Size_T>::max(); |
53 | } |
54 | |
55 | SmallVectorBase() = delete; |
56 | SmallVectorBase(void *FirstEl, size_t TotalCapacity) |
57 | : BeginX(FirstEl), Capacity(TotalCapacity) {} |
58 | |
59 | /// This is a helper for \a grow() that's out of line to reduce code |
60 | /// duplication. This function will report a fatal error if it can't grow at |
61 | /// least to \p MinSize. |
62 | void *mallocForGrow(size_t MinSize, size_t TSize, size_t &NewCapacity); |
63 | |
64 | /// This is an implementation of the grow() method which only works |
65 | /// on POD-like data types and is out of line to reduce code duplication. |
66 | /// This function will report a fatal error if it cannot increase capacity. |
67 | void grow_pod(void *FirstEl, size_t MinSize, size_t TSize); |
68 | |
69 | public: |
70 | size_t size() const { return Size; } |
71 | size_t capacity() const { return Capacity; } |
72 | |
73 | LLVM_NODISCARD[[clang::warn_unused_result]] bool empty() const { return !Size; } |
74 | |
75 | /// Set the array size to \p N, which the current array must have enough |
76 | /// capacity for. |
77 | /// |
78 | /// This does not construct or destroy any elements in the vector. |
79 | /// |
80 | /// Clients can use this in conjunction with capacity() to write past the end |
81 | /// of the buffer when they know that more elements are available, and only |
82 | /// update the size later. This avoids the cost of value initializing elements |
83 | /// which will only be overwritten. |
84 | void set_size(size_t N) { |
85 | assert(N <= capacity())(static_cast <bool> (N <= capacity()) ? void (0) : __assert_fail ("N <= capacity()", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 85, __extension__ __PRETTY_FUNCTION__)); |
86 | Size = N; |
87 | } |
88 | }; |
89 | |
90 | template <class T> |
91 | using SmallVectorSizeType = |
92 | typename std::conditional<sizeof(T) < 4 && sizeof(void *) >= 8, uint64_t, |
93 | uint32_t>::type; |
94 | |
95 | /// Figure out the offset of the first element. |
96 | template <class T, typename = void> struct SmallVectorAlignmentAndSize { |
97 | alignas(SmallVectorBase<SmallVectorSizeType<T>>) char Base[sizeof( |
98 | SmallVectorBase<SmallVectorSizeType<T>>)]; |
99 | alignas(T) char FirstEl[sizeof(T)]; |
100 | }; |
101 | |
102 | /// This is the part of SmallVectorTemplateBase which does not depend on whether |
103 | /// the type T is a POD. The extra dummy template argument is used by ArrayRef |
104 | /// to avoid unnecessarily requiring T to be complete. |
105 | template <typename T, typename = void> |
106 | class SmallVectorTemplateCommon |
107 | : public SmallVectorBase<SmallVectorSizeType<T>> { |
108 | using Base = SmallVectorBase<SmallVectorSizeType<T>>; |
109 | |
110 | /// Find the address of the first element. For this pointer math to be valid |
111 | /// with small-size of 0 for T with lots of alignment, it's important that |
112 | /// SmallVectorStorage is properly-aligned even for small-size of 0. |
113 | void *getFirstEl() const { |
114 | return const_cast<void *>(reinterpret_cast<const void *>( |
115 | reinterpret_cast<const char *>(this) + |
116 | offsetof(SmallVectorAlignmentAndSize<T>, FirstEl)__builtin_offsetof(SmallVectorAlignmentAndSize<T>, FirstEl ))); |
117 | } |
118 | // Space after 'FirstEl' is clobbered, do not add any instance vars after it. |
119 | |
120 | protected: |
121 | SmallVectorTemplateCommon(size_t Size) : Base(getFirstEl(), Size) {} |
122 | |
123 | void grow_pod(size_t MinSize, size_t TSize) { |
124 | Base::grow_pod(getFirstEl(), MinSize, TSize); |
125 | } |
126 | |
127 | /// Return true if this is a smallvector which has not had dynamic |
128 | /// memory allocated for it. |
129 | bool isSmall() const { return this->BeginX == getFirstEl(); } |
130 | |
131 | /// Put this vector in a state of being small. |
132 | void resetToSmall() { |
133 | this->BeginX = getFirstEl(); |
134 | this->Size = this->Capacity = 0; // FIXME: Setting Capacity to 0 is suspect. |
135 | } |
136 | |
137 | /// Return true if V is an internal reference to the given range. |
138 | bool isReferenceToRange(const void *V, const void *First, const void *Last) const { |
139 | // Use std::less to avoid UB. |
140 | std::less<> LessThan; |
141 | return !LessThan(V, First) && LessThan(V, Last); |
142 | } |
143 | |
144 | /// Return true if V is an internal reference to this vector. |
145 | bool isReferenceToStorage(const void *V) const { |
146 | return isReferenceToRange(V, this->begin(), this->end()); |
147 | } |
148 | |
149 | /// Return true if First and Last form a valid (possibly empty) range in this |
150 | /// vector's storage. |
151 | bool isRangeInStorage(const void *First, const void *Last) const { |
152 | // Use std::less to avoid UB. |
153 | std::less<> LessThan; |
154 | return !LessThan(First, this->begin()) && !LessThan(Last, First) && |
155 | !LessThan(this->end(), Last); |
156 | } |
157 | |
158 | /// Return true unless Elt will be invalidated by resizing the vector to |
159 | /// NewSize. |
160 | bool isSafeToReferenceAfterResize(const void *Elt, size_t NewSize) { |
161 | // Past the end. |
162 | if (LLVM_LIKELY(!isReferenceToStorage(Elt))__builtin_expect((bool)(!isReferenceToStorage(Elt)), true)) |
163 | return true; |
164 | |
165 | // Return false if Elt will be destroyed by shrinking. |
166 | if (NewSize <= this->size()) |
167 | return Elt < this->begin() + NewSize; |
168 | |
169 | // Return false if we need to grow. |
170 | return NewSize <= this->capacity(); |
171 | } |
172 | |
173 | /// Check whether Elt will be invalidated by resizing the vector to NewSize. |
174 | void assertSafeToReferenceAfterResize(const void *Elt, size_t NewSize) { |
175 | assert(isSafeToReferenceAfterResize(Elt, NewSize) &&(static_cast <bool> (isSafeToReferenceAfterResize(Elt, NewSize ) && "Attempting to reference an element of the vector in an operation " "that invalidates it") ? void (0) : __assert_fail ("isSafeToReferenceAfterResize(Elt, NewSize) && \"Attempting to reference an element of the vector in an operation \" \"that invalidates it\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 177, __extension__ __PRETTY_FUNCTION__)) |
176 | "Attempting to reference an element of the vector in an operation "(static_cast <bool> (isSafeToReferenceAfterResize(Elt, NewSize ) && "Attempting to reference an element of the vector in an operation " "that invalidates it") ? void (0) : __assert_fail ("isSafeToReferenceAfterResize(Elt, NewSize) && \"Attempting to reference an element of the vector in an operation \" \"that invalidates it\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 177, __extension__ __PRETTY_FUNCTION__)) |
177 | "that invalidates it")(static_cast <bool> (isSafeToReferenceAfterResize(Elt, NewSize ) && "Attempting to reference an element of the vector in an operation " "that invalidates it") ? void (0) : __assert_fail ("isSafeToReferenceAfterResize(Elt, NewSize) && \"Attempting to reference an element of the vector in an operation \" \"that invalidates it\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 177, __extension__ __PRETTY_FUNCTION__)); |
178 | } |
179 | |
180 | /// Check whether Elt will be invalidated by increasing the size of the |
181 | /// vector by N. |
182 | void assertSafeToAdd(const void *Elt, size_t N = 1) { |
183 | this->assertSafeToReferenceAfterResize(Elt, this->size() + N); |
184 | } |
185 | |
186 | /// Check whether any part of the range will be invalidated by clearing. |
187 | void assertSafeToReferenceAfterClear(const T *From, const T *To) { |
188 | if (From == To) |
189 | return; |
190 | this->assertSafeToReferenceAfterResize(From, 0); |
191 | this->assertSafeToReferenceAfterResize(To - 1, 0); |
192 | } |
193 | template < |
194 | class ItTy, |
195 | std::enable_if_t<!std::is_same<std::remove_const_t<ItTy>, T *>::value, |
196 | bool> = false> |
197 | void assertSafeToReferenceAfterClear(ItTy, ItTy) {} |
198 | |
199 | /// Check whether any part of the range will be invalidated by growing. |
200 | void assertSafeToAddRange(const T *From, const T *To) { |
201 | if (From == To) |
202 | return; |
203 | this->assertSafeToAdd(From, To - From); |
204 | this->assertSafeToAdd(To - 1, To - From); |
205 | } |
206 | template < |
207 | class ItTy, |
208 | std::enable_if_t<!std::is_same<std::remove_const_t<ItTy>, T *>::value, |
209 | bool> = false> |
210 | void assertSafeToAddRange(ItTy, ItTy) {} |
211 | |
212 | /// Reserve enough space to add one element, and return the updated element |
213 | /// pointer in case it was a reference to the storage. |
214 | template <class U> |
215 | static const T *reserveForParamAndGetAddressImpl(U *This, const T &Elt, |
216 | size_t N) { |
217 | size_t NewSize = This->size() + N; |
218 | if (LLVM_LIKELY(NewSize <= This->capacity())__builtin_expect((bool)(NewSize <= This->capacity()), true )) |
219 | return &Elt; |
220 | |
221 | bool ReferencesStorage = false; |
222 | int64_t Index = -1; |
223 | if (!U::TakesParamByValue) { |
224 | if (LLVM_UNLIKELY(This->isReferenceToStorage(&Elt))__builtin_expect((bool)(This->isReferenceToStorage(&Elt )), false)) { |
225 | ReferencesStorage = true; |
226 | Index = &Elt - This->begin(); |
227 | } |
228 | } |
229 | This->grow(NewSize); |
230 | return ReferencesStorage ? This->begin() + Index : &Elt; |
231 | } |
232 | |
233 | public: |
234 | using size_type = size_t; |
235 | using difference_type = ptrdiff_t; |
236 | using value_type = T; |
237 | using iterator = T *; |
238 | using const_iterator = const T *; |
239 | |
240 | using const_reverse_iterator = std::reverse_iterator<const_iterator>; |
241 | using reverse_iterator = std::reverse_iterator<iterator>; |
242 | |
243 | using reference = T &; |
244 | using const_reference = const T &; |
245 | using pointer = T *; |
246 | using const_pointer = const T *; |
247 | |
248 | using Base::capacity; |
249 | using Base::empty; |
250 | using Base::size; |
251 | |
252 | // forward iterator creation methods. |
253 | iterator begin() { return (iterator)this->BeginX; } |
254 | const_iterator begin() const { return (const_iterator)this->BeginX; } |
255 | iterator end() { return begin() + size(); } |
256 | const_iterator end() const { return begin() + size(); } |
257 | |
258 | // reverse iterator creation methods. |
259 | reverse_iterator rbegin() { return reverse_iterator(end()); } |
260 | const_reverse_iterator rbegin() const{ return const_reverse_iterator(end()); } |
261 | reverse_iterator rend() { return reverse_iterator(begin()); } |
262 | const_reverse_iterator rend() const { return const_reverse_iterator(begin());} |
263 | |
264 | size_type size_in_bytes() const { return size() * sizeof(T); } |
265 | size_type max_size() const { |
266 | return std::min(this->SizeTypeMax(), size_type(-1) / sizeof(T)); |
267 | } |
268 | |
269 | size_t capacity_in_bytes() const { return capacity() * sizeof(T); } |
270 | |
271 | /// Return a pointer to the vector's buffer, even if empty(). |
272 | pointer data() { return pointer(begin()); } |
273 | /// Return a pointer to the vector's buffer, even if empty(). |
274 | const_pointer data() const { return const_pointer(begin()); } |
275 | |
276 | reference operator[](size_type idx) { |
277 | assert(idx < size())(static_cast <bool> (idx < size()) ? void (0) : __assert_fail ("idx < size()", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 277, __extension__ __PRETTY_FUNCTION__)); |
278 | return begin()[idx]; |
279 | } |
280 | const_reference operator[](size_type idx) const { |
281 | assert(idx < size())(static_cast <bool> (idx < size()) ? void (0) : __assert_fail ("idx < size()", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 281, __extension__ __PRETTY_FUNCTION__)); |
282 | return begin()[idx]; |
283 | } |
284 | |
285 | reference front() { |
286 | assert(!empty())(static_cast <bool> (!empty()) ? void (0) : __assert_fail ("!empty()", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 286, __extension__ __PRETTY_FUNCTION__)); |
287 | return begin()[0]; |
288 | } |
289 | const_reference front() const { |
290 | assert(!empty())(static_cast <bool> (!empty()) ? void (0) : __assert_fail ("!empty()", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 290, __extension__ __PRETTY_FUNCTION__)); |
291 | return begin()[0]; |
292 | } |
293 | |
294 | reference back() { |
295 | assert(!empty())(static_cast <bool> (!empty()) ? void (0) : __assert_fail ("!empty()", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 295, __extension__ __PRETTY_FUNCTION__)); |
296 | return end()[-1]; |
297 | } |
298 | const_reference back() const { |
299 | assert(!empty())(static_cast <bool> (!empty()) ? void (0) : __assert_fail ("!empty()", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 299, __extension__ __PRETTY_FUNCTION__)); |
300 | return end()[-1]; |
301 | } |
302 | }; |
303 | |
304 | /// SmallVectorTemplateBase<TriviallyCopyable = false> - This is where we put |
305 | /// method implementations that are designed to work with non-trivial T's. |
306 | /// |
307 | /// We approximate is_trivially_copyable with trivial move/copy construction and |
308 | /// trivial destruction. While the standard doesn't specify that you're allowed |
309 | /// copy these types with memcpy, there is no way for the type to observe this. |
310 | /// This catches the important case of std::pair<POD, POD>, which is not |
311 | /// trivially assignable. |
312 | template <typename T, bool = (is_trivially_copy_constructible<T>::value) && |
313 | (is_trivially_move_constructible<T>::value) && |
314 | std::is_trivially_destructible<T>::value> |
315 | class SmallVectorTemplateBase : public SmallVectorTemplateCommon<T> { |
316 | friend class SmallVectorTemplateCommon<T>; |
317 | |
318 | protected: |
319 | static constexpr bool TakesParamByValue = false; |
320 | using ValueParamT = const T &; |
321 | |
322 | SmallVectorTemplateBase(size_t Size) : SmallVectorTemplateCommon<T>(Size) {} |
323 | |
324 | static void destroy_range(T *S, T *E) { |
325 | while (S != E) { |
326 | --E; |
327 | E->~T(); |
328 | } |
329 | } |
330 | |
331 | /// Move the range [I, E) into the uninitialized memory starting with "Dest", |
332 | /// constructing elements as needed. |
333 | template<typename It1, typename It2> |
334 | static void uninitialized_move(It1 I, It1 E, It2 Dest) { |
335 | std::uninitialized_copy(std::make_move_iterator(I), |
336 | std::make_move_iterator(E), Dest); |
337 | } |
338 | |
339 | /// Copy the range [I, E) onto the uninitialized memory starting with "Dest", |
340 | /// constructing elements as needed. |
341 | template<typename It1, typename It2> |
342 | static void uninitialized_copy(It1 I, It1 E, It2 Dest) { |
343 | std::uninitialized_copy(I, E, Dest); |
344 | } |
345 | |
346 | /// Grow the allocated memory (without initializing new elements), doubling |
347 | /// the size of the allocated memory. Guarantees space for at least one more |
348 | /// element, or MinSize more elements if specified. |
349 | void grow(size_t MinSize = 0); |
350 | |
351 | /// Create a new allocation big enough for \p MinSize and pass back its size |
352 | /// in \p NewCapacity. This is the first section of \a grow(). |
353 | T *mallocForGrow(size_t MinSize, size_t &NewCapacity) { |
354 | return static_cast<T *>( |
355 | SmallVectorBase<SmallVectorSizeType<T>>::mallocForGrow( |
356 | MinSize, sizeof(T), NewCapacity)); |
357 | } |
358 | |
359 | /// Move existing elements over to the new allocation \p NewElts, the middle |
360 | /// section of \a grow(). |
361 | void moveElementsForGrow(T *NewElts); |
362 | |
363 | /// Transfer ownership of the allocation, finishing up \a grow(). |
364 | void takeAllocationForGrow(T *NewElts, size_t NewCapacity); |
365 | |
366 | /// Reserve enough space to add one element, and return the updated element |
367 | /// pointer in case it was a reference to the storage. |
368 | const T *reserveForParamAndGetAddress(const T &Elt, size_t N = 1) { |
369 | return this->reserveForParamAndGetAddressImpl(this, Elt, N); |
370 | } |
371 | |
372 | /// Reserve enough space to add one element, and return the updated element |
373 | /// pointer in case it was a reference to the storage. |
374 | T *reserveForParamAndGetAddress(T &Elt, size_t N = 1) { |
375 | return const_cast<T *>( |
376 | this->reserveForParamAndGetAddressImpl(this, Elt, N)); |
377 | } |
378 | |
379 | static T &&forward_value_param(T &&V) { return std::move(V); } |
380 | static const T &forward_value_param(const T &V) { return V; } |
381 | |
382 | void growAndAssign(size_t NumElts, const T &Elt) { |
383 | // Grow manually in case Elt is an internal reference. |
384 | size_t NewCapacity; |
385 | T *NewElts = mallocForGrow(NumElts, NewCapacity); |
386 | std::uninitialized_fill_n(NewElts, NumElts, Elt); |
387 | this->destroy_range(this->begin(), this->end()); |
388 | takeAllocationForGrow(NewElts, NewCapacity); |
389 | this->set_size(NumElts); |
390 | } |
391 | |
392 | template <typename... ArgTypes> T &growAndEmplaceBack(ArgTypes &&... Args) { |
393 | // Grow manually in case one of Args is an internal reference. |
394 | size_t NewCapacity; |
395 | T *NewElts = mallocForGrow(0, NewCapacity); |
396 | ::new ((void *)(NewElts + this->size())) T(std::forward<ArgTypes>(Args)...); |
397 | moveElementsForGrow(NewElts); |
398 | takeAllocationForGrow(NewElts, NewCapacity); |
399 | this->set_size(this->size() + 1); |
400 | return this->back(); |
401 | } |
402 | |
403 | public: |
404 | void push_back(const T &Elt) { |
405 | const T *EltPtr = reserveForParamAndGetAddress(Elt); |
406 | ::new ((void *)this->end()) T(*EltPtr); |
407 | this->set_size(this->size() + 1); |
408 | } |
409 | |
410 | void push_back(T &&Elt) { |
411 | T *EltPtr = reserveForParamAndGetAddress(Elt); |
412 | ::new ((void *)this->end()) T(::std::move(*EltPtr)); |
413 | this->set_size(this->size() + 1); |
414 | } |
415 | |
416 | void pop_back() { |
417 | this->set_size(this->size() - 1); |
418 | this->end()->~T(); |
419 | } |
420 | }; |
421 | |
422 | // Define this out-of-line to dissuade the C++ compiler from inlining it. |
423 | template <typename T, bool TriviallyCopyable> |
424 | void SmallVectorTemplateBase<T, TriviallyCopyable>::grow(size_t MinSize) { |
425 | size_t NewCapacity; |
426 | T *NewElts = mallocForGrow(MinSize, NewCapacity); |
427 | moveElementsForGrow(NewElts); |
428 | takeAllocationForGrow(NewElts, NewCapacity); |
429 | } |
430 | |
431 | // Define this out-of-line to dissuade the C++ compiler from inlining it. |
432 | template <typename T, bool TriviallyCopyable> |
433 | void SmallVectorTemplateBase<T, TriviallyCopyable>::moveElementsForGrow( |
434 | T *NewElts) { |
435 | // Move the elements over. |
436 | this->uninitialized_move(this->begin(), this->end(), NewElts); |
437 | |
438 | // Destroy the original elements. |
439 | destroy_range(this->begin(), this->end()); |
440 | } |
441 | |
442 | // Define this out-of-line to dissuade the C++ compiler from inlining it. |
443 | template <typename T, bool TriviallyCopyable> |
444 | void SmallVectorTemplateBase<T, TriviallyCopyable>::takeAllocationForGrow( |
445 | T *NewElts, size_t NewCapacity) { |
446 | // If this wasn't grown from the inline copy, deallocate the old space. |
447 | if (!this->isSmall()) |
448 | free(this->begin()); |
449 | |
450 | this->BeginX = NewElts; |
451 | this->Capacity = NewCapacity; |
452 | } |
453 | |
454 | /// SmallVectorTemplateBase<TriviallyCopyable = true> - This is where we put |
455 | /// method implementations that are designed to work with trivially copyable |
456 | /// T's. This allows using memcpy in place of copy/move construction and |
457 | /// skipping destruction. |
458 | template <typename T> |
459 | class SmallVectorTemplateBase<T, true> : public SmallVectorTemplateCommon<T> { |
460 | friend class SmallVectorTemplateCommon<T>; |
461 | |
462 | protected: |
463 | /// True if it's cheap enough to take parameters by value. Doing so avoids |
464 | /// overhead related to mitigations for reference invalidation. |
465 | static constexpr bool TakesParamByValue = sizeof(T) <= 2 * sizeof(void *); |
466 | |
467 | /// Either const T& or T, depending on whether it's cheap enough to take |
468 | /// parameters by value. |
469 | using ValueParamT = |
470 | typename std::conditional<TakesParamByValue, T, const T &>::type; |
471 | |
472 | SmallVectorTemplateBase(size_t Size) : SmallVectorTemplateCommon<T>(Size) {} |
473 | |
474 | // No need to do a destroy loop for POD's. |
475 | static void destroy_range(T *, T *) {} |
476 | |
477 | /// Move the range [I, E) onto the uninitialized memory |
478 | /// starting with "Dest", constructing elements into it as needed. |
479 | template<typename It1, typename It2> |
480 | static void uninitialized_move(It1 I, It1 E, It2 Dest) { |
481 | // Just do a copy. |
482 | uninitialized_copy(I, E, Dest); |
483 | } |
484 | |
485 | /// Copy the range [I, E) onto the uninitialized memory |
486 | /// starting with "Dest", constructing elements into it as needed. |
487 | template<typename It1, typename It2> |
488 | static void uninitialized_copy(It1 I, It1 E, It2 Dest) { |
489 | // Arbitrary iterator types; just use the basic implementation. |
490 | std::uninitialized_copy(I, E, Dest); |
491 | } |
492 | |
493 | /// Copy the range [I, E) onto the uninitialized memory |
494 | /// starting with "Dest", constructing elements into it as needed. |
495 | template <typename T1, typename T2> |
496 | static void uninitialized_copy( |
497 | T1 *I, T1 *E, T2 *Dest, |
498 | std::enable_if_t<std::is_same<typename std::remove_const<T1>::type, |
499 | T2>::value> * = nullptr) { |
500 | // Use memcpy for PODs iterated by pointers (which includes SmallVector |
501 | // iterators): std::uninitialized_copy optimizes to memmove, but we can |
502 | // use memcpy here. Note that I and E are iterators and thus might be |
503 | // invalid for memcpy if they are equal. |
504 | if (I != E) |
505 | memcpy(reinterpret_cast<void *>(Dest), I, (E - I) * sizeof(T)); |
506 | } |
507 | |
508 | /// Double the size of the allocated memory, guaranteeing space for at |
509 | /// least one more element or MinSize if specified. |
510 | void grow(size_t MinSize = 0) { this->grow_pod(MinSize, sizeof(T)); } |
511 | |
512 | /// Reserve enough space to add one element, and return the updated element |
513 | /// pointer in case it was a reference to the storage. |
514 | const T *reserveForParamAndGetAddress(const T &Elt, size_t N = 1) { |
515 | return this->reserveForParamAndGetAddressImpl(this, Elt, N); |
516 | } |
517 | |
518 | /// Reserve enough space to add one element, and return the updated element |
519 | /// pointer in case it was a reference to the storage. |
520 | T *reserveForParamAndGetAddress(T &Elt, size_t N = 1) { |
521 | return const_cast<T *>( |
522 | this->reserveForParamAndGetAddressImpl(this, Elt, N)); |
523 | } |
524 | |
525 | /// Copy \p V or return a reference, depending on \a ValueParamT. |
526 | static ValueParamT forward_value_param(ValueParamT V) { return V; } |
527 | |
528 | void growAndAssign(size_t NumElts, T Elt) { |
529 | // Elt has been copied in case it's an internal reference, side-stepping |
530 | // reference invalidation problems without losing the realloc optimization. |
531 | this->set_size(0); |
532 | this->grow(NumElts); |
533 | std::uninitialized_fill_n(this->begin(), NumElts, Elt); |
534 | this->set_size(NumElts); |
535 | } |
536 | |
537 | template <typename... ArgTypes> T &growAndEmplaceBack(ArgTypes &&... Args) { |
538 | // Use push_back with a copy in case Args has an internal reference, |
539 | // side-stepping reference invalidation problems without losing the realloc |
540 | // optimization. |
541 | push_back(T(std::forward<ArgTypes>(Args)...)); |
542 | return this->back(); |
543 | } |
544 | |
545 | public: |
546 | void push_back(ValueParamT Elt) { |
547 | const T *EltPtr = reserveForParamAndGetAddress(Elt); |
548 | memcpy(reinterpret_cast<void *>(this->end()), EltPtr, sizeof(T)); |
549 | this->set_size(this->size() + 1); |
550 | } |
551 | |
552 | void pop_back() { this->set_size(this->size() - 1); } |
553 | }; |
554 | |
555 | /// This class consists of common code factored out of the SmallVector class to |
556 | /// reduce code duplication based on the SmallVector 'N' template parameter. |
557 | template <typename T> |
558 | class SmallVectorImpl : public SmallVectorTemplateBase<T> { |
559 | using SuperClass = SmallVectorTemplateBase<T>; |
560 | |
561 | public: |
562 | using iterator = typename SuperClass::iterator; |
563 | using const_iterator = typename SuperClass::const_iterator; |
564 | using reference = typename SuperClass::reference; |
565 | using size_type = typename SuperClass::size_type; |
566 | |
567 | protected: |
568 | using SmallVectorTemplateBase<T>::TakesParamByValue; |
569 | using ValueParamT = typename SuperClass::ValueParamT; |
570 | |
571 | // Default ctor - Initialize to empty. |
572 | explicit SmallVectorImpl(unsigned N) |
573 | : SmallVectorTemplateBase<T>(N) {} |
574 | |
575 | public: |
576 | SmallVectorImpl(const SmallVectorImpl &) = delete; |
577 | |
578 | ~SmallVectorImpl() { |
579 | // Subclass has already destructed this vector's elements. |
580 | // If this wasn't grown from the inline copy, deallocate the old space. |
581 | if (!this->isSmall()) |
582 | free(this->begin()); |
583 | } |
584 | |
585 | void clear() { |
586 | this->destroy_range(this->begin(), this->end()); |
587 | this->Size = 0; |
588 | } |
589 | |
590 | private: |
591 | template <bool ForOverwrite> void resizeImpl(size_type N) { |
592 | if (N < this->size()) { |
593 | this->pop_back_n(this->size() - N); |
594 | } else if (N > this->size()) { |
595 | this->reserve(N); |
596 | for (auto I = this->end(), E = this->begin() + N; I != E; ++I) |
597 | if (ForOverwrite) |
598 | new (&*I) T; |
599 | else |
600 | new (&*I) T(); |
601 | this->set_size(N); |
602 | } |
603 | } |
604 | |
605 | public: |
606 | void resize(size_type N) { resizeImpl<false>(N); } |
607 | |
608 | /// Like resize, but \ref T is POD, the new values won't be initialized. |
609 | void resize_for_overwrite(size_type N) { resizeImpl<true>(N); } |
610 | |
611 | void resize(size_type N, ValueParamT NV) { |
612 | if (N == this->size()) |
613 | return; |
614 | |
615 | if (N < this->size()) { |
616 | this->pop_back_n(this->size() - N); |
617 | return; |
618 | } |
619 | |
620 | // N > this->size(). Defer to append. |
621 | this->append(N - this->size(), NV); |
622 | } |
623 | |
624 | void reserve(size_type N) { |
625 | if (this->capacity() < N) |
626 | this->grow(N); |
627 | } |
628 | |
629 | void pop_back_n(size_type NumItems) { |
630 | assert(this->size() >= NumItems)(static_cast <bool> (this->size() >= NumItems) ? void (0) : __assert_fail ("this->size() >= NumItems", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 630, __extension__ __PRETTY_FUNCTION__)); |
631 | this->destroy_range(this->end() - NumItems, this->end()); |
632 | this->set_size(this->size() - NumItems); |
633 | } |
634 | |
635 | LLVM_NODISCARD[[clang::warn_unused_result]] T pop_back_val() { |
636 | T Result = ::std::move(this->back()); |
637 | this->pop_back(); |
638 | return Result; |
639 | } |
640 | |
641 | void swap(SmallVectorImpl &RHS); |
642 | |
643 | /// Add the specified range to the end of the SmallVector. |
644 | template <typename in_iter, |
645 | typename = std::enable_if_t<std::is_convertible< |
646 | typename std::iterator_traits<in_iter>::iterator_category, |
647 | std::input_iterator_tag>::value>> |
648 | void append(in_iter in_start, in_iter in_end) { |
649 | this->assertSafeToAddRange(in_start, in_end); |
650 | size_type NumInputs = std::distance(in_start, in_end); |
651 | this->reserve(this->size() + NumInputs); |
652 | this->uninitialized_copy(in_start, in_end, this->end()); |
653 | this->set_size(this->size() + NumInputs); |
654 | } |
655 | |
656 | /// Append \p NumInputs copies of \p Elt to the end. |
657 | void append(size_type NumInputs, ValueParamT Elt) { |
658 | const T *EltPtr = this->reserveForParamAndGetAddress(Elt, NumInputs); |
659 | std::uninitialized_fill_n(this->end(), NumInputs, *EltPtr); |
660 | this->set_size(this->size() + NumInputs); |
661 | } |
662 | |
663 | void append(std::initializer_list<T> IL) { |
664 | append(IL.begin(), IL.end()); |
665 | } |
666 | |
667 | void append(const SmallVectorImpl &RHS) { append(RHS.begin(), RHS.end()); } |
668 | |
669 | void assign(size_type NumElts, ValueParamT Elt) { |
670 | // Note that Elt could be an internal reference. |
671 | if (NumElts > this->capacity()) { |
672 | this->growAndAssign(NumElts, Elt); |
673 | return; |
674 | } |
675 | |
676 | // Assign over existing elements. |
677 | std::fill_n(this->begin(), std::min(NumElts, this->size()), Elt); |
678 | if (NumElts > this->size()) |
679 | std::uninitialized_fill_n(this->end(), NumElts - this->size(), Elt); |
680 | else if (NumElts < this->size()) |
681 | this->destroy_range(this->begin() + NumElts, this->end()); |
682 | this->set_size(NumElts); |
683 | } |
684 | |
685 | // FIXME: Consider assigning over existing elements, rather than clearing & |
686 | // re-initializing them - for all assign(...) variants. |
687 | |
688 | template <typename in_iter, |
689 | typename = std::enable_if_t<std::is_convertible< |
690 | typename std::iterator_traits<in_iter>::iterator_category, |
691 | std::input_iterator_tag>::value>> |
692 | void assign(in_iter in_start, in_iter in_end) { |
693 | this->assertSafeToReferenceAfterClear(in_start, in_end); |
694 | clear(); |
695 | append(in_start, in_end); |
696 | } |
697 | |
698 | void assign(std::initializer_list<T> IL) { |
699 | clear(); |
700 | append(IL); |
701 | } |
702 | |
703 | void assign(const SmallVectorImpl &RHS) { assign(RHS.begin(), RHS.end()); } |
704 | |
705 | iterator erase(const_iterator CI) { |
706 | // Just cast away constness because this is a non-const member function. |
707 | iterator I = const_cast<iterator>(CI); |
708 | |
709 | assert(this->isReferenceToStorage(CI) && "Iterator to erase is out of bounds.")(static_cast <bool> (this->isReferenceToStorage(CI) && "Iterator to erase is out of bounds.") ? void (0) : __assert_fail ("this->isReferenceToStorage(CI) && \"Iterator to erase is out of bounds.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 709, __extension__ __PRETTY_FUNCTION__)); |
710 | |
711 | iterator N = I; |
712 | // Shift all elts down one. |
713 | std::move(I+1, this->end(), I); |
714 | // Drop the last elt. |
715 | this->pop_back(); |
716 | return(N); |
717 | } |
718 | |
719 | iterator erase(const_iterator CS, const_iterator CE) { |
720 | // Just cast away constness because this is a non-const member function. |
721 | iterator S = const_cast<iterator>(CS); |
722 | iterator E = const_cast<iterator>(CE); |
723 | |
724 | assert(this->isRangeInStorage(S, E) && "Range to erase is out of bounds.")(static_cast <bool> (this->isRangeInStorage(S, E) && "Range to erase is out of bounds.") ? void (0) : __assert_fail ("this->isRangeInStorage(S, E) && \"Range to erase is out of bounds.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 724, __extension__ __PRETTY_FUNCTION__)); |
725 | |
726 | iterator N = S; |
727 | // Shift all elts down. |
728 | iterator I = std::move(E, this->end(), S); |
729 | // Drop the last elts. |
730 | this->destroy_range(I, this->end()); |
731 | this->set_size(I - this->begin()); |
732 | return(N); |
733 | } |
734 | |
735 | private: |
736 | template <class ArgType> iterator insert_one_impl(iterator I, ArgType &&Elt) { |
737 | // Callers ensure that ArgType is derived from T. |
738 | static_assert( |
739 | std::is_same<std::remove_const_t<std::remove_reference_t<ArgType>>, |
740 | T>::value, |
741 | "ArgType must be derived from T!"); |
742 | |
743 | if (I == this->end()) { // Important special case for empty vector. |
744 | this->push_back(::std::forward<ArgType>(Elt)); |
745 | return this->end()-1; |
746 | } |
747 | |
748 | assert(this->isReferenceToStorage(I) && "Insertion iterator is out of bounds.")(static_cast <bool> (this->isReferenceToStorage(I) && "Insertion iterator is out of bounds.") ? void (0) : __assert_fail ("this->isReferenceToStorage(I) && \"Insertion iterator is out of bounds.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 748, __extension__ __PRETTY_FUNCTION__)); |
749 | |
750 | // Grow if necessary. |
751 | size_t Index = I - this->begin(); |
752 | std::remove_reference_t<ArgType> *EltPtr = |
753 | this->reserveForParamAndGetAddress(Elt); |
754 | I = this->begin() + Index; |
755 | |
756 | ::new ((void*) this->end()) T(::std::move(this->back())); |
757 | // Push everything else over. |
758 | std::move_backward(I, this->end()-1, this->end()); |
759 | this->set_size(this->size() + 1); |
760 | |
761 | // If we just moved the element we're inserting, be sure to update |
762 | // the reference (never happens if TakesParamByValue). |
763 | static_assert(!TakesParamByValue || std::is_same<ArgType, T>::value, |
764 | "ArgType must be 'T' when taking by value!"); |
765 | if (!TakesParamByValue && this->isReferenceToRange(EltPtr, I, this->end())) |
766 | ++EltPtr; |
767 | |
768 | *I = ::std::forward<ArgType>(*EltPtr); |
769 | return I; |
770 | } |
771 | |
772 | public: |
773 | iterator insert(iterator I, T &&Elt) { |
774 | return insert_one_impl(I, this->forward_value_param(std::move(Elt))); |
775 | } |
776 | |
777 | iterator insert(iterator I, const T &Elt) { |
778 | return insert_one_impl(I, this->forward_value_param(Elt)); |
779 | } |
780 | |
781 | iterator insert(iterator I, size_type NumToInsert, ValueParamT Elt) { |
782 | // Convert iterator to elt# to avoid invalidating iterator when we reserve() |
783 | size_t InsertElt = I - this->begin(); |
784 | |
785 | if (I == this->end()) { // Important special case for empty vector. |
786 | append(NumToInsert, Elt); |
787 | return this->begin()+InsertElt; |
788 | } |
789 | |
790 | assert(this->isReferenceToStorage(I) && "Insertion iterator is out of bounds.")(static_cast <bool> (this->isReferenceToStorage(I) && "Insertion iterator is out of bounds.") ? void (0) : __assert_fail ("this->isReferenceToStorage(I) && \"Insertion iterator is out of bounds.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 790, __extension__ __PRETTY_FUNCTION__)); |
791 | |
792 | // Ensure there is enough space, and get the (maybe updated) address of |
793 | // Elt. |
794 | const T *EltPtr = this->reserveForParamAndGetAddress(Elt, NumToInsert); |
795 | |
796 | // Uninvalidate the iterator. |
797 | I = this->begin()+InsertElt; |
798 | |
799 | // If there are more elements between the insertion point and the end of the |
800 | // range than there are being inserted, we can use a simple approach to |
801 | // insertion. Since we already reserved space, we know that this won't |
802 | // reallocate the vector. |
803 | if (size_t(this->end()-I) >= NumToInsert) { |
804 | T *OldEnd = this->end(); |
805 | append(std::move_iterator<iterator>(this->end() - NumToInsert), |
806 | std::move_iterator<iterator>(this->end())); |
807 | |
808 | // Copy the existing elements that get replaced. |
809 | std::move_backward(I, OldEnd-NumToInsert, OldEnd); |
810 | |
811 | // If we just moved the element we're inserting, be sure to update |
812 | // the reference (never happens if TakesParamByValue). |
813 | if (!TakesParamByValue && I <= EltPtr && EltPtr < this->end()) |
814 | EltPtr += NumToInsert; |
815 | |
816 | std::fill_n(I, NumToInsert, *EltPtr); |
817 | return I; |
818 | } |
819 | |
820 | // Otherwise, we're inserting more elements than exist already, and we're |
821 | // not inserting at the end. |
822 | |
823 | // Move over the elements that we're about to overwrite. |
824 | T *OldEnd = this->end(); |
825 | this->set_size(this->size() + NumToInsert); |
826 | size_t NumOverwritten = OldEnd-I; |
827 | this->uninitialized_move(I, OldEnd, this->end()-NumOverwritten); |
828 | |
829 | // If we just moved the element we're inserting, be sure to update |
830 | // the reference (never happens if TakesParamByValue). |
831 | if (!TakesParamByValue && I <= EltPtr && EltPtr < this->end()) |
832 | EltPtr += NumToInsert; |
833 | |
834 | // Replace the overwritten part. |
835 | std::fill_n(I, NumOverwritten, *EltPtr); |
836 | |
837 | // Insert the non-overwritten middle part. |
838 | std::uninitialized_fill_n(OldEnd, NumToInsert - NumOverwritten, *EltPtr); |
839 | return I; |
840 | } |
841 | |
842 | template <typename ItTy, |
843 | typename = std::enable_if_t<std::is_convertible< |
844 | typename std::iterator_traits<ItTy>::iterator_category, |
845 | std::input_iterator_tag>::value>> |
846 | iterator insert(iterator I, ItTy From, ItTy To) { |
847 | // Convert iterator to elt# to avoid invalidating iterator when we reserve() |
848 | size_t InsertElt = I - this->begin(); |
849 | |
850 | if (I == this->end()) { // Important special case for empty vector. |
851 | append(From, To); |
852 | return this->begin()+InsertElt; |
853 | } |
854 | |
855 | assert(this->isReferenceToStorage(I) && "Insertion iterator is out of bounds.")(static_cast <bool> (this->isReferenceToStorage(I) && "Insertion iterator is out of bounds.") ? void (0) : __assert_fail ("this->isReferenceToStorage(I) && \"Insertion iterator is out of bounds.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/ADT/SmallVector.h" , 855, __extension__ __PRETTY_FUNCTION__)); |
856 | |
857 | // Check that the reserve that follows doesn't invalidate the iterators. |
858 | this->assertSafeToAddRange(From, To); |
859 | |
860 | size_t NumToInsert = std::distance(From, To); |
861 | |
862 | // Ensure there is enough space. |
863 | reserve(this->size() + NumToInsert); |
864 | |
865 | // Uninvalidate the iterator. |
866 | I = this->begin()+InsertElt; |
867 | |
868 | // If there are more elements between the insertion point and the end of the |
869 | // range than there are being inserted, we can use a simple approach to |
870 | // insertion. Since we already reserved space, we know that this won't |
871 | // reallocate the vector. |
872 | if (size_t(this->end()-I) >= NumToInsert) { |
873 | T *OldEnd = this->end(); |
874 | append(std::move_iterator<iterator>(this->end() - NumToInsert), |
875 | std::move_iterator<iterator>(this->end())); |
876 | |
877 | // Copy the existing elements that get replaced. |
878 | std::move_backward(I, OldEnd-NumToInsert, OldEnd); |
879 | |
880 | std::copy(From, To, I); |
881 | return I; |
882 | } |
883 | |
884 | // Otherwise, we're inserting more elements than exist already, and we're |
885 | // not inserting at the end. |
886 | |
887 | // Move over the elements that we're about to overwrite. |
888 | T *OldEnd = this->end(); |
889 | this->set_size(this->size() + NumToInsert); |
890 | size_t NumOverwritten = OldEnd-I; |
891 | this->uninitialized_move(I, OldEnd, this->end()-NumOverwritten); |
892 | |
893 | // Replace the overwritten part. |
894 | for (T *J = I; NumOverwritten > 0; --NumOverwritten) { |
895 | *J = *From; |
896 | ++J; ++From; |
897 | } |
898 | |
899 | // Insert the non-overwritten middle part. |
900 | this->uninitialized_copy(From, To, OldEnd); |
901 | return I; |
902 | } |
903 | |
904 | void insert(iterator I, std::initializer_list<T> IL) { |
905 | insert(I, IL.begin(), IL.end()); |
906 | } |
907 | |
908 | template <typename... ArgTypes> reference emplace_back(ArgTypes &&... Args) { |
909 | if (LLVM_UNLIKELY(this->size() >= this->capacity())__builtin_expect((bool)(this->size() >= this->capacity ()), false)) |
910 | return this->growAndEmplaceBack(std::forward<ArgTypes>(Args)...); |
911 | |
912 | ::new ((void *)this->end()) T(std::forward<ArgTypes>(Args)...); |
913 | this->set_size(this->size() + 1); |
914 | return this->back(); |
915 | } |
916 | |
917 | SmallVectorImpl &operator=(const SmallVectorImpl &RHS); |
918 | |
919 | SmallVectorImpl &operator=(SmallVectorImpl &&RHS); |
920 | |
921 | bool operator==(const SmallVectorImpl &RHS) const { |
922 | if (this->size() != RHS.size()) return false; |
923 | return std::equal(this->begin(), this->end(), RHS.begin()); |
924 | } |
925 | bool operator!=(const SmallVectorImpl &RHS) const { |
926 | return !(*this == RHS); |
927 | } |
928 | |
929 | bool operator<(const SmallVectorImpl &RHS) const { |
930 | return std::lexicographical_compare(this->begin(), this->end(), |
931 | RHS.begin(), RHS.end()); |
932 | } |
933 | }; |
934 | |
935 | template <typename T> |
936 | void SmallVectorImpl<T>::swap(SmallVectorImpl<T> &RHS) { |
937 | if (this == &RHS) return; |
938 | |
939 | // We can only avoid copying elements if neither vector is small. |
940 | if (!this->isSmall() && !RHS.isSmall()) { |
941 | std::swap(this->BeginX, RHS.BeginX); |
942 | std::swap(this->Size, RHS.Size); |
943 | std::swap(this->Capacity, RHS.Capacity); |
944 | return; |
945 | } |
946 | this->reserve(RHS.size()); |
947 | RHS.reserve(this->size()); |
948 | |
949 | // Swap the shared elements. |
950 | size_t NumShared = this->size(); |
951 | if (NumShared > RHS.size()) NumShared = RHS.size(); |
952 | for (size_type i = 0; i != NumShared; ++i) |
953 | std::swap((*this)[i], RHS[i]); |
954 | |
955 | // Copy over the extra elts. |
956 | if (this->size() > RHS.size()) { |
957 | size_t EltDiff = this->size() - RHS.size(); |
958 | this->uninitialized_copy(this->begin()+NumShared, this->end(), RHS.end()); |
959 | RHS.set_size(RHS.size() + EltDiff); |
960 | this->destroy_range(this->begin()+NumShared, this->end()); |
961 | this->set_size(NumShared); |
962 | } else if (RHS.size() > this->size()) { |
963 | size_t EltDiff = RHS.size() - this->size(); |
964 | this->uninitialized_copy(RHS.begin()+NumShared, RHS.end(), this->end()); |
965 | this->set_size(this->size() + EltDiff); |
966 | this->destroy_range(RHS.begin()+NumShared, RHS.end()); |
967 | RHS.set_size(NumShared); |
968 | } |
969 | } |
970 | |
971 | template <typename T> |
972 | SmallVectorImpl<T> &SmallVectorImpl<T>:: |
973 | operator=(const SmallVectorImpl<T> &RHS) { |
974 | // Avoid self-assignment. |
975 | if (this == &RHS) return *this; |
976 | |
977 | // If we already have sufficient space, assign the common elements, then |
978 | // destroy any excess. |
979 | size_t RHSSize = RHS.size(); |
980 | size_t CurSize = this->size(); |
981 | if (CurSize >= RHSSize) { |
982 | // Assign common elements. |
983 | iterator NewEnd; |
984 | if (RHSSize) |
985 | NewEnd = std::copy(RHS.begin(), RHS.begin()+RHSSize, this->begin()); |
986 | else |
987 | NewEnd = this->begin(); |
988 | |
989 | // Destroy excess elements. |
990 | this->destroy_range(NewEnd, this->end()); |
991 | |
992 | // Trim. |
993 | this->set_size(RHSSize); |
994 | return *this; |
995 | } |
996 | |
997 | // If we have to grow to have enough elements, destroy the current elements. |
998 | // This allows us to avoid copying them during the grow. |
999 | // FIXME: don't do this if they're efficiently moveable. |
1000 | if (this->capacity() < RHSSize) { |
1001 | // Destroy current elements. |
1002 | this->clear(); |
1003 | CurSize = 0; |
1004 | this->grow(RHSSize); |
1005 | } else if (CurSize) { |
1006 | // Otherwise, use assignment for the already-constructed elements. |
1007 | std::copy(RHS.begin(), RHS.begin()+CurSize, this->begin()); |
1008 | } |
1009 | |
1010 | // Copy construct the new elements in place. |
1011 | this->uninitialized_copy(RHS.begin()+CurSize, RHS.end(), |
1012 | this->begin()+CurSize); |
1013 | |
1014 | // Set end. |
1015 | this->set_size(RHSSize); |
1016 | return *this; |
1017 | } |
1018 | |
1019 | template <typename T> |
1020 | SmallVectorImpl<T> &SmallVectorImpl<T>::operator=(SmallVectorImpl<T> &&RHS) { |
1021 | // Avoid self-assignment. |
1022 | if (this == &RHS) return *this; |
1023 | |
1024 | // If the RHS isn't small, clear this vector and then steal its buffer. |
1025 | if (!RHS.isSmall()) { |
1026 | this->destroy_range(this->begin(), this->end()); |
1027 | if (!this->isSmall()) free(this->begin()); |
1028 | this->BeginX = RHS.BeginX; |
1029 | this->Size = RHS.Size; |
1030 | this->Capacity = RHS.Capacity; |
1031 | RHS.resetToSmall(); |
1032 | return *this; |
1033 | } |
1034 | |
1035 | // If we already have sufficient space, assign the common elements, then |
1036 | // destroy any excess. |
1037 | size_t RHSSize = RHS.size(); |
1038 | size_t CurSize = this->size(); |
1039 | if (CurSize >= RHSSize) { |
1040 | // Assign common elements. |
1041 | iterator NewEnd = this->begin(); |
1042 | if (RHSSize) |
1043 | NewEnd = std::move(RHS.begin(), RHS.end(), NewEnd); |
1044 | |
1045 | // Destroy excess elements and trim the bounds. |
1046 | this->destroy_range(NewEnd, this->end()); |
1047 | this->set_size(RHSSize); |
1048 | |
1049 | // Clear the RHS. |
1050 | RHS.clear(); |
1051 | |
1052 | return *this; |
1053 | } |
1054 | |
1055 | // If we have to grow to have enough elements, destroy the current elements. |
1056 | // This allows us to avoid copying them during the grow. |
1057 | // FIXME: this may not actually make any sense if we can efficiently move |
1058 | // elements. |
1059 | if (this->capacity() < RHSSize) { |
1060 | // Destroy current elements. |
1061 | this->clear(); |
1062 | CurSize = 0; |
1063 | this->grow(RHSSize); |
1064 | } else if (CurSize) { |
1065 | // Otherwise, use assignment for the already-constructed elements. |
1066 | std::move(RHS.begin(), RHS.begin()+CurSize, this->begin()); |
1067 | } |
1068 | |
1069 | // Move-construct the new elements in place. |
1070 | this->uninitialized_move(RHS.begin()+CurSize, RHS.end(), |
1071 | this->begin()+CurSize); |
1072 | |
1073 | // Set end. |
1074 | this->set_size(RHSSize); |
1075 | |
1076 | RHS.clear(); |
1077 | return *this; |
1078 | } |
1079 | |
1080 | /// Storage for the SmallVector elements. This is specialized for the N=0 case |
1081 | /// to avoid allocating unnecessary storage. |
1082 | template <typename T, unsigned N> |
1083 | struct SmallVectorStorage { |
1084 | alignas(T) char InlineElts[N * sizeof(T)]; |
1085 | }; |
1086 | |
1087 | /// We need the storage to be properly aligned even for small-size of 0 so that |
1088 | /// the pointer math in \a SmallVectorTemplateCommon::getFirstEl() is |
1089 | /// well-defined. |
1090 | template <typename T> struct alignas(T) SmallVectorStorage<T, 0> {}; |
1091 | |
1092 | /// Forward declaration of SmallVector so that |
1093 | /// calculateSmallVectorDefaultInlinedElements can reference |
1094 | /// `sizeof(SmallVector<T, 0>)`. |
1095 | template <typename T, unsigned N> class LLVM_GSL_OWNER[[gsl::Owner]] SmallVector; |
1096 | |
1097 | /// Helper class for calculating the default number of inline elements for |
1098 | /// `SmallVector<T>`. |
1099 | /// |
1100 | /// This should be migrated to a constexpr function when our minimum |
1101 | /// compiler support is enough for multi-statement constexpr functions. |
1102 | template <typename T> struct CalculateSmallVectorDefaultInlinedElements { |
1103 | // Parameter controlling the default number of inlined elements |
1104 | // for `SmallVector<T>`. |
1105 | // |
1106 | // The default number of inlined elements ensures that |
1107 | // 1. There is at least one inlined element. |
1108 | // 2. `sizeof(SmallVector<T>) <= kPreferredSmallVectorSizeof` unless |
1109 | // it contradicts 1. |
1110 | static constexpr size_t kPreferredSmallVectorSizeof = 64; |
1111 | |
1112 | // static_assert that sizeof(T) is not "too big". |
1113 | // |
1114 | // Because our policy guarantees at least one inlined element, it is possible |
1115 | // for an arbitrarily large inlined element to allocate an arbitrarily large |
1116 | // amount of inline storage. We generally consider it an antipattern for a |
1117 | // SmallVector to allocate an excessive amount of inline storage, so we want |
1118 | // to call attention to these cases and make sure that users are making an |
1119 | // intentional decision if they request a lot of inline storage. |
1120 | // |
1121 | // We want this assertion to trigger in pathological cases, but otherwise |
1122 | // not be too easy to hit. To accomplish that, the cutoff is actually somewhat |
1123 | // larger than kPreferredSmallVectorSizeof (otherwise, |
1124 | // `SmallVector<SmallVector<T>>` would be one easy way to trip it, and that |
1125 | // pattern seems useful in practice). |
1126 | // |
1127 | // One wrinkle is that this assertion is in theory non-portable, since |
1128 | // sizeof(T) is in general platform-dependent. However, we don't expect this |
1129 | // to be much of an issue, because most LLVM development happens on 64-bit |
1130 | // hosts, and therefore sizeof(T) is expected to *decrease* when compiled for |
1131 | // 32-bit hosts, dodging the issue. The reverse situation, where development |
1132 | // happens on a 32-bit host and then fails due to sizeof(T) *increasing* on a |
1133 | // 64-bit host, is expected to be very rare. |
1134 | static_assert( |
1135 | sizeof(T) <= 256, |
1136 | "You are trying to use a default number of inlined elements for " |
1137 | "`SmallVector<T>` but `sizeof(T)` is really big! Please use an " |
1138 | "explicit number of inlined elements with `SmallVector<T, N>` to make " |
1139 | "sure you really want that much inline storage."); |
1140 | |
1141 | // Discount the size of the header itself when calculating the maximum inline |
1142 | // bytes. |
1143 | static constexpr size_t PreferredInlineBytes = |
1144 | kPreferredSmallVectorSizeof - sizeof(SmallVector<T, 0>); |
1145 | static constexpr size_t NumElementsThatFit = PreferredInlineBytes / sizeof(T); |
1146 | static constexpr size_t value = |
1147 | NumElementsThatFit == 0 ? 1 : NumElementsThatFit; |
1148 | }; |
1149 | |
1150 | /// This is a 'vector' (really, a variable-sized array), optimized |
1151 | /// for the case when the array is small. It contains some number of elements |
1152 | /// in-place, which allows it to avoid heap allocation when the actual number of |
1153 | /// elements is below that threshold. This allows normal "small" cases to be |
1154 | /// fast without losing generality for large inputs. |
1155 | /// |
1156 | /// \note |
1157 | /// In the absence of a well-motivated choice for the number of inlined |
1158 | /// elements \p N, it is recommended to use \c SmallVector<T> (that is, |
1159 | /// omitting the \p N). This will choose a default number of inlined elements |
1160 | /// reasonable for allocation on the stack (for example, trying to keep \c |
1161 | /// sizeof(SmallVector<T>) around 64 bytes). |
1162 | /// |
1163 | /// \warning This does not attempt to be exception safe. |
1164 | /// |
1165 | /// \see https://llvm.org/docs/ProgrammersManual.html#llvm-adt-smallvector-h |
1166 | template <typename T, |
1167 | unsigned N = CalculateSmallVectorDefaultInlinedElements<T>::value> |
1168 | class LLVM_GSL_OWNER[[gsl::Owner]] SmallVector : public SmallVectorImpl<T>, |
1169 | SmallVectorStorage<T, N> { |
1170 | public: |
1171 | SmallVector() : SmallVectorImpl<T>(N) {} |
1172 | |
1173 | ~SmallVector() { |
1174 | // Destroy the constructed elements in the vector. |
1175 | this->destroy_range(this->begin(), this->end()); |
1176 | } |
1177 | |
1178 | explicit SmallVector(size_t Size, const T &Value = T()) |
1179 | : SmallVectorImpl<T>(N) { |
1180 | this->assign(Size, Value); |
1181 | } |
1182 | |
1183 | template <typename ItTy, |
1184 | typename = std::enable_if_t<std::is_convertible< |
1185 | typename std::iterator_traits<ItTy>::iterator_category, |
1186 | std::input_iterator_tag>::value>> |
1187 | SmallVector(ItTy S, ItTy E) : SmallVectorImpl<T>(N) { |
1188 | this->append(S, E); |
1189 | } |
1190 | |
1191 | template <typename RangeTy> |
1192 | explicit SmallVector(const iterator_range<RangeTy> &R) |
1193 | : SmallVectorImpl<T>(N) { |
1194 | this->append(R.begin(), R.end()); |
1195 | } |
1196 | |
1197 | SmallVector(std::initializer_list<T> IL) : SmallVectorImpl<T>(N) { |
1198 | this->assign(IL); |
1199 | } |
1200 | |
1201 | SmallVector(const SmallVector &RHS) : SmallVectorImpl<T>(N) { |
1202 | if (!RHS.empty()) |
1203 | SmallVectorImpl<T>::operator=(RHS); |
1204 | } |
1205 | |
1206 | SmallVector &operator=(const SmallVector &RHS) { |
1207 | SmallVectorImpl<T>::operator=(RHS); |
1208 | return *this; |
1209 | } |
1210 | |
1211 | SmallVector(SmallVector &&RHS) : SmallVectorImpl<T>(N) { |
1212 | if (!RHS.empty()) |
1213 | SmallVectorImpl<T>::operator=(::std::move(RHS)); |
1214 | } |
1215 | |
1216 | SmallVector(SmallVectorImpl<T> &&RHS) : SmallVectorImpl<T>(N) { |
1217 | if (!RHS.empty()) |
1218 | SmallVectorImpl<T>::operator=(::std::move(RHS)); |
1219 | } |
1220 | |
1221 | SmallVector &operator=(SmallVector &&RHS) { |
1222 | SmallVectorImpl<T>::operator=(::std::move(RHS)); |
1223 | return *this; |
1224 | } |
1225 | |
1226 | SmallVector &operator=(SmallVectorImpl<T> &&RHS) { |
1227 | SmallVectorImpl<T>::operator=(::std::move(RHS)); |
1228 | return *this; |
1229 | } |
1230 | |
1231 | SmallVector &operator=(std::initializer_list<T> IL) { |
1232 | this->assign(IL); |
1233 | return *this; |
1234 | } |
1235 | }; |
1236 | |
1237 | template <typename T, unsigned N> |
1238 | inline size_t capacity_in_bytes(const SmallVector<T, N> &X) { |
1239 | return X.capacity_in_bytes(); |
1240 | } |
1241 | |
1242 | /// Given a range of type R, iterate the entire range and return a |
1243 | /// SmallVector with elements of the vector. This is useful, for example, |
1244 | /// when you want to iterate a range and then sort the results. |
1245 | template <unsigned Size, typename R> |
1246 | SmallVector<typename std::remove_const<typename std::remove_reference< |
1247 | decltype(*std::begin(std::declval<R &>()))>::type>::type, |
1248 | Size> |
1249 | to_vector(R &&Range) { |
1250 | return {std::begin(Range), std::end(Range)}; |
1251 | } |
1252 | |
1253 | } // end namespace llvm |
1254 | |
1255 | namespace std { |
1256 | |
1257 | /// Implement std::swap in terms of SmallVector swap. |
1258 | template<typename T> |
1259 | inline void |
1260 | swap(llvm::SmallVectorImpl<T> &LHS, llvm::SmallVectorImpl<T> &RHS) { |
1261 | LHS.swap(RHS); |
1262 | } |
1263 | |
1264 | /// Implement std::swap in terms of SmallVector swap. |
1265 | template<typename T, unsigned N> |
1266 | inline void |
1267 | swap(llvm::SmallVector<T, N> &LHS, llvm::SmallVector<T, N> &RHS) { |
1268 | LHS.swap(RHS); |
1269 | } |
1270 | |
1271 | } // end namespace std |
1272 | |
1273 | #endif // LLVM_ADT_SMALLVECTOR_H |
1 | //===- llvm/Instructions.h - Instruction subclass definitions ---*- C++ -*-===// | |||
2 | // | |||
3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. | |||
4 | // See https://llvm.org/LICENSE.txt for license information. | |||
5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception | |||
6 | // | |||
7 | //===----------------------------------------------------------------------===// | |||
8 | // | |||
9 | // This file exposes the class definitions of all of the subclasses of the | |||
10 | // Instruction class. This is meant to be an easy way to get access to all | |||
11 | // instruction subclasses. | |||
12 | // | |||
13 | //===----------------------------------------------------------------------===// | |||
14 | ||||
15 | #ifndef LLVM_IR_INSTRUCTIONS_H | |||
16 | #define LLVM_IR_INSTRUCTIONS_H | |||
17 | ||||
18 | #include "llvm/ADT/ArrayRef.h" | |||
19 | #include "llvm/ADT/Bitfields.h" | |||
20 | #include "llvm/ADT/MapVector.h" | |||
21 | #include "llvm/ADT/None.h" | |||
22 | #include "llvm/ADT/STLExtras.h" | |||
23 | #include "llvm/ADT/SmallVector.h" | |||
24 | #include "llvm/ADT/StringRef.h" | |||
25 | #include "llvm/ADT/Twine.h" | |||
26 | #include "llvm/ADT/iterator.h" | |||
27 | #include "llvm/ADT/iterator_range.h" | |||
28 | #include "llvm/IR/Attributes.h" | |||
29 | #include "llvm/IR/BasicBlock.h" | |||
30 | #include "llvm/IR/CallingConv.h" | |||
31 | #include "llvm/IR/CFG.h" | |||
32 | #include "llvm/IR/Constant.h" | |||
33 | #include "llvm/IR/DerivedTypes.h" | |||
34 | #include "llvm/IR/Function.h" | |||
35 | #include "llvm/IR/InstrTypes.h" | |||
36 | #include "llvm/IR/Instruction.h" | |||
37 | #include "llvm/IR/OperandTraits.h" | |||
38 | #include "llvm/IR/Type.h" | |||
39 | #include "llvm/IR/Use.h" | |||
40 | #include "llvm/IR/User.h" | |||
41 | #include "llvm/IR/Value.h" | |||
42 | #include "llvm/Support/AtomicOrdering.h" | |||
43 | #include "llvm/Support/Casting.h" | |||
44 | #include "llvm/Support/ErrorHandling.h" | |||
45 | #include <cassert> | |||
46 | #include <cstddef> | |||
47 | #include <cstdint> | |||
48 | #include <iterator> | |||
49 | ||||
50 | namespace llvm { | |||
51 | ||||
52 | class APInt; | |||
53 | class ConstantInt; | |||
54 | class DataLayout; | |||
55 | class LLVMContext; | |||
56 | ||||
57 | //===----------------------------------------------------------------------===// | |||
58 | // AllocaInst Class | |||
59 | //===----------------------------------------------------------------------===// | |||
60 | ||||
61 | /// an instruction to allocate memory on the stack | |||
62 | class AllocaInst : public UnaryInstruction { | |||
63 | Type *AllocatedType; | |||
64 | ||||
65 | using AlignmentField = AlignmentBitfieldElementT<0>; | |||
66 | using UsedWithInAllocaField = BoolBitfieldElementT<AlignmentField::NextBit>; | |||
67 | using SwiftErrorField = BoolBitfieldElementT<UsedWithInAllocaField::NextBit>; | |||
68 | static_assert(Bitfield::areContiguous<AlignmentField, UsedWithInAllocaField, | |||
69 | SwiftErrorField>(), | |||
70 | "Bitfields must be contiguous"); | |||
71 | ||||
72 | protected: | |||
73 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
74 | friend class Instruction; | |||
75 | ||||
76 | AllocaInst *cloneImpl() const; | |||
77 | ||||
78 | public: | |||
79 | explicit AllocaInst(Type *Ty, unsigned AddrSpace, Value *ArraySize, | |||
80 | const Twine &Name, Instruction *InsertBefore); | |||
81 | AllocaInst(Type *Ty, unsigned AddrSpace, Value *ArraySize, | |||
82 | const Twine &Name, BasicBlock *InsertAtEnd); | |||
83 | ||||
84 | AllocaInst(Type *Ty, unsigned AddrSpace, const Twine &Name, | |||
85 | Instruction *InsertBefore); | |||
86 | AllocaInst(Type *Ty, unsigned AddrSpace, | |||
87 | const Twine &Name, BasicBlock *InsertAtEnd); | |||
88 | ||||
89 | AllocaInst(Type *Ty, unsigned AddrSpace, Value *ArraySize, Align Align, | |||
90 | const Twine &Name = "", Instruction *InsertBefore = nullptr); | |||
91 | AllocaInst(Type *Ty, unsigned AddrSpace, Value *ArraySize, Align Align, | |||
92 | const Twine &Name, BasicBlock *InsertAtEnd); | |||
93 | ||||
94 | /// Return true if there is an allocation size parameter to the allocation | |||
95 | /// instruction that is not 1. | |||
96 | bool isArrayAllocation() const; | |||
97 | ||||
98 | /// Get the number of elements allocated. For a simple allocation of a single | |||
99 | /// element, this will return a constant 1 value. | |||
100 | const Value *getArraySize() const { return getOperand(0); } | |||
101 | Value *getArraySize() { return getOperand(0); } | |||
102 | ||||
103 | /// Overload to return most specific pointer type. | |||
104 | PointerType *getType() const { | |||
105 | return cast<PointerType>(Instruction::getType()); | |||
106 | } | |||
107 | ||||
108 | /// Get allocation size in bits. Returns None if size can't be determined, | |||
109 | /// e.g. in case of a VLA. | |||
110 | Optional<TypeSize> getAllocationSizeInBits(const DataLayout &DL) const; | |||
111 | ||||
112 | /// Return the type that is being allocated by the instruction. | |||
113 | Type *getAllocatedType() const { return AllocatedType; } | |||
114 | /// for use only in special circumstances that need to generically | |||
115 | /// transform a whole instruction (eg: IR linking and vectorization). | |||
116 | void setAllocatedType(Type *Ty) { AllocatedType = Ty; } | |||
117 | ||||
118 | /// Return the alignment of the memory that is being allocated by the | |||
119 | /// instruction. | |||
120 | Align getAlign() const { | |||
121 | return Align(1ULL << getSubclassData<AlignmentField>()); | |||
122 | } | |||
123 | ||||
124 | void setAlignment(Align Align) { | |||
125 | setSubclassData<AlignmentField>(Log2(Align)); | |||
126 | } | |||
127 | ||||
128 | // FIXME: Remove this one transition to Align is over. | |||
129 | unsigned getAlignment() const { return getAlign().value(); } | |||
130 | ||||
131 | /// Return true if this alloca is in the entry block of the function and is a | |||
132 | /// constant size. If so, the code generator will fold it into the | |||
133 | /// prolog/epilog code, so it is basically free. | |||
134 | bool isStaticAlloca() const; | |||
135 | ||||
136 | /// Return true if this alloca is used as an inalloca argument to a call. Such | |||
137 | /// allocas are never considered static even if they are in the entry block. | |||
138 | bool isUsedWithInAlloca() const { | |||
139 | return getSubclassData<UsedWithInAllocaField>(); | |||
140 | } | |||
141 | ||||
142 | /// Specify whether this alloca is used to represent the arguments to a call. | |||
143 | void setUsedWithInAlloca(bool V) { | |||
144 | setSubclassData<UsedWithInAllocaField>(V); | |||
145 | } | |||
146 | ||||
147 | /// Return true if this alloca is used as a swifterror argument to a call. | |||
148 | bool isSwiftError() const { return getSubclassData<SwiftErrorField>(); } | |||
149 | /// Specify whether this alloca is used to represent a swifterror. | |||
150 | void setSwiftError(bool V) { setSubclassData<SwiftErrorField>(V); } | |||
151 | ||||
152 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
153 | static bool classof(const Instruction *I) { | |||
154 | return (I->getOpcode() == Instruction::Alloca); | |||
155 | } | |||
156 | static bool classof(const Value *V) { | |||
157 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
158 | } | |||
159 | ||||
160 | private: | |||
161 | // Shadow Instruction::setInstructionSubclassData with a private forwarding | |||
162 | // method so that subclasses cannot accidentally use it. | |||
163 | template <typename Bitfield> | |||
164 | void setSubclassData(typename Bitfield::Type Value) { | |||
165 | Instruction::setSubclassData<Bitfield>(Value); | |||
166 | } | |||
167 | }; | |||
168 | ||||
169 | //===----------------------------------------------------------------------===// | |||
170 | // LoadInst Class | |||
171 | //===----------------------------------------------------------------------===// | |||
172 | ||||
173 | /// An instruction for reading from memory. This uses the SubclassData field in | |||
174 | /// Value to store whether or not the load is volatile. | |||
175 | class LoadInst : public UnaryInstruction { | |||
176 | using VolatileField = BoolBitfieldElementT<0>; | |||
177 | using AlignmentField = AlignmentBitfieldElementT<VolatileField::NextBit>; | |||
178 | using OrderingField = AtomicOrderingBitfieldElementT<AlignmentField::NextBit>; | |||
179 | static_assert( | |||
180 | Bitfield::areContiguous<VolatileField, AlignmentField, OrderingField>(), | |||
181 | "Bitfields must be contiguous"); | |||
182 | ||||
183 | void AssertOK(); | |||
184 | ||||
185 | protected: | |||
186 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
187 | friend class Instruction; | |||
188 | ||||
189 | LoadInst *cloneImpl() const; | |||
190 | ||||
191 | public: | |||
192 | LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, | |||
193 | Instruction *InsertBefore); | |||
194 | LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, BasicBlock *InsertAtEnd); | |||
195 | LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile, | |||
196 | Instruction *InsertBefore); | |||
197 | LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile, | |||
198 | BasicBlock *InsertAtEnd); | |||
199 | LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile, | |||
200 | Align Align, Instruction *InsertBefore = nullptr); | |||
201 | LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile, | |||
202 | Align Align, BasicBlock *InsertAtEnd); | |||
203 | LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile, | |||
204 | Align Align, AtomicOrdering Order, | |||
205 | SyncScope::ID SSID = SyncScope::System, | |||
206 | Instruction *InsertBefore = nullptr); | |||
207 | LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile, | |||
208 | Align Align, AtomicOrdering Order, SyncScope::ID SSID, | |||
209 | BasicBlock *InsertAtEnd); | |||
210 | ||||
211 | /// Return true if this is a load from a volatile memory location. | |||
212 | bool isVolatile() const { return getSubclassData<VolatileField>(); } | |||
213 | ||||
214 | /// Specify whether this is a volatile load or not. | |||
215 | void setVolatile(bool V) { setSubclassData<VolatileField>(V); } | |||
216 | ||||
217 | /// Return the alignment of the access that is being performed. | |||
218 | /// FIXME: Remove this function once transition to Align is over. | |||
219 | /// Use getAlign() instead. | |||
220 | unsigned getAlignment() const { return getAlign().value(); } | |||
221 | ||||
222 | /// Return the alignment of the access that is being performed. | |||
223 | Align getAlign() const { | |||
224 | return Align(1ULL << (getSubclassData<AlignmentField>())); | |||
225 | } | |||
226 | ||||
227 | void setAlignment(Align Align) { | |||
228 | setSubclassData<AlignmentField>(Log2(Align)); | |||
229 | } | |||
230 | ||||
231 | /// Returns the ordering constraint of this load instruction. | |||
232 | AtomicOrdering getOrdering() const { | |||
233 | return getSubclassData<OrderingField>(); | |||
234 | } | |||
235 | /// Sets the ordering constraint of this load instruction. May not be Release | |||
236 | /// or AcquireRelease. | |||
237 | void setOrdering(AtomicOrdering Ordering) { | |||
238 | setSubclassData<OrderingField>(Ordering); | |||
239 | } | |||
240 | ||||
241 | /// Returns the synchronization scope ID of this load instruction. | |||
242 | SyncScope::ID getSyncScopeID() const { | |||
243 | return SSID; | |||
244 | } | |||
245 | ||||
246 | /// Sets the synchronization scope ID of this load instruction. | |||
247 | void setSyncScopeID(SyncScope::ID SSID) { | |||
248 | this->SSID = SSID; | |||
249 | } | |||
250 | ||||
251 | /// Sets the ordering constraint and the synchronization scope ID of this load | |||
252 | /// instruction. | |||
253 | void setAtomic(AtomicOrdering Ordering, | |||
254 | SyncScope::ID SSID = SyncScope::System) { | |||
255 | setOrdering(Ordering); | |||
256 | setSyncScopeID(SSID); | |||
257 | } | |||
258 | ||||
259 | bool isSimple() const { return !isAtomic() && !isVolatile(); } | |||
260 | ||||
261 | bool isUnordered() const { | |||
262 | return (getOrdering() == AtomicOrdering::NotAtomic || | |||
263 | getOrdering() == AtomicOrdering::Unordered) && | |||
264 | !isVolatile(); | |||
265 | } | |||
266 | ||||
267 | Value *getPointerOperand() { return getOperand(0); } | |||
268 | const Value *getPointerOperand() const { return getOperand(0); } | |||
269 | static unsigned getPointerOperandIndex() { return 0U; } | |||
270 | Type *getPointerOperandType() const { return getPointerOperand()->getType(); } | |||
271 | ||||
272 | /// Returns the address space of the pointer operand. | |||
273 | unsigned getPointerAddressSpace() const { | |||
274 | return getPointerOperandType()->getPointerAddressSpace(); | |||
275 | } | |||
276 | ||||
277 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
278 | static bool classof(const Instruction *I) { | |||
279 | return I->getOpcode() == Instruction::Load; | |||
280 | } | |||
281 | static bool classof(const Value *V) { | |||
282 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
283 | } | |||
284 | ||||
285 | private: | |||
286 | // Shadow Instruction::setInstructionSubclassData with a private forwarding | |||
287 | // method so that subclasses cannot accidentally use it. | |||
288 | template <typename Bitfield> | |||
289 | void setSubclassData(typename Bitfield::Type Value) { | |||
290 | Instruction::setSubclassData<Bitfield>(Value); | |||
291 | } | |||
292 | ||||
293 | /// The synchronization scope ID of this load instruction. Not quite enough | |||
294 | /// room in SubClassData for everything, so synchronization scope ID gets its | |||
295 | /// own field. | |||
296 | SyncScope::ID SSID; | |||
297 | }; | |||
298 | ||||
299 | //===----------------------------------------------------------------------===// | |||
300 | // StoreInst Class | |||
301 | //===----------------------------------------------------------------------===// | |||
302 | ||||
303 | /// An instruction for storing to memory. | |||
304 | class StoreInst : public Instruction { | |||
305 | using VolatileField = BoolBitfieldElementT<0>; | |||
306 | using AlignmentField = AlignmentBitfieldElementT<VolatileField::NextBit>; | |||
307 | using OrderingField = AtomicOrderingBitfieldElementT<AlignmentField::NextBit>; | |||
308 | static_assert( | |||
309 | Bitfield::areContiguous<VolatileField, AlignmentField, OrderingField>(), | |||
310 | "Bitfields must be contiguous"); | |||
311 | ||||
312 | void AssertOK(); | |||
313 | ||||
314 | protected: | |||
315 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
316 | friend class Instruction; | |||
317 | ||||
318 | StoreInst *cloneImpl() const; | |||
319 | ||||
320 | public: | |||
321 | StoreInst(Value *Val, Value *Ptr, Instruction *InsertBefore); | |||
322 | StoreInst(Value *Val, Value *Ptr, BasicBlock *InsertAtEnd); | |||
323 | StoreInst(Value *Val, Value *Ptr, bool isVolatile, Instruction *InsertBefore); | |||
324 | StoreInst(Value *Val, Value *Ptr, bool isVolatile, BasicBlock *InsertAtEnd); | |||
325 | StoreInst(Value *Val, Value *Ptr, bool isVolatile, Align Align, | |||
326 | Instruction *InsertBefore = nullptr); | |||
327 | StoreInst(Value *Val, Value *Ptr, bool isVolatile, Align Align, | |||
328 | BasicBlock *InsertAtEnd); | |||
329 | StoreInst(Value *Val, Value *Ptr, bool isVolatile, Align Align, | |||
330 | AtomicOrdering Order, SyncScope::ID SSID = SyncScope::System, | |||
331 | Instruction *InsertBefore = nullptr); | |||
332 | StoreInst(Value *Val, Value *Ptr, bool isVolatile, Align Align, | |||
333 | AtomicOrdering Order, SyncScope::ID SSID, BasicBlock *InsertAtEnd); | |||
334 | ||||
335 | // allocate space for exactly two operands | |||
336 | void *operator new(size_t S) { return User::operator new(S, 2); } | |||
337 | void operator delete(void *Ptr) { User::operator delete(Ptr); } | |||
338 | ||||
339 | /// Return true if this is a store to a volatile memory location. | |||
340 | bool isVolatile() const { return getSubclassData<VolatileField>(); } | |||
341 | ||||
342 | /// Specify whether this is a volatile store or not. | |||
343 | void setVolatile(bool V) { setSubclassData<VolatileField>(V); } | |||
344 | ||||
345 | /// Transparently provide more efficient getOperand methods. | |||
346 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
347 | ||||
348 | /// Return the alignment of the access that is being performed | |||
349 | /// FIXME: Remove this function once transition to Align is over. | |||
350 | /// Use getAlign() instead. | |||
351 | unsigned getAlignment() const { return getAlign().value(); } | |||
352 | ||||
353 | Align getAlign() const { | |||
354 | return Align(1ULL << (getSubclassData<AlignmentField>())); | |||
355 | } | |||
356 | ||||
357 | void setAlignment(Align Align) { | |||
358 | setSubclassData<AlignmentField>(Log2(Align)); | |||
359 | } | |||
360 | ||||
361 | /// Returns the ordering constraint of this store instruction. | |||
362 | AtomicOrdering getOrdering() const { | |||
363 | return getSubclassData<OrderingField>(); | |||
364 | } | |||
365 | ||||
366 | /// Sets the ordering constraint of this store instruction. May not be | |||
367 | /// Acquire or AcquireRelease. | |||
368 | void setOrdering(AtomicOrdering Ordering) { | |||
369 | setSubclassData<OrderingField>(Ordering); | |||
370 | } | |||
371 | ||||
372 | /// Returns the synchronization scope ID of this store instruction. | |||
373 | SyncScope::ID getSyncScopeID() const { | |||
374 | return SSID; | |||
375 | } | |||
376 | ||||
377 | /// Sets the synchronization scope ID of this store instruction. | |||
378 | void setSyncScopeID(SyncScope::ID SSID) { | |||
379 | this->SSID = SSID; | |||
380 | } | |||
381 | ||||
382 | /// Sets the ordering constraint and the synchronization scope ID of this | |||
383 | /// store instruction. | |||
384 | void setAtomic(AtomicOrdering Ordering, | |||
385 | SyncScope::ID SSID = SyncScope::System) { | |||
386 | setOrdering(Ordering); | |||
387 | setSyncScopeID(SSID); | |||
388 | } | |||
389 | ||||
390 | bool isSimple() const { return !isAtomic() && !isVolatile(); } | |||
391 | ||||
392 | bool isUnordered() const { | |||
393 | return (getOrdering() == AtomicOrdering::NotAtomic || | |||
394 | getOrdering() == AtomicOrdering::Unordered) && | |||
395 | !isVolatile(); | |||
396 | } | |||
397 | ||||
398 | Value *getValueOperand() { return getOperand(0); } | |||
399 | const Value *getValueOperand() const { return getOperand(0); } | |||
400 | ||||
401 | Value *getPointerOperand() { return getOperand(1); } | |||
402 | const Value *getPointerOperand() const { return getOperand(1); } | |||
403 | static unsigned getPointerOperandIndex() { return 1U; } | |||
404 | Type *getPointerOperandType() const { return getPointerOperand()->getType(); } | |||
405 | ||||
406 | /// Returns the address space of the pointer operand. | |||
407 | unsigned getPointerAddressSpace() const { | |||
408 | return getPointerOperandType()->getPointerAddressSpace(); | |||
409 | } | |||
410 | ||||
411 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
412 | static bool classof(const Instruction *I) { | |||
413 | return I->getOpcode() == Instruction::Store; | |||
414 | } | |||
415 | static bool classof(const Value *V) { | |||
416 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
417 | } | |||
418 | ||||
419 | private: | |||
420 | // Shadow Instruction::setInstructionSubclassData with a private forwarding | |||
421 | // method so that subclasses cannot accidentally use it. | |||
422 | template <typename Bitfield> | |||
423 | void setSubclassData(typename Bitfield::Type Value) { | |||
424 | Instruction::setSubclassData<Bitfield>(Value); | |||
425 | } | |||
426 | ||||
427 | /// The synchronization scope ID of this store instruction. Not quite enough | |||
428 | /// room in SubClassData for everything, so synchronization scope ID gets its | |||
429 | /// own field. | |||
430 | SyncScope::ID SSID; | |||
431 | }; | |||
432 | ||||
433 | template <> | |||
434 | struct OperandTraits<StoreInst> : public FixedNumOperandTraits<StoreInst, 2> { | |||
435 | }; | |||
436 | ||||
437 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(StoreInst, Value)StoreInst::op_iterator StoreInst::op_begin() { return OperandTraits <StoreInst>::op_begin(this); } StoreInst::const_op_iterator StoreInst::op_begin() const { return OperandTraits<StoreInst >::op_begin(const_cast<StoreInst*>(this)); } StoreInst ::op_iterator StoreInst::op_end() { return OperandTraits<StoreInst >::op_end(this); } StoreInst::const_op_iterator StoreInst:: op_end() const { return OperandTraits<StoreInst>::op_end (const_cast<StoreInst*>(this)); } Value *StoreInst::getOperand (unsigned i_nocapture) const { (static_cast <bool> (i_nocapture < OperandTraits<StoreInst>::operands(this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<StoreInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 437, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<StoreInst>::op_begin(const_cast <StoreInst*>(this))[i_nocapture].get()); } void StoreInst ::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<StoreInst> ::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<StoreInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 437, __extension__ __PRETTY_FUNCTION__)); OperandTraits< StoreInst>::op_begin(this)[i_nocapture] = Val_nocapture; } unsigned StoreInst::getNumOperands() const { return OperandTraits <StoreInst>::operands(this); } template <int Idx_nocapture > Use &StoreInst::Op() { return this->OpFrom<Idx_nocapture >(this); } template <int Idx_nocapture> const Use & StoreInst::Op() const { return this->OpFrom<Idx_nocapture >(this); } | |||
438 | ||||
439 | //===----------------------------------------------------------------------===// | |||
440 | // FenceInst Class | |||
441 | //===----------------------------------------------------------------------===// | |||
442 | ||||
443 | /// An instruction for ordering other memory operations. | |||
444 | class FenceInst : public Instruction { | |||
445 | using OrderingField = AtomicOrderingBitfieldElementT<0>; | |||
446 | ||||
447 | void Init(AtomicOrdering Ordering, SyncScope::ID SSID); | |||
448 | ||||
449 | protected: | |||
450 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
451 | friend class Instruction; | |||
452 | ||||
453 | FenceInst *cloneImpl() const; | |||
454 | ||||
455 | public: | |||
456 | // Ordering may only be Acquire, Release, AcquireRelease, or | |||
457 | // SequentiallyConsistent. | |||
458 | FenceInst(LLVMContext &C, AtomicOrdering Ordering, | |||
459 | SyncScope::ID SSID = SyncScope::System, | |||
460 | Instruction *InsertBefore = nullptr); | |||
461 | FenceInst(LLVMContext &C, AtomicOrdering Ordering, SyncScope::ID SSID, | |||
462 | BasicBlock *InsertAtEnd); | |||
463 | ||||
464 | // allocate space for exactly zero operands | |||
465 | void *operator new(size_t S) { return User::operator new(S, 0); } | |||
466 | void operator delete(void *Ptr) { User::operator delete(Ptr); } | |||
467 | ||||
468 | /// Returns the ordering constraint of this fence instruction. | |||
469 | AtomicOrdering getOrdering() const { | |||
470 | return getSubclassData<OrderingField>(); | |||
471 | } | |||
472 | ||||
473 | /// Sets the ordering constraint of this fence instruction. May only be | |||
474 | /// Acquire, Release, AcquireRelease, or SequentiallyConsistent. | |||
475 | void setOrdering(AtomicOrdering Ordering) { | |||
476 | setSubclassData<OrderingField>(Ordering); | |||
477 | } | |||
478 | ||||
479 | /// Returns the synchronization scope ID of this fence instruction. | |||
480 | SyncScope::ID getSyncScopeID() const { | |||
481 | return SSID; | |||
482 | } | |||
483 | ||||
484 | /// Sets the synchronization scope ID of this fence instruction. | |||
485 | void setSyncScopeID(SyncScope::ID SSID) { | |||
486 | this->SSID = SSID; | |||
487 | } | |||
488 | ||||
489 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
490 | static bool classof(const Instruction *I) { | |||
491 | return I->getOpcode() == Instruction::Fence; | |||
492 | } | |||
493 | static bool classof(const Value *V) { | |||
494 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
495 | } | |||
496 | ||||
497 | private: | |||
498 | // Shadow Instruction::setInstructionSubclassData with a private forwarding | |||
499 | // method so that subclasses cannot accidentally use it. | |||
500 | template <typename Bitfield> | |||
501 | void setSubclassData(typename Bitfield::Type Value) { | |||
502 | Instruction::setSubclassData<Bitfield>(Value); | |||
503 | } | |||
504 | ||||
505 | /// The synchronization scope ID of this fence instruction. Not quite enough | |||
506 | /// room in SubClassData for everything, so synchronization scope ID gets its | |||
507 | /// own field. | |||
508 | SyncScope::ID SSID; | |||
509 | }; | |||
510 | ||||
511 | //===----------------------------------------------------------------------===// | |||
512 | // AtomicCmpXchgInst Class | |||
513 | //===----------------------------------------------------------------------===// | |||
514 | ||||
515 | /// An instruction that atomically checks whether a | |||
516 | /// specified value is in a memory location, and, if it is, stores a new value | |||
517 | /// there. The value returned by this instruction is a pair containing the | |||
518 | /// original value as first element, and an i1 indicating success (true) or | |||
519 | /// failure (false) as second element. | |||
520 | /// | |||
521 | class AtomicCmpXchgInst : public Instruction { | |||
522 | void Init(Value *Ptr, Value *Cmp, Value *NewVal, Align Align, | |||
523 | AtomicOrdering SuccessOrdering, AtomicOrdering FailureOrdering, | |||
524 | SyncScope::ID SSID); | |||
525 | ||||
526 | template <unsigned Offset> | |||
527 | using AtomicOrderingBitfieldElement = | |||
528 | typename Bitfield::Element<AtomicOrdering, Offset, 3, | |||
529 | AtomicOrdering::LAST>; | |||
530 | ||||
531 | protected: | |||
532 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
533 | friend class Instruction; | |||
534 | ||||
535 | AtomicCmpXchgInst *cloneImpl() const; | |||
536 | ||||
537 | public: | |||
538 | AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal, Align Alignment, | |||
539 | AtomicOrdering SuccessOrdering, | |||
540 | AtomicOrdering FailureOrdering, SyncScope::ID SSID, | |||
541 | Instruction *InsertBefore = nullptr); | |||
542 | AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal, Align Alignment, | |||
543 | AtomicOrdering SuccessOrdering, | |||
544 | AtomicOrdering FailureOrdering, SyncScope::ID SSID, | |||
545 | BasicBlock *InsertAtEnd); | |||
546 | ||||
547 | // allocate space for exactly three operands | |||
548 | void *operator new(size_t S) { return User::operator new(S, 3); } | |||
549 | void operator delete(void *Ptr) { User::operator delete(Ptr); } | |||
550 | ||||
551 | using VolatileField = BoolBitfieldElementT<0>; | |||
552 | using WeakField = BoolBitfieldElementT<VolatileField::NextBit>; | |||
553 | using SuccessOrderingField = | |||
554 | AtomicOrderingBitfieldElementT<WeakField::NextBit>; | |||
555 | using FailureOrderingField = | |||
556 | AtomicOrderingBitfieldElementT<SuccessOrderingField::NextBit>; | |||
557 | using AlignmentField = | |||
558 | AlignmentBitfieldElementT<FailureOrderingField::NextBit>; | |||
559 | static_assert( | |||
560 | Bitfield::areContiguous<VolatileField, WeakField, SuccessOrderingField, | |||
561 | FailureOrderingField, AlignmentField>(), | |||
562 | "Bitfields must be contiguous"); | |||
563 | ||||
564 | /// Return the alignment of the memory that is being allocated by the | |||
565 | /// instruction. | |||
566 | Align getAlign() const { | |||
567 | return Align(1ULL << getSubclassData<AlignmentField>()); | |||
568 | } | |||
569 | ||||
570 | void setAlignment(Align Align) { | |||
571 | setSubclassData<AlignmentField>(Log2(Align)); | |||
572 | } | |||
573 | ||||
574 | /// Return true if this is a cmpxchg from a volatile memory | |||
575 | /// location. | |||
576 | /// | |||
577 | bool isVolatile() const { return getSubclassData<VolatileField>(); } | |||
578 | ||||
579 | /// Specify whether this is a volatile cmpxchg. | |||
580 | /// | |||
581 | void setVolatile(bool V) { setSubclassData<VolatileField>(V); } | |||
582 | ||||
583 | /// Return true if this cmpxchg may spuriously fail. | |||
584 | bool isWeak() const { return getSubclassData<WeakField>(); } | |||
585 | ||||
586 | void setWeak(bool IsWeak) { setSubclassData<WeakField>(IsWeak); } | |||
587 | ||||
588 | /// Transparently provide more efficient getOperand methods. | |||
589 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
590 | ||||
591 | static bool isValidSuccessOrdering(AtomicOrdering Ordering) { | |||
592 | return Ordering != AtomicOrdering::NotAtomic && | |||
593 | Ordering != AtomicOrdering::Unordered; | |||
594 | } | |||
595 | ||||
596 | static bool isValidFailureOrdering(AtomicOrdering Ordering) { | |||
597 | return Ordering != AtomicOrdering::NotAtomic && | |||
598 | Ordering != AtomicOrdering::Unordered && | |||
599 | Ordering != AtomicOrdering::AcquireRelease && | |||
600 | Ordering != AtomicOrdering::Release; | |||
601 | } | |||
602 | ||||
603 | /// Returns the success ordering constraint of this cmpxchg instruction. | |||
604 | AtomicOrdering getSuccessOrdering() const { | |||
605 | return getSubclassData<SuccessOrderingField>(); | |||
606 | } | |||
607 | ||||
608 | /// Sets the success ordering constraint of this cmpxchg instruction. | |||
609 | void setSuccessOrdering(AtomicOrdering Ordering) { | |||
610 | assert(isValidSuccessOrdering(Ordering) &&(static_cast <bool> (isValidSuccessOrdering(Ordering) && "invalid CmpXchg success ordering") ? void (0) : __assert_fail ("isValidSuccessOrdering(Ordering) && \"invalid CmpXchg success ordering\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 611, __extension__ __PRETTY_FUNCTION__)) | |||
611 | "invalid CmpXchg success ordering")(static_cast <bool> (isValidSuccessOrdering(Ordering) && "invalid CmpXchg success ordering") ? void (0) : __assert_fail ("isValidSuccessOrdering(Ordering) && \"invalid CmpXchg success ordering\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 611, __extension__ __PRETTY_FUNCTION__)); | |||
612 | setSubclassData<SuccessOrderingField>(Ordering); | |||
613 | } | |||
614 | ||||
615 | /// Returns the failure ordering constraint of this cmpxchg instruction. | |||
616 | AtomicOrdering getFailureOrdering() const { | |||
617 | return getSubclassData<FailureOrderingField>(); | |||
618 | } | |||
619 | ||||
620 | /// Sets the failure ordering constraint of this cmpxchg instruction. | |||
621 | void setFailureOrdering(AtomicOrdering Ordering) { | |||
622 | assert(isValidFailureOrdering(Ordering) &&(static_cast <bool> (isValidFailureOrdering(Ordering) && "invalid CmpXchg failure ordering") ? void (0) : __assert_fail ("isValidFailureOrdering(Ordering) && \"invalid CmpXchg failure ordering\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 623, __extension__ __PRETTY_FUNCTION__)) | |||
623 | "invalid CmpXchg failure ordering")(static_cast <bool> (isValidFailureOrdering(Ordering) && "invalid CmpXchg failure ordering") ? void (0) : __assert_fail ("isValidFailureOrdering(Ordering) && \"invalid CmpXchg failure ordering\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 623, __extension__ __PRETTY_FUNCTION__)); | |||
624 | setSubclassData<FailureOrderingField>(Ordering); | |||
625 | } | |||
626 | ||||
627 | /// Returns a single ordering which is at least as strong as both the | |||
628 | /// success and failure orderings for this cmpxchg. | |||
629 | AtomicOrdering getMergedOrdering() const { | |||
630 | if (getFailureOrdering() == AtomicOrdering::SequentiallyConsistent) | |||
631 | return AtomicOrdering::SequentiallyConsistent; | |||
632 | if (getFailureOrdering() == AtomicOrdering::Acquire) { | |||
633 | if (getSuccessOrdering() == AtomicOrdering::Monotonic) | |||
634 | return AtomicOrdering::Acquire; | |||
635 | if (getSuccessOrdering() == AtomicOrdering::Release) | |||
636 | return AtomicOrdering::AcquireRelease; | |||
637 | } | |||
638 | return getSuccessOrdering(); | |||
639 | } | |||
640 | ||||
641 | /// Returns the synchronization scope ID of this cmpxchg instruction. | |||
642 | SyncScope::ID getSyncScopeID() const { | |||
643 | return SSID; | |||
644 | } | |||
645 | ||||
646 | /// Sets the synchronization scope ID of this cmpxchg instruction. | |||
647 | void setSyncScopeID(SyncScope::ID SSID) { | |||
648 | this->SSID = SSID; | |||
649 | } | |||
650 | ||||
651 | Value *getPointerOperand() { return getOperand(0); } | |||
652 | const Value *getPointerOperand() const { return getOperand(0); } | |||
653 | static unsigned getPointerOperandIndex() { return 0U; } | |||
654 | ||||
655 | Value *getCompareOperand() { return getOperand(1); } | |||
656 | const Value *getCompareOperand() const { return getOperand(1); } | |||
657 | ||||
658 | Value *getNewValOperand() { return getOperand(2); } | |||
659 | const Value *getNewValOperand() const { return getOperand(2); } | |||
660 | ||||
661 | /// Returns the address space of the pointer operand. | |||
662 | unsigned getPointerAddressSpace() const { | |||
663 | return getPointerOperand()->getType()->getPointerAddressSpace(); | |||
664 | } | |||
665 | ||||
666 | /// Returns the strongest permitted ordering on failure, given the | |||
667 | /// desired ordering on success. | |||
668 | /// | |||
669 | /// If the comparison in a cmpxchg operation fails, there is no atomic store | |||
670 | /// so release semantics cannot be provided. So this function drops explicit | |||
671 | /// Release requests from the AtomicOrdering. A SequentiallyConsistent | |||
672 | /// operation would remain SequentiallyConsistent. | |||
673 | static AtomicOrdering | |||
674 | getStrongestFailureOrdering(AtomicOrdering SuccessOrdering) { | |||
675 | switch (SuccessOrdering) { | |||
676 | default: | |||
677 | llvm_unreachable("invalid cmpxchg success ordering")::llvm::llvm_unreachable_internal("invalid cmpxchg success ordering" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 677); | |||
678 | case AtomicOrdering::Release: | |||
679 | case AtomicOrdering::Monotonic: | |||
680 | return AtomicOrdering::Monotonic; | |||
681 | case AtomicOrdering::AcquireRelease: | |||
682 | case AtomicOrdering::Acquire: | |||
683 | return AtomicOrdering::Acquire; | |||
684 | case AtomicOrdering::SequentiallyConsistent: | |||
685 | return AtomicOrdering::SequentiallyConsistent; | |||
686 | } | |||
687 | } | |||
688 | ||||
689 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
690 | static bool classof(const Instruction *I) { | |||
691 | return I->getOpcode() == Instruction::AtomicCmpXchg; | |||
692 | } | |||
693 | static bool classof(const Value *V) { | |||
694 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
695 | } | |||
696 | ||||
697 | private: | |||
698 | // Shadow Instruction::setInstructionSubclassData with a private forwarding | |||
699 | // method so that subclasses cannot accidentally use it. | |||
700 | template <typename Bitfield> | |||
701 | void setSubclassData(typename Bitfield::Type Value) { | |||
702 | Instruction::setSubclassData<Bitfield>(Value); | |||
703 | } | |||
704 | ||||
705 | /// The synchronization scope ID of this cmpxchg instruction. Not quite | |||
706 | /// enough room in SubClassData for everything, so synchronization scope ID | |||
707 | /// gets its own field. | |||
708 | SyncScope::ID SSID; | |||
709 | }; | |||
710 | ||||
711 | template <> | |||
712 | struct OperandTraits<AtomicCmpXchgInst> : | |||
713 | public FixedNumOperandTraits<AtomicCmpXchgInst, 3> { | |||
714 | }; | |||
715 | ||||
716 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(AtomicCmpXchgInst, Value)AtomicCmpXchgInst::op_iterator AtomicCmpXchgInst::op_begin() { return OperandTraits<AtomicCmpXchgInst>::op_begin(this ); } AtomicCmpXchgInst::const_op_iterator AtomicCmpXchgInst:: op_begin() const { return OperandTraits<AtomicCmpXchgInst> ::op_begin(const_cast<AtomicCmpXchgInst*>(this)); } AtomicCmpXchgInst ::op_iterator AtomicCmpXchgInst::op_end() { return OperandTraits <AtomicCmpXchgInst>::op_end(this); } AtomicCmpXchgInst:: const_op_iterator AtomicCmpXchgInst::op_end() const { return OperandTraits <AtomicCmpXchgInst>::op_end(const_cast<AtomicCmpXchgInst *>(this)); } Value *AtomicCmpXchgInst::getOperand(unsigned i_nocapture) const { (static_cast <bool> (i_nocapture < OperandTraits<AtomicCmpXchgInst>::operands(this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<AtomicCmpXchgInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 716, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<AtomicCmpXchgInst>::op_begin (const_cast<AtomicCmpXchgInst*>(this))[i_nocapture].get ()); } void AtomicCmpXchgInst::setOperand(unsigned i_nocapture , Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<AtomicCmpXchgInst>::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<AtomicCmpXchgInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 716, __extension__ __PRETTY_FUNCTION__)); OperandTraits< AtomicCmpXchgInst>::op_begin(this)[i_nocapture] = Val_nocapture ; } unsigned AtomicCmpXchgInst::getNumOperands() const { return OperandTraits<AtomicCmpXchgInst>::operands(this); } template <int Idx_nocapture> Use &AtomicCmpXchgInst::Op() { return this->OpFrom<Idx_nocapture>(this); } template <int Idx_nocapture> const Use &AtomicCmpXchgInst:: Op() const { return this->OpFrom<Idx_nocapture>(this ); } | |||
717 | ||||
718 | //===----------------------------------------------------------------------===// | |||
719 | // AtomicRMWInst Class | |||
720 | //===----------------------------------------------------------------------===// | |||
721 | ||||
722 | /// an instruction that atomically reads a memory location, | |||
723 | /// combines it with another value, and then stores the result back. Returns | |||
724 | /// the old value. | |||
725 | /// | |||
726 | class AtomicRMWInst : public Instruction { | |||
727 | protected: | |||
728 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
729 | friend class Instruction; | |||
730 | ||||
731 | AtomicRMWInst *cloneImpl() const; | |||
732 | ||||
733 | public: | |||
734 | /// This enumeration lists the possible modifications atomicrmw can make. In | |||
735 | /// the descriptions, 'p' is the pointer to the instruction's memory location, | |||
736 | /// 'old' is the initial value of *p, and 'v' is the other value passed to the | |||
737 | /// instruction. These instructions always return 'old'. | |||
738 | enum BinOp : unsigned { | |||
739 | /// *p = v | |||
740 | Xchg, | |||
741 | /// *p = old + v | |||
742 | Add, | |||
743 | /// *p = old - v | |||
744 | Sub, | |||
745 | /// *p = old & v | |||
746 | And, | |||
747 | /// *p = ~(old & v) | |||
748 | Nand, | |||
749 | /// *p = old | v | |||
750 | Or, | |||
751 | /// *p = old ^ v | |||
752 | Xor, | |||
753 | /// *p = old >signed v ? old : v | |||
754 | Max, | |||
755 | /// *p = old <signed v ? old : v | |||
756 | Min, | |||
757 | /// *p = old >unsigned v ? old : v | |||
758 | UMax, | |||
759 | /// *p = old <unsigned v ? old : v | |||
760 | UMin, | |||
761 | ||||
762 | /// *p = old + v | |||
763 | FAdd, | |||
764 | ||||
765 | /// *p = old - v | |||
766 | FSub, | |||
767 | ||||
768 | FIRST_BINOP = Xchg, | |||
769 | LAST_BINOP = FSub, | |||
770 | BAD_BINOP | |||
771 | }; | |||
772 | ||||
773 | private: | |||
774 | template <unsigned Offset> | |||
775 | using AtomicOrderingBitfieldElement = | |||
776 | typename Bitfield::Element<AtomicOrdering, Offset, 3, | |||
777 | AtomicOrdering::LAST>; | |||
778 | ||||
779 | template <unsigned Offset> | |||
780 | using BinOpBitfieldElement = | |||
781 | typename Bitfield::Element<BinOp, Offset, 4, BinOp::LAST_BINOP>; | |||
782 | ||||
783 | public: | |||
784 | AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val, Align Alignment, | |||
785 | AtomicOrdering Ordering, SyncScope::ID SSID, | |||
786 | Instruction *InsertBefore = nullptr); | |||
787 | AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val, Align Alignment, | |||
788 | AtomicOrdering Ordering, SyncScope::ID SSID, | |||
789 | BasicBlock *InsertAtEnd); | |||
790 | ||||
791 | // allocate space for exactly two operands | |||
792 | void *operator new(size_t S) { return User::operator new(S, 2); } | |||
793 | void operator delete(void *Ptr) { User::operator delete(Ptr); } | |||
794 | ||||
795 | using VolatileField = BoolBitfieldElementT<0>; | |||
796 | using AtomicOrderingField = | |||
797 | AtomicOrderingBitfieldElementT<VolatileField::NextBit>; | |||
798 | using OperationField = BinOpBitfieldElement<AtomicOrderingField::NextBit>; | |||
799 | using AlignmentField = AlignmentBitfieldElementT<OperationField::NextBit>; | |||
800 | static_assert(Bitfield::areContiguous<VolatileField, AtomicOrderingField, | |||
801 | OperationField, AlignmentField>(), | |||
802 | "Bitfields must be contiguous"); | |||
803 | ||||
804 | BinOp getOperation() const { return getSubclassData<OperationField>(); } | |||
805 | ||||
806 | static StringRef getOperationName(BinOp Op); | |||
807 | ||||
808 | static bool isFPOperation(BinOp Op) { | |||
809 | switch (Op) { | |||
810 | case AtomicRMWInst::FAdd: | |||
811 | case AtomicRMWInst::FSub: | |||
812 | return true; | |||
813 | default: | |||
814 | return false; | |||
815 | } | |||
816 | } | |||
817 | ||||
818 | void setOperation(BinOp Operation) { | |||
819 | setSubclassData<OperationField>(Operation); | |||
820 | } | |||
821 | ||||
822 | /// Return the alignment of the memory that is being allocated by the | |||
823 | /// instruction. | |||
824 | Align getAlign() const { | |||
825 | return Align(1ULL << getSubclassData<AlignmentField>()); | |||
826 | } | |||
827 | ||||
828 | void setAlignment(Align Align) { | |||
829 | setSubclassData<AlignmentField>(Log2(Align)); | |||
830 | } | |||
831 | ||||
832 | /// Return true if this is a RMW on a volatile memory location. | |||
833 | /// | |||
834 | bool isVolatile() const { return getSubclassData<VolatileField>(); } | |||
835 | ||||
836 | /// Specify whether this is a volatile RMW or not. | |||
837 | /// | |||
838 | void setVolatile(bool V) { setSubclassData<VolatileField>(V); } | |||
839 | ||||
840 | /// Transparently provide more efficient getOperand methods. | |||
841 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
842 | ||||
843 | /// Returns the ordering constraint of this rmw instruction. | |||
844 | AtomicOrdering getOrdering() const { | |||
845 | return getSubclassData<AtomicOrderingField>(); | |||
846 | } | |||
847 | ||||
848 | /// Sets the ordering constraint of this rmw instruction. | |||
849 | void setOrdering(AtomicOrdering Ordering) { | |||
850 | assert(Ordering != AtomicOrdering::NotAtomic &&(static_cast <bool> (Ordering != AtomicOrdering::NotAtomic && "atomicrmw instructions can only be atomic.") ? void (0) : __assert_fail ("Ordering != AtomicOrdering::NotAtomic && \"atomicrmw instructions can only be atomic.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 851, __extension__ __PRETTY_FUNCTION__)) | |||
851 | "atomicrmw instructions can only be atomic.")(static_cast <bool> (Ordering != AtomicOrdering::NotAtomic && "atomicrmw instructions can only be atomic.") ? void (0) : __assert_fail ("Ordering != AtomicOrdering::NotAtomic && \"atomicrmw instructions can only be atomic.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 851, __extension__ __PRETTY_FUNCTION__)); | |||
852 | setSubclassData<AtomicOrderingField>(Ordering); | |||
853 | } | |||
854 | ||||
855 | /// Returns the synchronization scope ID of this rmw instruction. | |||
856 | SyncScope::ID getSyncScopeID() const { | |||
857 | return SSID; | |||
858 | } | |||
859 | ||||
860 | /// Sets the synchronization scope ID of this rmw instruction. | |||
861 | void setSyncScopeID(SyncScope::ID SSID) { | |||
862 | this->SSID = SSID; | |||
863 | } | |||
864 | ||||
865 | Value *getPointerOperand() { return getOperand(0); } | |||
866 | const Value *getPointerOperand() const { return getOperand(0); } | |||
867 | static unsigned getPointerOperandIndex() { return 0U; } | |||
868 | ||||
869 | Value *getValOperand() { return getOperand(1); } | |||
870 | const Value *getValOperand() const { return getOperand(1); } | |||
871 | ||||
872 | /// Returns the address space of the pointer operand. | |||
873 | unsigned getPointerAddressSpace() const { | |||
874 | return getPointerOperand()->getType()->getPointerAddressSpace(); | |||
875 | } | |||
876 | ||||
877 | bool isFloatingPointOperation() const { | |||
878 | return isFPOperation(getOperation()); | |||
879 | } | |||
880 | ||||
881 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
882 | static bool classof(const Instruction *I) { | |||
883 | return I->getOpcode() == Instruction::AtomicRMW; | |||
884 | } | |||
885 | static bool classof(const Value *V) { | |||
886 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
887 | } | |||
888 | ||||
889 | private: | |||
890 | void Init(BinOp Operation, Value *Ptr, Value *Val, Align Align, | |||
891 | AtomicOrdering Ordering, SyncScope::ID SSID); | |||
892 | ||||
893 | // Shadow Instruction::setInstructionSubclassData with a private forwarding | |||
894 | // method so that subclasses cannot accidentally use it. | |||
895 | template <typename Bitfield> | |||
896 | void setSubclassData(typename Bitfield::Type Value) { | |||
897 | Instruction::setSubclassData<Bitfield>(Value); | |||
898 | } | |||
899 | ||||
900 | /// The synchronization scope ID of this rmw instruction. Not quite enough | |||
901 | /// room in SubClassData for everything, so synchronization scope ID gets its | |||
902 | /// own field. | |||
903 | SyncScope::ID SSID; | |||
904 | }; | |||
905 | ||||
906 | template <> | |||
907 | struct OperandTraits<AtomicRMWInst> | |||
908 | : public FixedNumOperandTraits<AtomicRMWInst,2> { | |||
909 | }; | |||
910 | ||||
911 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(AtomicRMWInst, Value)AtomicRMWInst::op_iterator AtomicRMWInst::op_begin() { return OperandTraits<AtomicRMWInst>::op_begin(this); } AtomicRMWInst ::const_op_iterator AtomicRMWInst::op_begin() const { return OperandTraits <AtomicRMWInst>::op_begin(const_cast<AtomicRMWInst*> (this)); } AtomicRMWInst::op_iterator AtomicRMWInst::op_end() { return OperandTraits<AtomicRMWInst>::op_end(this); } AtomicRMWInst::const_op_iterator AtomicRMWInst::op_end() const { return OperandTraits<AtomicRMWInst>::op_end(const_cast <AtomicRMWInst*>(this)); } Value *AtomicRMWInst::getOperand (unsigned i_nocapture) const { (static_cast <bool> (i_nocapture < OperandTraits<AtomicRMWInst>::operands(this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<AtomicRMWInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 911, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<AtomicRMWInst>::op_begin(const_cast <AtomicRMWInst*>(this))[i_nocapture].get()); } void AtomicRMWInst ::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<AtomicRMWInst >::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<AtomicRMWInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 911, __extension__ __PRETTY_FUNCTION__)); OperandTraits< AtomicRMWInst>::op_begin(this)[i_nocapture] = Val_nocapture ; } unsigned AtomicRMWInst::getNumOperands() const { return OperandTraits <AtomicRMWInst>::operands(this); } template <int Idx_nocapture > Use &AtomicRMWInst::Op() { return this->OpFrom< Idx_nocapture>(this); } template <int Idx_nocapture> const Use &AtomicRMWInst::Op() const { return this->OpFrom <Idx_nocapture>(this); } | |||
912 | ||||
913 | //===----------------------------------------------------------------------===// | |||
914 | // GetElementPtrInst Class | |||
915 | //===----------------------------------------------------------------------===// | |||
916 | ||||
917 | // checkGEPType - Simple wrapper function to give a better assertion failure | |||
918 | // message on bad indexes for a gep instruction. | |||
919 | // | |||
920 | inline Type *checkGEPType(Type *Ty) { | |||
921 | assert(Ty && "Invalid GetElementPtrInst indices for type!")(static_cast <bool> (Ty && "Invalid GetElementPtrInst indices for type!" ) ? void (0) : __assert_fail ("Ty && \"Invalid GetElementPtrInst indices for type!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 921, __extension__ __PRETTY_FUNCTION__)); | |||
922 | return Ty; | |||
923 | } | |||
924 | ||||
925 | /// an instruction for type-safe pointer arithmetic to | |||
926 | /// access elements of arrays and structs | |||
927 | /// | |||
928 | class GetElementPtrInst : public Instruction { | |||
929 | Type *SourceElementType; | |||
930 | Type *ResultElementType; | |||
931 | ||||
932 | GetElementPtrInst(const GetElementPtrInst &GEPI); | |||
933 | ||||
934 | /// Constructors - Create a getelementptr instruction with a base pointer an | |||
935 | /// list of indices. The first ctor can optionally insert before an existing | |||
936 | /// instruction, the second appends the new instruction to the specified | |||
937 | /// BasicBlock. | |||
938 | inline GetElementPtrInst(Type *PointeeType, Value *Ptr, | |||
939 | ArrayRef<Value *> IdxList, unsigned Values, | |||
940 | const Twine &NameStr, Instruction *InsertBefore); | |||
941 | inline GetElementPtrInst(Type *PointeeType, Value *Ptr, | |||
942 | ArrayRef<Value *> IdxList, unsigned Values, | |||
943 | const Twine &NameStr, BasicBlock *InsertAtEnd); | |||
944 | ||||
945 | void init(Value *Ptr, ArrayRef<Value *> IdxList, const Twine &NameStr); | |||
946 | ||||
947 | protected: | |||
948 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
949 | friend class Instruction; | |||
950 | ||||
951 | GetElementPtrInst *cloneImpl() const; | |||
952 | ||||
953 | public: | |||
954 | static GetElementPtrInst *Create(Type *PointeeType, Value *Ptr, | |||
955 | ArrayRef<Value *> IdxList, | |||
956 | const Twine &NameStr = "", | |||
957 | Instruction *InsertBefore = nullptr) { | |||
958 | unsigned Values = 1 + unsigned(IdxList.size()); | |||
959 | assert(PointeeType && "Must specify element type")(static_cast <bool> (PointeeType && "Must specify element type" ) ? void (0) : __assert_fail ("PointeeType && \"Must specify element type\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 959, __extension__ __PRETTY_FUNCTION__)); | |||
960 | assert(cast<PointerType>(Ptr->getType()->getScalarType())(static_cast <bool> (cast<PointerType>(Ptr->getType ()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType )) ? void (0) : __assert_fail ("cast<PointerType>(Ptr->getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType)" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 961, __extension__ __PRETTY_FUNCTION__)) | |||
961 | ->isOpaqueOrPointeeTypeMatches(PointeeType))(static_cast <bool> (cast<PointerType>(Ptr->getType ()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType )) ? void (0) : __assert_fail ("cast<PointerType>(Ptr->getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType)" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 961, __extension__ __PRETTY_FUNCTION__)); | |||
962 | return new (Values) GetElementPtrInst(PointeeType, Ptr, IdxList, Values, | |||
963 | NameStr, InsertBefore); | |||
964 | } | |||
965 | ||||
966 | static GetElementPtrInst *Create(Type *PointeeType, Value *Ptr, | |||
967 | ArrayRef<Value *> IdxList, | |||
968 | const Twine &NameStr, | |||
969 | BasicBlock *InsertAtEnd) { | |||
970 | unsigned Values = 1 + unsigned(IdxList.size()); | |||
971 | assert(PointeeType && "Must specify element type")(static_cast <bool> (PointeeType && "Must specify element type" ) ? void (0) : __assert_fail ("PointeeType && \"Must specify element type\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 971, __extension__ __PRETTY_FUNCTION__)); | |||
972 | assert(cast<PointerType>(Ptr->getType()->getScalarType())(static_cast <bool> (cast<PointerType>(Ptr->getType ()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType )) ? void (0) : __assert_fail ("cast<PointerType>(Ptr->getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType)" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 973, __extension__ __PRETTY_FUNCTION__)) | |||
973 | ->isOpaqueOrPointeeTypeMatches(PointeeType))(static_cast <bool> (cast<PointerType>(Ptr->getType ()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType )) ? void (0) : __assert_fail ("cast<PointerType>(Ptr->getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType)" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 973, __extension__ __PRETTY_FUNCTION__)); | |||
974 | return new (Values) GetElementPtrInst(PointeeType, Ptr, IdxList, Values, | |||
975 | NameStr, InsertAtEnd); | |||
976 | } | |||
977 | ||||
978 | LLVM_ATTRIBUTE_DEPRECATED(static GetElementPtrInst *CreateInBounds([[deprecated("Use the version with explicit element type instead" )]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef <Value *> IdxList, const Twine &NameStr = "", Instruction *InsertBefore = nullptr) | |||
979 | Value *Ptr, ArrayRef<Value *> IdxList, const Twine &NameStr = "",[[deprecated("Use the version with explicit element type instead" )]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef <Value *> IdxList, const Twine &NameStr = "", Instruction *InsertBefore = nullptr) | |||
980 | Instruction *InsertBefore = nullptr),[[deprecated("Use the version with explicit element type instead" )]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef <Value *> IdxList, const Twine &NameStr = "", Instruction *InsertBefore = nullptr) | |||
981 | "Use the version with explicit element type instead")[[deprecated("Use the version with explicit element type instead" )]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef <Value *> IdxList, const Twine &NameStr = "", Instruction *InsertBefore = nullptr) { | |||
982 | return CreateInBounds( | |||
983 | Ptr->getType()->getScalarType()->getPointerElementType(), Ptr, IdxList, | |||
984 | NameStr, InsertBefore); | |||
985 | } | |||
986 | ||||
987 | /// Create an "inbounds" getelementptr. See the documentation for the | |||
988 | /// "inbounds" flag in LangRef.html for details. | |||
989 | static GetElementPtrInst * | |||
990 | CreateInBounds(Type *PointeeType, Value *Ptr, ArrayRef<Value *> IdxList, | |||
991 | const Twine &NameStr = "", | |||
992 | Instruction *InsertBefore = nullptr) { | |||
993 | GetElementPtrInst *GEP = | |||
994 | Create(PointeeType, Ptr, IdxList, NameStr, InsertBefore); | |||
995 | GEP->setIsInBounds(true); | |||
996 | return GEP; | |||
997 | } | |||
998 | ||||
999 | LLVM_ATTRIBUTE_DEPRECATED(static GetElementPtrInst *CreateInBounds([[deprecated("Use the version with explicit element type instead" )]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef <Value *> IdxList, const Twine &NameStr, BasicBlock *InsertAtEnd) | |||
1000 | Value *Ptr, ArrayRef<Value *> IdxList, const Twine &NameStr,[[deprecated("Use the version with explicit element type instead" )]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef <Value *> IdxList, const Twine &NameStr, BasicBlock *InsertAtEnd) | |||
1001 | BasicBlock *InsertAtEnd),[[deprecated("Use the version with explicit element type instead" )]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef <Value *> IdxList, const Twine &NameStr, BasicBlock *InsertAtEnd) | |||
1002 | "Use the version with explicit element type instead")[[deprecated("Use the version with explicit element type instead" )]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef <Value *> IdxList, const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
1003 | return CreateInBounds( | |||
1004 | Ptr->getType()->getScalarType()->getPointerElementType(), Ptr, IdxList, | |||
1005 | NameStr, InsertAtEnd); | |||
1006 | } | |||
1007 | ||||
1008 | static GetElementPtrInst *CreateInBounds(Type *PointeeType, Value *Ptr, | |||
1009 | ArrayRef<Value *> IdxList, | |||
1010 | const Twine &NameStr, | |||
1011 | BasicBlock *InsertAtEnd) { | |||
1012 | GetElementPtrInst *GEP = | |||
1013 | Create(PointeeType, Ptr, IdxList, NameStr, InsertAtEnd); | |||
1014 | GEP->setIsInBounds(true); | |||
1015 | return GEP; | |||
1016 | } | |||
1017 | ||||
1018 | /// Transparently provide more efficient getOperand methods. | |||
1019 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
1020 | ||||
1021 | Type *getSourceElementType() const { return SourceElementType; } | |||
1022 | ||||
1023 | void setSourceElementType(Type *Ty) { SourceElementType = Ty; } | |||
1024 | void setResultElementType(Type *Ty) { ResultElementType = Ty; } | |||
1025 | ||||
1026 | Type *getResultElementType() const { | |||
1027 | assert(cast<PointerType>(getType()->getScalarType())(static_cast <bool> (cast<PointerType>(getType()-> getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType )) ? void (0) : __assert_fail ("cast<PointerType>(getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType)" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1028, __extension__ __PRETTY_FUNCTION__)) | |||
1028 | ->isOpaqueOrPointeeTypeMatches(ResultElementType))(static_cast <bool> (cast<PointerType>(getType()-> getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType )) ? void (0) : __assert_fail ("cast<PointerType>(getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType)" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1028, __extension__ __PRETTY_FUNCTION__)); | |||
1029 | return ResultElementType; | |||
1030 | } | |||
1031 | ||||
1032 | /// Returns the address space of this instruction's pointer type. | |||
1033 | unsigned getAddressSpace() const { | |||
1034 | // Note that this is always the same as the pointer operand's address space | |||
1035 | // and that is cheaper to compute, so cheat here. | |||
1036 | return getPointerAddressSpace(); | |||
1037 | } | |||
1038 | ||||
1039 | /// Returns the result type of a getelementptr with the given source | |||
1040 | /// element type and indexes. | |||
1041 | /// | |||
1042 | /// Null is returned if the indices are invalid for the specified | |||
1043 | /// source element type. | |||
1044 | static Type *getIndexedType(Type *Ty, ArrayRef<Value *> IdxList); | |||
1045 | static Type *getIndexedType(Type *Ty, ArrayRef<Constant *> IdxList); | |||
1046 | static Type *getIndexedType(Type *Ty, ArrayRef<uint64_t> IdxList); | |||
1047 | ||||
1048 | /// Return the type of the element at the given index of an indexable | |||
1049 | /// type. This is equivalent to "getIndexedType(Agg, {Zero, Idx})". | |||
1050 | /// | |||
1051 | /// Returns null if the type can't be indexed, or the given index is not | |||
1052 | /// legal for the given type. | |||
1053 | static Type *getTypeAtIndex(Type *Ty, Value *Idx); | |||
1054 | static Type *getTypeAtIndex(Type *Ty, uint64_t Idx); | |||
1055 | ||||
1056 | inline op_iterator idx_begin() { return op_begin()+1; } | |||
1057 | inline const_op_iterator idx_begin() const { return op_begin()+1; } | |||
1058 | inline op_iterator idx_end() { return op_end(); } | |||
1059 | inline const_op_iterator idx_end() const { return op_end(); } | |||
1060 | ||||
1061 | inline iterator_range<op_iterator> indices() { | |||
1062 | return make_range(idx_begin(), idx_end()); | |||
1063 | } | |||
1064 | ||||
1065 | inline iterator_range<const_op_iterator> indices() const { | |||
1066 | return make_range(idx_begin(), idx_end()); | |||
1067 | } | |||
1068 | ||||
1069 | Value *getPointerOperand() { | |||
1070 | return getOperand(0); | |||
1071 | } | |||
1072 | const Value *getPointerOperand() const { | |||
1073 | return getOperand(0); | |||
1074 | } | |||
1075 | static unsigned getPointerOperandIndex() { | |||
1076 | return 0U; // get index for modifying correct operand. | |||
1077 | } | |||
1078 | ||||
1079 | /// Method to return the pointer operand as a | |||
1080 | /// PointerType. | |||
1081 | Type *getPointerOperandType() const { | |||
1082 | return getPointerOperand()->getType(); | |||
1083 | } | |||
1084 | ||||
1085 | /// Returns the address space of the pointer operand. | |||
1086 | unsigned getPointerAddressSpace() const { | |||
1087 | return getPointerOperandType()->getPointerAddressSpace(); | |||
1088 | } | |||
1089 | ||||
1090 | /// Returns the pointer type returned by the GEP | |||
1091 | /// instruction, which may be a vector of pointers. | |||
1092 | static Type *getGEPReturnType(Type *ElTy, Value *Ptr, | |||
1093 | ArrayRef<Value *> IdxList) { | |||
1094 | PointerType *OrigPtrTy = cast<PointerType>(Ptr->getType()->getScalarType()); | |||
1095 | unsigned AddrSpace = OrigPtrTy->getAddressSpace(); | |||
1096 | Type *ResultElemTy = checkGEPType(getIndexedType(ElTy, IdxList)); | |||
1097 | Type *PtrTy = OrigPtrTy->isOpaque() | |||
1098 | ? PointerType::get(OrigPtrTy->getContext(), AddrSpace) | |||
1099 | : PointerType::get(ResultElemTy, AddrSpace); | |||
1100 | // Vector GEP | |||
1101 | if (auto *PtrVTy = dyn_cast<VectorType>(Ptr->getType())) { | |||
1102 | ElementCount EltCount = PtrVTy->getElementCount(); | |||
1103 | return VectorType::get(PtrTy, EltCount); | |||
1104 | } | |||
1105 | for (Value *Index : IdxList) | |||
1106 | if (auto *IndexVTy = dyn_cast<VectorType>(Index->getType())) { | |||
1107 | ElementCount EltCount = IndexVTy->getElementCount(); | |||
1108 | return VectorType::get(PtrTy, EltCount); | |||
1109 | } | |||
1110 | // Scalar GEP | |||
1111 | return PtrTy; | |||
1112 | } | |||
1113 | ||||
1114 | unsigned getNumIndices() const { // Note: always non-negative | |||
1115 | return getNumOperands() - 1; | |||
1116 | } | |||
1117 | ||||
1118 | bool hasIndices() const { | |||
1119 | return getNumOperands() > 1; | |||
1120 | } | |||
1121 | ||||
1122 | /// Return true if all of the indices of this GEP are | |||
1123 | /// zeros. If so, the result pointer and the first operand have the same | |||
1124 | /// value, just potentially different types. | |||
1125 | bool hasAllZeroIndices() const; | |||
1126 | ||||
1127 | /// Return true if all of the indices of this GEP are | |||
1128 | /// constant integers. If so, the result pointer and the first operand have | |||
1129 | /// a constant offset between them. | |||
1130 | bool hasAllConstantIndices() const; | |||
1131 | ||||
1132 | /// Set or clear the inbounds flag on this GEP instruction. | |||
1133 | /// See LangRef.html for the meaning of inbounds on a getelementptr. | |||
1134 | void setIsInBounds(bool b = true); | |||
1135 | ||||
1136 | /// Determine whether the GEP has the inbounds flag. | |||
1137 | bool isInBounds() const; | |||
1138 | ||||
1139 | /// Accumulate the constant address offset of this GEP if possible. | |||
1140 | /// | |||
1141 | /// This routine accepts an APInt into which it will accumulate the constant | |||
1142 | /// offset of this GEP if the GEP is in fact constant. If the GEP is not | |||
1143 | /// all-constant, it returns false and the value of the offset APInt is | |||
1144 | /// undefined (it is *not* preserved!). The APInt passed into this routine | |||
1145 | /// must be at least as wide as the IntPtr type for the address space of | |||
1146 | /// the base GEP pointer. | |||
1147 | bool accumulateConstantOffset(const DataLayout &DL, APInt &Offset) const; | |||
1148 | bool collectOffset(const DataLayout &DL, unsigned BitWidth, | |||
1149 | MapVector<Value *, APInt> &VariableOffsets, | |||
1150 | APInt &ConstantOffset) const; | |||
1151 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
1152 | static bool classof(const Instruction *I) { | |||
1153 | return (I->getOpcode() == Instruction::GetElementPtr); | |||
1154 | } | |||
1155 | static bool classof(const Value *V) { | |||
1156 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
1157 | } | |||
1158 | }; | |||
1159 | ||||
1160 | template <> | |||
1161 | struct OperandTraits<GetElementPtrInst> : | |||
1162 | public VariadicOperandTraits<GetElementPtrInst, 1> { | |||
1163 | }; | |||
1164 | ||||
1165 | GetElementPtrInst::GetElementPtrInst(Type *PointeeType, Value *Ptr, | |||
1166 | ArrayRef<Value *> IdxList, unsigned Values, | |||
1167 | const Twine &NameStr, | |||
1168 | Instruction *InsertBefore) | |||
1169 | : Instruction(getGEPReturnType(PointeeType, Ptr, IdxList), GetElementPtr, | |||
1170 | OperandTraits<GetElementPtrInst>::op_end(this) - Values, | |||
1171 | Values, InsertBefore), | |||
1172 | SourceElementType(PointeeType), | |||
1173 | ResultElementType(getIndexedType(PointeeType, IdxList)) { | |||
1174 | assert(cast<PointerType>(getType()->getScalarType())(static_cast <bool> (cast<PointerType>(getType()-> getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType )) ? void (0) : __assert_fail ("cast<PointerType>(getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType)" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1175, __extension__ __PRETTY_FUNCTION__)) | |||
1175 | ->isOpaqueOrPointeeTypeMatches(ResultElementType))(static_cast <bool> (cast<PointerType>(getType()-> getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType )) ? void (0) : __assert_fail ("cast<PointerType>(getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType)" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1175, __extension__ __PRETTY_FUNCTION__)); | |||
1176 | init(Ptr, IdxList, NameStr); | |||
1177 | } | |||
1178 | ||||
1179 | GetElementPtrInst::GetElementPtrInst(Type *PointeeType, Value *Ptr, | |||
1180 | ArrayRef<Value *> IdxList, unsigned Values, | |||
1181 | const Twine &NameStr, | |||
1182 | BasicBlock *InsertAtEnd) | |||
1183 | : Instruction(getGEPReturnType(PointeeType, Ptr, IdxList), GetElementPtr, | |||
1184 | OperandTraits<GetElementPtrInst>::op_end(this) - Values, | |||
1185 | Values, InsertAtEnd), | |||
1186 | SourceElementType(PointeeType), | |||
1187 | ResultElementType(getIndexedType(PointeeType, IdxList)) { | |||
1188 | assert(cast<PointerType>(getType()->getScalarType())(static_cast <bool> (cast<PointerType>(getType()-> getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType )) ? void (0) : __assert_fail ("cast<PointerType>(getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType)" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1189, __extension__ __PRETTY_FUNCTION__)) | |||
1189 | ->isOpaqueOrPointeeTypeMatches(ResultElementType))(static_cast <bool> (cast<PointerType>(getType()-> getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType )) ? void (0) : __assert_fail ("cast<PointerType>(getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType)" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1189, __extension__ __PRETTY_FUNCTION__)); | |||
1190 | init(Ptr, IdxList, NameStr); | |||
1191 | } | |||
1192 | ||||
1193 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(GetElementPtrInst, Value)GetElementPtrInst::op_iterator GetElementPtrInst::op_begin() { return OperandTraits<GetElementPtrInst>::op_begin(this ); } GetElementPtrInst::const_op_iterator GetElementPtrInst:: op_begin() const { return OperandTraits<GetElementPtrInst> ::op_begin(const_cast<GetElementPtrInst*>(this)); } GetElementPtrInst ::op_iterator GetElementPtrInst::op_end() { return OperandTraits <GetElementPtrInst>::op_end(this); } GetElementPtrInst:: const_op_iterator GetElementPtrInst::op_end() const { return OperandTraits <GetElementPtrInst>::op_end(const_cast<GetElementPtrInst *>(this)); } Value *GetElementPtrInst::getOperand(unsigned i_nocapture) const { (static_cast <bool> (i_nocapture < OperandTraits<GetElementPtrInst>::operands(this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<GetElementPtrInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1193, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<GetElementPtrInst>::op_begin (const_cast<GetElementPtrInst*>(this))[i_nocapture].get ()); } void GetElementPtrInst::setOperand(unsigned i_nocapture , Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<GetElementPtrInst>::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<GetElementPtrInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1193, __extension__ __PRETTY_FUNCTION__)); OperandTraits< GetElementPtrInst>::op_begin(this)[i_nocapture] = Val_nocapture ; } unsigned GetElementPtrInst::getNumOperands() const { return OperandTraits<GetElementPtrInst>::operands(this); } template <int Idx_nocapture> Use &GetElementPtrInst::Op() { return this->OpFrom<Idx_nocapture>(this); } template <int Idx_nocapture> const Use &GetElementPtrInst:: Op() const { return this->OpFrom<Idx_nocapture>(this ); } | |||
1194 | ||||
1195 | //===----------------------------------------------------------------------===// | |||
1196 | // ICmpInst Class | |||
1197 | //===----------------------------------------------------------------------===// | |||
1198 | ||||
1199 | /// This instruction compares its operands according to the predicate given | |||
1200 | /// to the constructor. It only operates on integers or pointers. The operands | |||
1201 | /// must be identical types. | |||
1202 | /// Represent an integer comparison operator. | |||
1203 | class ICmpInst: public CmpInst { | |||
1204 | void AssertOK() { | |||
1205 | assert(isIntPredicate() &&(static_cast <bool> (isIntPredicate() && "Invalid ICmp predicate value" ) ? void (0) : __assert_fail ("isIntPredicate() && \"Invalid ICmp predicate value\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1206, __extension__ __PRETTY_FUNCTION__)) | |||
1206 | "Invalid ICmp predicate value")(static_cast <bool> (isIntPredicate() && "Invalid ICmp predicate value" ) ? void (0) : __assert_fail ("isIntPredicate() && \"Invalid ICmp predicate value\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1206, __extension__ __PRETTY_FUNCTION__)); | |||
1207 | assert(getOperand(0)->getType() == getOperand(1)->getType() &&(static_cast <bool> (getOperand(0)->getType() == getOperand (1)->getType() && "Both operands to ICmp instruction are not of the same type!" ) ? void (0) : __assert_fail ("getOperand(0)->getType() == getOperand(1)->getType() && \"Both operands to ICmp instruction are not of the same type!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1208, __extension__ __PRETTY_FUNCTION__)) | |||
1208 | "Both operands to ICmp instruction are not of the same type!")(static_cast <bool> (getOperand(0)->getType() == getOperand (1)->getType() && "Both operands to ICmp instruction are not of the same type!" ) ? void (0) : __assert_fail ("getOperand(0)->getType() == getOperand(1)->getType() && \"Both operands to ICmp instruction are not of the same type!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1208, __extension__ __PRETTY_FUNCTION__)); | |||
1209 | // Check that the operands are the right type | |||
1210 | assert((getOperand(0)->getType()->isIntOrIntVectorTy() ||(static_cast <bool> ((getOperand(0)->getType()->isIntOrIntVectorTy () || getOperand(0)->getType()->isPtrOrPtrVectorTy()) && "Invalid operand types for ICmp instruction") ? void (0) : __assert_fail ("(getOperand(0)->getType()->isIntOrIntVectorTy() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) && \"Invalid operand types for ICmp instruction\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1212, __extension__ __PRETTY_FUNCTION__)) | |||
1211 | getOperand(0)->getType()->isPtrOrPtrVectorTy()) &&(static_cast <bool> ((getOperand(0)->getType()->isIntOrIntVectorTy () || getOperand(0)->getType()->isPtrOrPtrVectorTy()) && "Invalid operand types for ICmp instruction") ? void (0) : __assert_fail ("(getOperand(0)->getType()->isIntOrIntVectorTy() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) && \"Invalid operand types for ICmp instruction\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1212, __extension__ __PRETTY_FUNCTION__)) | |||
1212 | "Invalid operand types for ICmp instruction")(static_cast <bool> ((getOperand(0)->getType()->isIntOrIntVectorTy () || getOperand(0)->getType()->isPtrOrPtrVectorTy()) && "Invalid operand types for ICmp instruction") ? void (0) : __assert_fail ("(getOperand(0)->getType()->isIntOrIntVectorTy() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) && \"Invalid operand types for ICmp instruction\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1212, __extension__ __PRETTY_FUNCTION__)); | |||
1213 | } | |||
1214 | ||||
1215 | protected: | |||
1216 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
1217 | friend class Instruction; | |||
1218 | ||||
1219 | /// Clone an identical ICmpInst | |||
1220 | ICmpInst *cloneImpl() const; | |||
1221 | ||||
1222 | public: | |||
1223 | /// Constructor with insert-before-instruction semantics. | |||
1224 | ICmpInst( | |||
1225 | Instruction *InsertBefore, ///< Where to insert | |||
1226 | Predicate pred, ///< The predicate to use for the comparison | |||
1227 | Value *LHS, ///< The left-hand-side of the expression | |||
1228 | Value *RHS, ///< The right-hand-side of the expression | |||
1229 | const Twine &NameStr = "" ///< Name of the instruction | |||
1230 | ) : CmpInst(makeCmpResultType(LHS->getType()), | |||
1231 | Instruction::ICmp, pred, LHS, RHS, NameStr, | |||
1232 | InsertBefore) { | |||
1233 | #ifndef NDEBUG | |||
1234 | AssertOK(); | |||
1235 | #endif | |||
1236 | } | |||
1237 | ||||
1238 | /// Constructor with insert-at-end semantics. | |||
1239 | ICmpInst( | |||
1240 | BasicBlock &InsertAtEnd, ///< Block to insert into. | |||
1241 | Predicate pred, ///< The predicate to use for the comparison | |||
1242 | Value *LHS, ///< The left-hand-side of the expression | |||
1243 | Value *RHS, ///< The right-hand-side of the expression | |||
1244 | const Twine &NameStr = "" ///< Name of the instruction | |||
1245 | ) : CmpInst(makeCmpResultType(LHS->getType()), | |||
1246 | Instruction::ICmp, pred, LHS, RHS, NameStr, | |||
1247 | &InsertAtEnd) { | |||
1248 | #ifndef NDEBUG | |||
1249 | AssertOK(); | |||
1250 | #endif | |||
1251 | } | |||
1252 | ||||
1253 | /// Constructor with no-insertion semantics | |||
1254 | ICmpInst( | |||
1255 | Predicate pred, ///< The predicate to use for the comparison | |||
1256 | Value *LHS, ///< The left-hand-side of the expression | |||
1257 | Value *RHS, ///< The right-hand-side of the expression | |||
1258 | const Twine &NameStr = "" ///< Name of the instruction | |||
1259 | ) : CmpInst(makeCmpResultType(LHS->getType()), | |||
1260 | Instruction::ICmp, pred, LHS, RHS, NameStr) { | |||
1261 | #ifndef NDEBUG | |||
1262 | AssertOK(); | |||
1263 | #endif | |||
1264 | } | |||
1265 | ||||
1266 | /// For example, EQ->EQ, SLE->SLE, UGT->SGT, etc. | |||
1267 | /// @returns the predicate that would be the result if the operand were | |||
1268 | /// regarded as signed. | |||
1269 | /// Return the signed version of the predicate | |||
1270 | Predicate getSignedPredicate() const { | |||
1271 | return getSignedPredicate(getPredicate()); | |||
1272 | } | |||
1273 | ||||
1274 | /// This is a static version that you can use without an instruction. | |||
1275 | /// Return the signed version of the predicate. | |||
1276 | static Predicate getSignedPredicate(Predicate pred); | |||
1277 | ||||
1278 | /// For example, EQ->EQ, SLE->ULE, UGT->UGT, etc. | |||
1279 | /// @returns the predicate that would be the result if the operand were | |||
1280 | /// regarded as unsigned. | |||
1281 | /// Return the unsigned version of the predicate | |||
1282 | Predicate getUnsignedPredicate() const { | |||
1283 | return getUnsignedPredicate(getPredicate()); | |||
1284 | } | |||
1285 | ||||
1286 | /// This is a static version that you can use without an instruction. | |||
1287 | /// Return the unsigned version of the predicate. | |||
1288 | static Predicate getUnsignedPredicate(Predicate pred); | |||
1289 | ||||
1290 | /// Return true if this predicate is either EQ or NE. This also | |||
1291 | /// tests for commutativity. | |||
1292 | static bool isEquality(Predicate P) { | |||
1293 | return P == ICMP_EQ || P == ICMP_NE; | |||
1294 | } | |||
1295 | ||||
1296 | /// Return true if this predicate is either EQ or NE. This also | |||
1297 | /// tests for commutativity. | |||
1298 | bool isEquality() const { | |||
1299 | return isEquality(getPredicate()); | |||
1300 | } | |||
1301 | ||||
1302 | /// @returns true if the predicate of this ICmpInst is commutative | |||
1303 | /// Determine if this relation is commutative. | |||
1304 | bool isCommutative() const { return isEquality(); } | |||
1305 | ||||
1306 | /// Return true if the predicate is relational (not EQ or NE). | |||
1307 | /// | |||
1308 | bool isRelational() const { | |||
1309 | return !isEquality(); | |||
1310 | } | |||
1311 | ||||
1312 | /// Return true if the predicate is relational (not EQ or NE). | |||
1313 | /// | |||
1314 | static bool isRelational(Predicate P) { | |||
1315 | return !isEquality(P); | |||
1316 | } | |||
1317 | ||||
1318 | /// Return true if the predicate is SGT or UGT. | |||
1319 | /// | |||
1320 | static bool isGT(Predicate P) { | |||
1321 | return P == ICMP_SGT || P == ICMP_UGT; | |||
1322 | } | |||
1323 | ||||
1324 | /// Return true if the predicate is SLT or ULT. | |||
1325 | /// | |||
1326 | static bool isLT(Predicate P) { | |||
1327 | return P == ICMP_SLT || P == ICMP_ULT; | |||
1328 | } | |||
1329 | ||||
1330 | /// Return true if the predicate is SGE or UGE. | |||
1331 | /// | |||
1332 | static bool isGE(Predicate P) { | |||
1333 | return P == ICMP_SGE || P == ICMP_UGE; | |||
1334 | } | |||
1335 | ||||
1336 | /// Return true if the predicate is SLE or ULE. | |||
1337 | /// | |||
1338 | static bool isLE(Predicate P) { | |||
1339 | return P == ICMP_SLE || P == ICMP_ULE; | |||
1340 | } | |||
1341 | ||||
1342 | /// Exchange the two operands to this instruction in such a way that it does | |||
1343 | /// not modify the semantics of the instruction. The predicate value may be | |||
1344 | /// changed to retain the same result if the predicate is order dependent | |||
1345 | /// (e.g. ult). | |||
1346 | /// Swap operands and adjust predicate. | |||
1347 | void swapOperands() { | |||
1348 | setPredicate(getSwappedPredicate()); | |||
1349 | Op<0>().swap(Op<1>()); | |||
1350 | } | |||
1351 | ||||
1352 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
1353 | static bool classof(const Instruction *I) { | |||
1354 | return I->getOpcode() == Instruction::ICmp; | |||
1355 | } | |||
1356 | static bool classof(const Value *V) { | |||
1357 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
1358 | } | |||
1359 | }; | |||
1360 | ||||
1361 | //===----------------------------------------------------------------------===// | |||
1362 | // FCmpInst Class | |||
1363 | //===----------------------------------------------------------------------===// | |||
1364 | ||||
1365 | /// This instruction compares its operands according to the predicate given | |||
1366 | /// to the constructor. It only operates on floating point values or packed | |||
1367 | /// vectors of floating point values. The operands must be identical types. | |||
1368 | /// Represents a floating point comparison operator. | |||
1369 | class FCmpInst: public CmpInst { | |||
1370 | void AssertOK() { | |||
1371 | assert(isFPPredicate() && "Invalid FCmp predicate value")(static_cast <bool> (isFPPredicate() && "Invalid FCmp predicate value" ) ? void (0) : __assert_fail ("isFPPredicate() && \"Invalid FCmp predicate value\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1371, __extension__ __PRETTY_FUNCTION__)); | |||
1372 | assert(getOperand(0)->getType() == getOperand(1)->getType() &&(static_cast <bool> (getOperand(0)->getType() == getOperand (1)->getType() && "Both operands to FCmp instruction are not of the same type!" ) ? void (0) : __assert_fail ("getOperand(0)->getType() == getOperand(1)->getType() && \"Both operands to FCmp instruction are not of the same type!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1373, __extension__ __PRETTY_FUNCTION__)) | |||
1373 | "Both operands to FCmp instruction are not of the same type!")(static_cast <bool> (getOperand(0)->getType() == getOperand (1)->getType() && "Both operands to FCmp instruction are not of the same type!" ) ? void (0) : __assert_fail ("getOperand(0)->getType() == getOperand(1)->getType() && \"Both operands to FCmp instruction are not of the same type!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1373, __extension__ __PRETTY_FUNCTION__)); | |||
1374 | // Check that the operands are the right type | |||
1375 | assert(getOperand(0)->getType()->isFPOrFPVectorTy() &&(static_cast <bool> (getOperand(0)->getType()->isFPOrFPVectorTy () && "Invalid operand types for FCmp instruction") ? void (0) : __assert_fail ("getOperand(0)->getType()->isFPOrFPVectorTy() && \"Invalid operand types for FCmp instruction\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1376, __extension__ __PRETTY_FUNCTION__)) | |||
1376 | "Invalid operand types for FCmp instruction")(static_cast <bool> (getOperand(0)->getType()->isFPOrFPVectorTy () && "Invalid operand types for FCmp instruction") ? void (0) : __assert_fail ("getOperand(0)->getType()->isFPOrFPVectorTy() && \"Invalid operand types for FCmp instruction\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1376, __extension__ __PRETTY_FUNCTION__)); | |||
1377 | } | |||
1378 | ||||
1379 | protected: | |||
1380 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
1381 | friend class Instruction; | |||
1382 | ||||
1383 | /// Clone an identical FCmpInst | |||
1384 | FCmpInst *cloneImpl() const; | |||
1385 | ||||
1386 | public: | |||
1387 | /// Constructor with insert-before-instruction semantics. | |||
1388 | FCmpInst( | |||
1389 | Instruction *InsertBefore, ///< Where to insert | |||
1390 | Predicate pred, ///< The predicate to use for the comparison | |||
1391 | Value *LHS, ///< The left-hand-side of the expression | |||
1392 | Value *RHS, ///< The right-hand-side of the expression | |||
1393 | const Twine &NameStr = "" ///< Name of the instruction | |||
1394 | ) : CmpInst(makeCmpResultType(LHS->getType()), | |||
1395 | Instruction::FCmp, pred, LHS, RHS, NameStr, | |||
1396 | InsertBefore) { | |||
1397 | AssertOK(); | |||
1398 | } | |||
1399 | ||||
1400 | /// Constructor with insert-at-end semantics. | |||
1401 | FCmpInst( | |||
1402 | BasicBlock &InsertAtEnd, ///< Block to insert into. | |||
1403 | Predicate pred, ///< The predicate to use for the comparison | |||
1404 | Value *LHS, ///< The left-hand-side of the expression | |||
1405 | Value *RHS, ///< The right-hand-side of the expression | |||
1406 | const Twine &NameStr = "" ///< Name of the instruction | |||
1407 | ) : CmpInst(makeCmpResultType(LHS->getType()), | |||
1408 | Instruction::FCmp, pred, LHS, RHS, NameStr, | |||
1409 | &InsertAtEnd) { | |||
1410 | AssertOK(); | |||
1411 | } | |||
1412 | ||||
1413 | /// Constructor with no-insertion semantics | |||
1414 | FCmpInst( | |||
1415 | Predicate Pred, ///< The predicate to use for the comparison | |||
1416 | Value *LHS, ///< The left-hand-side of the expression | |||
1417 | Value *RHS, ///< The right-hand-side of the expression | |||
1418 | const Twine &NameStr = "", ///< Name of the instruction | |||
1419 | Instruction *FlagsSource = nullptr | |||
1420 | ) : CmpInst(makeCmpResultType(LHS->getType()), Instruction::FCmp, Pred, LHS, | |||
1421 | RHS, NameStr, nullptr, FlagsSource) { | |||
1422 | AssertOK(); | |||
1423 | } | |||
1424 | ||||
1425 | /// @returns true if the predicate of this instruction is EQ or NE. | |||
1426 | /// Determine if this is an equality predicate. | |||
1427 | static bool isEquality(Predicate Pred) { | |||
1428 | return Pred == FCMP_OEQ || Pred == FCMP_ONE || Pred == FCMP_UEQ || | |||
1429 | Pred == FCMP_UNE; | |||
1430 | } | |||
1431 | ||||
1432 | /// @returns true if the predicate of this instruction is EQ or NE. | |||
1433 | /// Determine if this is an equality predicate. | |||
1434 | bool isEquality() const { return isEquality(getPredicate()); } | |||
1435 | ||||
1436 | /// @returns true if the predicate of this instruction is commutative. | |||
1437 | /// Determine if this is a commutative predicate. | |||
1438 | bool isCommutative() const { | |||
1439 | return isEquality() || | |||
1440 | getPredicate() == FCMP_FALSE || | |||
1441 | getPredicate() == FCMP_TRUE || | |||
1442 | getPredicate() == FCMP_ORD || | |||
1443 | getPredicate() == FCMP_UNO; | |||
1444 | } | |||
1445 | ||||
1446 | /// @returns true if the predicate is relational (not EQ or NE). | |||
1447 | /// Determine if this a relational predicate. | |||
1448 | bool isRelational() const { return !isEquality(); } | |||
1449 | ||||
1450 | /// Exchange the two operands to this instruction in such a way that it does | |||
1451 | /// not modify the semantics of the instruction. The predicate value may be | |||
1452 | /// changed to retain the same result if the predicate is order dependent | |||
1453 | /// (e.g. ult). | |||
1454 | /// Swap operands and adjust predicate. | |||
1455 | void swapOperands() { | |||
1456 | setPredicate(getSwappedPredicate()); | |||
1457 | Op<0>().swap(Op<1>()); | |||
1458 | } | |||
1459 | ||||
1460 | /// Methods for support type inquiry through isa, cast, and dyn_cast: | |||
1461 | static bool classof(const Instruction *I) { | |||
1462 | return I->getOpcode() == Instruction::FCmp; | |||
1463 | } | |||
1464 | static bool classof(const Value *V) { | |||
1465 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
1466 | } | |||
1467 | }; | |||
1468 | ||||
1469 | //===----------------------------------------------------------------------===// | |||
1470 | /// This class represents a function call, abstracting a target | |||
1471 | /// machine's calling convention. This class uses low bit of the SubClassData | |||
1472 | /// field to indicate whether or not this is a tail call. The rest of the bits | |||
1473 | /// hold the calling convention of the call. | |||
1474 | /// | |||
1475 | class CallInst : public CallBase { | |||
1476 | CallInst(const CallInst &CI); | |||
1477 | ||||
1478 | /// Construct a CallInst given a range of arguments. | |||
1479 | /// Construct a CallInst from a range of arguments | |||
1480 | inline CallInst(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args, | |||
1481 | ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr, | |||
1482 | Instruction *InsertBefore); | |||
1483 | ||||
1484 | inline CallInst(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args, | |||
1485 | const Twine &NameStr, Instruction *InsertBefore) | |||
1486 | : CallInst(Ty, Func, Args, None, NameStr, InsertBefore) {} | |||
1487 | ||||
1488 | /// Construct a CallInst given a range of arguments. | |||
1489 | /// Construct a CallInst from a range of arguments | |||
1490 | inline CallInst(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args, | |||
1491 | ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr, | |||
1492 | BasicBlock *InsertAtEnd); | |||
1493 | ||||
1494 | explicit CallInst(FunctionType *Ty, Value *F, const Twine &NameStr, | |||
1495 | Instruction *InsertBefore); | |||
1496 | ||||
1497 | CallInst(FunctionType *ty, Value *F, const Twine &NameStr, | |||
1498 | BasicBlock *InsertAtEnd); | |||
1499 | ||||
1500 | void init(FunctionType *FTy, Value *Func, ArrayRef<Value *> Args, | |||
1501 | ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr); | |||
1502 | void init(FunctionType *FTy, Value *Func, const Twine &NameStr); | |||
1503 | ||||
1504 | /// Compute the number of operands to allocate. | |||
1505 | static int ComputeNumOperands(int NumArgs, int NumBundleInputs = 0) { | |||
1506 | // We need one operand for the called function, plus the input operand | |||
1507 | // counts provided. | |||
1508 | return 1 + NumArgs + NumBundleInputs; | |||
1509 | } | |||
1510 | ||||
1511 | protected: | |||
1512 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
1513 | friend class Instruction; | |||
1514 | ||||
1515 | CallInst *cloneImpl() const; | |||
1516 | ||||
1517 | public: | |||
1518 | static CallInst *Create(FunctionType *Ty, Value *F, const Twine &NameStr = "", | |||
1519 | Instruction *InsertBefore = nullptr) { | |||
1520 | return new (ComputeNumOperands(0)) CallInst(Ty, F, NameStr, InsertBefore); | |||
1521 | } | |||
1522 | ||||
1523 | static CallInst *Create(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args, | |||
1524 | const Twine &NameStr, | |||
1525 | Instruction *InsertBefore = nullptr) { | |||
1526 | return new (ComputeNumOperands(Args.size())) | |||
1527 | CallInst(Ty, Func, Args, None, NameStr, InsertBefore); | |||
1528 | } | |||
1529 | ||||
1530 | static CallInst *Create(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args, | |||
1531 | ArrayRef<OperandBundleDef> Bundles = None, | |||
1532 | const Twine &NameStr = "", | |||
1533 | Instruction *InsertBefore = nullptr) { | |||
1534 | const int NumOperands = | |||
1535 | ComputeNumOperands(Args.size(), CountBundleInputs(Bundles)); | |||
1536 | const unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo); | |||
1537 | ||||
1538 | return new (NumOperands, DescriptorBytes) | |||
1539 | CallInst(Ty, Func, Args, Bundles, NameStr, InsertBefore); | |||
1540 | } | |||
1541 | ||||
1542 | static CallInst *Create(FunctionType *Ty, Value *F, const Twine &NameStr, | |||
1543 | BasicBlock *InsertAtEnd) { | |||
1544 | return new (ComputeNumOperands(0)) CallInst(Ty, F, NameStr, InsertAtEnd); | |||
1545 | } | |||
1546 | ||||
1547 | static CallInst *Create(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args, | |||
1548 | const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
1549 | return new (ComputeNumOperands(Args.size())) | |||
1550 | CallInst(Ty, Func, Args, None, NameStr, InsertAtEnd); | |||
1551 | } | |||
1552 | ||||
1553 | static CallInst *Create(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args, | |||
1554 | ArrayRef<OperandBundleDef> Bundles, | |||
1555 | const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
1556 | const int NumOperands = | |||
1557 | ComputeNumOperands(Args.size(), CountBundleInputs(Bundles)); | |||
1558 | const unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo); | |||
1559 | ||||
1560 | return new (NumOperands, DescriptorBytes) | |||
1561 | CallInst(Ty, Func, Args, Bundles, NameStr, InsertAtEnd); | |||
1562 | } | |||
1563 | ||||
1564 | static CallInst *Create(FunctionCallee Func, const Twine &NameStr = "", | |||
1565 | Instruction *InsertBefore = nullptr) { | |||
1566 | return Create(Func.getFunctionType(), Func.getCallee(), NameStr, | |||
1567 | InsertBefore); | |||
1568 | } | |||
1569 | ||||
1570 | static CallInst *Create(FunctionCallee Func, ArrayRef<Value *> Args, | |||
1571 | ArrayRef<OperandBundleDef> Bundles = None, | |||
1572 | const Twine &NameStr = "", | |||
1573 | Instruction *InsertBefore = nullptr) { | |||
1574 | return Create(Func.getFunctionType(), Func.getCallee(), Args, Bundles, | |||
1575 | NameStr, InsertBefore); | |||
1576 | } | |||
1577 | ||||
1578 | static CallInst *Create(FunctionCallee Func, ArrayRef<Value *> Args, | |||
1579 | const Twine &NameStr, | |||
1580 | Instruction *InsertBefore = nullptr) { | |||
1581 | return Create(Func.getFunctionType(), Func.getCallee(), Args, NameStr, | |||
1582 | InsertBefore); | |||
1583 | } | |||
1584 | ||||
1585 | static CallInst *Create(FunctionCallee Func, const Twine &NameStr, | |||
1586 | BasicBlock *InsertAtEnd) { | |||
1587 | return Create(Func.getFunctionType(), Func.getCallee(), NameStr, | |||
1588 | InsertAtEnd); | |||
1589 | } | |||
1590 | ||||
1591 | static CallInst *Create(FunctionCallee Func, ArrayRef<Value *> Args, | |||
1592 | const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
1593 | return Create(Func.getFunctionType(), Func.getCallee(), Args, NameStr, | |||
1594 | InsertAtEnd); | |||
1595 | } | |||
1596 | ||||
1597 | static CallInst *Create(FunctionCallee Func, ArrayRef<Value *> Args, | |||
1598 | ArrayRef<OperandBundleDef> Bundles, | |||
1599 | const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
1600 | return Create(Func.getFunctionType(), Func.getCallee(), Args, Bundles, | |||
1601 | NameStr, InsertAtEnd); | |||
1602 | } | |||
1603 | ||||
1604 | /// Create a clone of \p CI with a different set of operand bundles and | |||
1605 | /// insert it before \p InsertPt. | |||
1606 | /// | |||
1607 | /// The returned call instruction is identical \p CI in every way except that | |||
1608 | /// the operand bundles for the new instruction are set to the operand bundles | |||
1609 | /// in \p Bundles. | |||
1610 | static CallInst *Create(CallInst *CI, ArrayRef<OperandBundleDef> Bundles, | |||
1611 | Instruction *InsertPt = nullptr); | |||
1612 | ||||
1613 | /// Generate the IR for a call to malloc: | |||
1614 | /// 1. Compute the malloc call's argument as the specified type's size, | |||
1615 | /// possibly multiplied by the array size if the array size is not | |||
1616 | /// constant 1. | |||
1617 | /// 2. Call malloc with that argument. | |||
1618 | /// 3. Bitcast the result of the malloc call to the specified type. | |||
1619 | static Instruction *CreateMalloc(Instruction *InsertBefore, Type *IntPtrTy, | |||
1620 | Type *AllocTy, Value *AllocSize, | |||
1621 | Value *ArraySize = nullptr, | |||
1622 | Function *MallocF = nullptr, | |||
1623 | const Twine &Name = ""); | |||
1624 | static Instruction *CreateMalloc(BasicBlock *InsertAtEnd, Type *IntPtrTy, | |||
1625 | Type *AllocTy, Value *AllocSize, | |||
1626 | Value *ArraySize = nullptr, | |||
1627 | Function *MallocF = nullptr, | |||
1628 | const Twine &Name = ""); | |||
1629 | static Instruction *CreateMalloc(Instruction *InsertBefore, Type *IntPtrTy, | |||
1630 | Type *AllocTy, Value *AllocSize, | |||
1631 | Value *ArraySize = nullptr, | |||
1632 | ArrayRef<OperandBundleDef> Bundles = None, | |||
1633 | Function *MallocF = nullptr, | |||
1634 | const Twine &Name = ""); | |||
1635 | static Instruction *CreateMalloc(BasicBlock *InsertAtEnd, Type *IntPtrTy, | |||
1636 | Type *AllocTy, Value *AllocSize, | |||
1637 | Value *ArraySize = nullptr, | |||
1638 | ArrayRef<OperandBundleDef> Bundles = None, | |||
1639 | Function *MallocF = nullptr, | |||
1640 | const Twine &Name = ""); | |||
1641 | /// Generate the IR for a call to the builtin free function. | |||
1642 | static Instruction *CreateFree(Value *Source, Instruction *InsertBefore); | |||
1643 | static Instruction *CreateFree(Value *Source, BasicBlock *InsertAtEnd); | |||
1644 | static Instruction *CreateFree(Value *Source, | |||
1645 | ArrayRef<OperandBundleDef> Bundles, | |||
1646 | Instruction *InsertBefore); | |||
1647 | static Instruction *CreateFree(Value *Source, | |||
1648 | ArrayRef<OperandBundleDef> Bundles, | |||
1649 | BasicBlock *InsertAtEnd); | |||
1650 | ||||
1651 | // Note that 'musttail' implies 'tail'. | |||
1652 | enum TailCallKind : unsigned { | |||
1653 | TCK_None = 0, | |||
1654 | TCK_Tail = 1, | |||
1655 | TCK_MustTail = 2, | |||
1656 | TCK_NoTail = 3, | |||
1657 | TCK_LAST = TCK_NoTail | |||
1658 | }; | |||
1659 | ||||
1660 | using TailCallKindField = Bitfield::Element<TailCallKind, 0, 2, TCK_LAST>; | |||
1661 | static_assert( | |||
1662 | Bitfield::areContiguous<TailCallKindField, CallBase::CallingConvField>(), | |||
1663 | "Bitfields must be contiguous"); | |||
1664 | ||||
1665 | TailCallKind getTailCallKind() const { | |||
1666 | return getSubclassData<TailCallKindField>(); | |||
1667 | } | |||
1668 | ||||
1669 | bool isTailCall() const { | |||
1670 | TailCallKind Kind = getTailCallKind(); | |||
1671 | return Kind == TCK_Tail || Kind == TCK_MustTail; | |||
1672 | } | |||
1673 | ||||
1674 | bool isMustTailCall() const { return getTailCallKind() == TCK_MustTail; } | |||
1675 | ||||
1676 | bool isNoTailCall() const { return getTailCallKind() == TCK_NoTail; } | |||
1677 | ||||
1678 | void setTailCallKind(TailCallKind TCK) { | |||
1679 | setSubclassData<TailCallKindField>(TCK); | |||
1680 | } | |||
1681 | ||||
1682 | void setTailCall(bool IsTc = true) { | |||
1683 | setTailCallKind(IsTc ? TCK_Tail : TCK_None); | |||
1684 | } | |||
1685 | ||||
1686 | /// Return true if the call can return twice | |||
1687 | bool canReturnTwice() const { return hasFnAttr(Attribute::ReturnsTwice); } | |||
1688 | void setCanReturnTwice() { addFnAttr(Attribute::ReturnsTwice); } | |||
1689 | ||||
1690 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
1691 | static bool classof(const Instruction *I) { | |||
1692 | return I->getOpcode() == Instruction::Call; | |||
1693 | } | |||
1694 | static bool classof(const Value *V) { | |||
1695 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
1696 | } | |||
1697 | ||||
1698 | /// Updates profile metadata by scaling it by \p S / \p T. | |||
1699 | void updateProfWeight(uint64_t S, uint64_t T); | |||
1700 | ||||
1701 | private: | |||
1702 | // Shadow Instruction::setInstructionSubclassData with a private forwarding | |||
1703 | // method so that subclasses cannot accidentally use it. | |||
1704 | template <typename Bitfield> | |||
1705 | void setSubclassData(typename Bitfield::Type Value) { | |||
1706 | Instruction::setSubclassData<Bitfield>(Value); | |||
1707 | } | |||
1708 | }; | |||
1709 | ||||
1710 | CallInst::CallInst(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args, | |||
1711 | ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr, | |||
1712 | BasicBlock *InsertAtEnd) | |||
1713 | : CallBase(Ty->getReturnType(), Instruction::Call, | |||
1714 | OperandTraits<CallBase>::op_end(this) - | |||
1715 | (Args.size() + CountBundleInputs(Bundles) + 1), | |||
1716 | unsigned(Args.size() + CountBundleInputs(Bundles) + 1), | |||
1717 | InsertAtEnd) { | |||
1718 | init(Ty, Func, Args, Bundles, NameStr); | |||
1719 | } | |||
1720 | ||||
1721 | CallInst::CallInst(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args, | |||
1722 | ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr, | |||
1723 | Instruction *InsertBefore) | |||
1724 | : CallBase(Ty->getReturnType(), Instruction::Call, | |||
1725 | OperandTraits<CallBase>::op_end(this) - | |||
1726 | (Args.size() + CountBundleInputs(Bundles) + 1), | |||
1727 | unsigned(Args.size() + CountBundleInputs(Bundles) + 1), | |||
1728 | InsertBefore) { | |||
1729 | init(Ty, Func, Args, Bundles, NameStr); | |||
1730 | } | |||
1731 | ||||
1732 | //===----------------------------------------------------------------------===// | |||
1733 | // SelectInst Class | |||
1734 | //===----------------------------------------------------------------------===// | |||
1735 | ||||
1736 | /// This class represents the LLVM 'select' instruction. | |||
1737 | /// | |||
1738 | class SelectInst : public Instruction { | |||
1739 | SelectInst(Value *C, Value *S1, Value *S2, const Twine &NameStr, | |||
1740 | Instruction *InsertBefore) | |||
1741 | : Instruction(S1->getType(), Instruction::Select, | |||
1742 | &Op<0>(), 3, InsertBefore) { | |||
1743 | init(C, S1, S2); | |||
1744 | setName(NameStr); | |||
1745 | } | |||
1746 | ||||
1747 | SelectInst(Value *C, Value *S1, Value *S2, const Twine &NameStr, | |||
1748 | BasicBlock *InsertAtEnd) | |||
1749 | : Instruction(S1->getType(), Instruction::Select, | |||
1750 | &Op<0>(), 3, InsertAtEnd) { | |||
1751 | init(C, S1, S2); | |||
1752 | setName(NameStr); | |||
1753 | } | |||
1754 | ||||
1755 | void init(Value *C, Value *S1, Value *S2) { | |||
1756 | assert(!areInvalidOperands(C, S1, S2) && "Invalid operands for select")(static_cast <bool> (!areInvalidOperands(C, S1, S2) && "Invalid operands for select") ? void (0) : __assert_fail ("!areInvalidOperands(C, S1, S2) && \"Invalid operands for select\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1756, __extension__ __PRETTY_FUNCTION__)); | |||
1757 | Op<0>() = C; | |||
1758 | Op<1>() = S1; | |||
1759 | Op<2>() = S2; | |||
1760 | } | |||
1761 | ||||
1762 | protected: | |||
1763 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
1764 | friend class Instruction; | |||
1765 | ||||
1766 | SelectInst *cloneImpl() const; | |||
1767 | ||||
1768 | public: | |||
1769 | static SelectInst *Create(Value *C, Value *S1, Value *S2, | |||
1770 | const Twine &NameStr = "", | |||
1771 | Instruction *InsertBefore = nullptr, | |||
1772 | Instruction *MDFrom = nullptr) { | |||
1773 | SelectInst *Sel = new(3) SelectInst(C, S1, S2, NameStr, InsertBefore); | |||
1774 | if (MDFrom) | |||
1775 | Sel->copyMetadata(*MDFrom); | |||
1776 | return Sel; | |||
1777 | } | |||
1778 | ||||
1779 | static SelectInst *Create(Value *C, Value *S1, Value *S2, | |||
1780 | const Twine &NameStr, | |||
1781 | BasicBlock *InsertAtEnd) { | |||
1782 | return new(3) SelectInst(C, S1, S2, NameStr, InsertAtEnd); | |||
1783 | } | |||
1784 | ||||
1785 | const Value *getCondition() const { return Op<0>(); } | |||
1786 | const Value *getTrueValue() const { return Op<1>(); } | |||
1787 | const Value *getFalseValue() const { return Op<2>(); } | |||
1788 | Value *getCondition() { return Op<0>(); } | |||
1789 | Value *getTrueValue() { return Op<1>(); } | |||
1790 | Value *getFalseValue() { return Op<2>(); } | |||
1791 | ||||
1792 | void setCondition(Value *V) { Op<0>() = V; } | |||
1793 | void setTrueValue(Value *V) { Op<1>() = V; } | |||
1794 | void setFalseValue(Value *V) { Op<2>() = V; } | |||
1795 | ||||
1796 | /// Swap the true and false values of the select instruction. | |||
1797 | /// This doesn't swap prof metadata. | |||
1798 | void swapValues() { Op<1>().swap(Op<2>()); } | |||
1799 | ||||
1800 | /// Return a string if the specified operands are invalid | |||
1801 | /// for a select operation, otherwise return null. | |||
1802 | static const char *areInvalidOperands(Value *Cond, Value *True, Value *False); | |||
1803 | ||||
1804 | /// Transparently provide more efficient getOperand methods. | |||
1805 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
1806 | ||||
1807 | OtherOps getOpcode() const { | |||
1808 | return static_cast<OtherOps>(Instruction::getOpcode()); | |||
1809 | } | |||
1810 | ||||
1811 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
1812 | static bool classof(const Instruction *I) { | |||
1813 | return I->getOpcode() == Instruction::Select; | |||
1814 | } | |||
1815 | static bool classof(const Value *V) { | |||
1816 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
1817 | } | |||
1818 | }; | |||
1819 | ||||
1820 | template <> | |||
1821 | struct OperandTraits<SelectInst> : public FixedNumOperandTraits<SelectInst, 3> { | |||
1822 | }; | |||
1823 | ||||
1824 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(SelectInst, Value)SelectInst::op_iterator SelectInst::op_begin() { return OperandTraits <SelectInst>::op_begin(this); } SelectInst::const_op_iterator SelectInst::op_begin() const { return OperandTraits<SelectInst >::op_begin(const_cast<SelectInst*>(this)); } SelectInst ::op_iterator SelectInst::op_end() { return OperandTraits< SelectInst>::op_end(this); } SelectInst::const_op_iterator SelectInst::op_end() const { return OperandTraits<SelectInst >::op_end(const_cast<SelectInst*>(this)); } Value *SelectInst ::getOperand(unsigned i_nocapture) const { (static_cast <bool > (i_nocapture < OperandTraits<SelectInst>::operands (this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<SelectInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1824, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<SelectInst>::op_begin(const_cast <SelectInst*>(this))[i_nocapture].get()); } void SelectInst ::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<SelectInst> ::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<SelectInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1824, __extension__ __PRETTY_FUNCTION__)); OperandTraits< SelectInst>::op_begin(this)[i_nocapture] = Val_nocapture; } unsigned SelectInst::getNumOperands() const { return OperandTraits <SelectInst>::operands(this); } template <int Idx_nocapture > Use &SelectInst::Op() { return this->OpFrom<Idx_nocapture >(this); } template <int Idx_nocapture> const Use & SelectInst::Op() const { return this->OpFrom<Idx_nocapture >(this); } | |||
1825 | ||||
1826 | //===----------------------------------------------------------------------===// | |||
1827 | // VAArgInst Class | |||
1828 | //===----------------------------------------------------------------------===// | |||
1829 | ||||
1830 | /// This class represents the va_arg llvm instruction, which returns | |||
1831 | /// an argument of the specified type given a va_list and increments that list | |||
1832 | /// | |||
1833 | class VAArgInst : public UnaryInstruction { | |||
1834 | protected: | |||
1835 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
1836 | friend class Instruction; | |||
1837 | ||||
1838 | VAArgInst *cloneImpl() const; | |||
1839 | ||||
1840 | public: | |||
1841 | VAArgInst(Value *List, Type *Ty, const Twine &NameStr = "", | |||
1842 | Instruction *InsertBefore = nullptr) | |||
1843 | : UnaryInstruction(Ty, VAArg, List, InsertBefore) { | |||
1844 | setName(NameStr); | |||
1845 | } | |||
1846 | ||||
1847 | VAArgInst(Value *List, Type *Ty, const Twine &NameStr, | |||
1848 | BasicBlock *InsertAtEnd) | |||
1849 | : UnaryInstruction(Ty, VAArg, List, InsertAtEnd) { | |||
1850 | setName(NameStr); | |||
1851 | } | |||
1852 | ||||
1853 | Value *getPointerOperand() { return getOperand(0); } | |||
1854 | const Value *getPointerOperand() const { return getOperand(0); } | |||
1855 | static unsigned getPointerOperandIndex() { return 0U; } | |||
1856 | ||||
1857 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
1858 | static bool classof(const Instruction *I) { | |||
1859 | return I->getOpcode() == VAArg; | |||
1860 | } | |||
1861 | static bool classof(const Value *V) { | |||
1862 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
1863 | } | |||
1864 | }; | |||
1865 | ||||
1866 | //===----------------------------------------------------------------------===// | |||
1867 | // ExtractElementInst Class | |||
1868 | //===----------------------------------------------------------------------===// | |||
1869 | ||||
1870 | /// This instruction extracts a single (scalar) | |||
1871 | /// element from a VectorType value | |||
1872 | /// | |||
1873 | class ExtractElementInst : public Instruction { | |||
1874 | ExtractElementInst(Value *Vec, Value *Idx, const Twine &NameStr = "", | |||
1875 | Instruction *InsertBefore = nullptr); | |||
1876 | ExtractElementInst(Value *Vec, Value *Idx, const Twine &NameStr, | |||
1877 | BasicBlock *InsertAtEnd); | |||
1878 | ||||
1879 | protected: | |||
1880 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
1881 | friend class Instruction; | |||
1882 | ||||
1883 | ExtractElementInst *cloneImpl() const; | |||
1884 | ||||
1885 | public: | |||
1886 | static ExtractElementInst *Create(Value *Vec, Value *Idx, | |||
1887 | const Twine &NameStr = "", | |||
1888 | Instruction *InsertBefore = nullptr) { | |||
1889 | return new(2) ExtractElementInst(Vec, Idx, NameStr, InsertBefore); | |||
1890 | } | |||
1891 | ||||
1892 | static ExtractElementInst *Create(Value *Vec, Value *Idx, | |||
1893 | const Twine &NameStr, | |||
1894 | BasicBlock *InsertAtEnd) { | |||
1895 | return new(2) ExtractElementInst(Vec, Idx, NameStr, InsertAtEnd); | |||
1896 | } | |||
1897 | ||||
1898 | /// Return true if an extractelement instruction can be | |||
1899 | /// formed with the specified operands. | |||
1900 | static bool isValidOperands(const Value *Vec, const Value *Idx); | |||
1901 | ||||
1902 | Value *getVectorOperand() { return Op<0>(); } | |||
1903 | Value *getIndexOperand() { return Op<1>(); } | |||
1904 | const Value *getVectorOperand() const { return Op<0>(); } | |||
1905 | const Value *getIndexOperand() const { return Op<1>(); } | |||
1906 | ||||
1907 | VectorType *getVectorOperandType() const { | |||
1908 | return cast<VectorType>(getVectorOperand()->getType()); | |||
1909 | } | |||
1910 | ||||
1911 | /// Transparently provide more efficient getOperand methods. | |||
1912 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
1913 | ||||
1914 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
1915 | static bool classof(const Instruction *I) { | |||
1916 | return I->getOpcode() == Instruction::ExtractElement; | |||
1917 | } | |||
1918 | static bool classof(const Value *V) { | |||
1919 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
1920 | } | |||
1921 | }; | |||
1922 | ||||
1923 | template <> | |||
1924 | struct OperandTraits<ExtractElementInst> : | |||
1925 | public FixedNumOperandTraits<ExtractElementInst, 2> { | |||
1926 | }; | |||
1927 | ||||
1928 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractElementInst, Value)ExtractElementInst::op_iterator ExtractElementInst::op_begin( ) { return OperandTraits<ExtractElementInst>::op_begin( this); } ExtractElementInst::const_op_iterator ExtractElementInst ::op_begin() const { return OperandTraits<ExtractElementInst >::op_begin(const_cast<ExtractElementInst*>(this)); } ExtractElementInst::op_iterator ExtractElementInst::op_end() { return OperandTraits<ExtractElementInst>::op_end(this ); } ExtractElementInst::const_op_iterator ExtractElementInst ::op_end() const { return OperandTraits<ExtractElementInst >::op_end(const_cast<ExtractElementInst*>(this)); } Value *ExtractElementInst::getOperand(unsigned i_nocapture) const { (static_cast <bool> (i_nocapture < OperandTraits< ExtractElementInst>::operands(this) && "getOperand() out of range!" ) ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ExtractElementInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1928, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<ExtractElementInst>::op_begin (const_cast<ExtractElementInst*>(this))[i_nocapture].get ()); } void ExtractElementInst::setOperand(unsigned i_nocapture , Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<ExtractElementInst>::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ExtractElementInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1928, __extension__ __PRETTY_FUNCTION__)); OperandTraits< ExtractElementInst>::op_begin(this)[i_nocapture] = Val_nocapture ; } unsigned ExtractElementInst::getNumOperands() const { return OperandTraits<ExtractElementInst>::operands(this); } template <int Idx_nocapture> Use &ExtractElementInst::Op() { return this->OpFrom<Idx_nocapture>(this); } template <int Idx_nocapture> const Use &ExtractElementInst:: Op() const { return this->OpFrom<Idx_nocapture>(this ); } | |||
1929 | ||||
1930 | //===----------------------------------------------------------------------===// | |||
1931 | // InsertElementInst Class | |||
1932 | //===----------------------------------------------------------------------===// | |||
1933 | ||||
1934 | /// This instruction inserts a single (scalar) | |||
1935 | /// element into a VectorType value | |||
1936 | /// | |||
1937 | class InsertElementInst : public Instruction { | |||
1938 | InsertElementInst(Value *Vec, Value *NewElt, Value *Idx, | |||
1939 | const Twine &NameStr = "", | |||
1940 | Instruction *InsertBefore = nullptr); | |||
1941 | InsertElementInst(Value *Vec, Value *NewElt, Value *Idx, const Twine &NameStr, | |||
1942 | BasicBlock *InsertAtEnd); | |||
1943 | ||||
1944 | protected: | |||
1945 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
1946 | friend class Instruction; | |||
1947 | ||||
1948 | InsertElementInst *cloneImpl() const; | |||
1949 | ||||
1950 | public: | |||
1951 | static InsertElementInst *Create(Value *Vec, Value *NewElt, Value *Idx, | |||
1952 | const Twine &NameStr = "", | |||
1953 | Instruction *InsertBefore = nullptr) { | |||
1954 | return new(3) InsertElementInst(Vec, NewElt, Idx, NameStr, InsertBefore); | |||
1955 | } | |||
1956 | ||||
1957 | static InsertElementInst *Create(Value *Vec, Value *NewElt, Value *Idx, | |||
1958 | const Twine &NameStr, | |||
1959 | BasicBlock *InsertAtEnd) { | |||
1960 | return new(3) InsertElementInst(Vec, NewElt, Idx, NameStr, InsertAtEnd); | |||
1961 | } | |||
1962 | ||||
1963 | /// Return true if an insertelement instruction can be | |||
1964 | /// formed with the specified operands. | |||
1965 | static bool isValidOperands(const Value *Vec, const Value *NewElt, | |||
1966 | const Value *Idx); | |||
1967 | ||||
1968 | /// Overload to return most specific vector type. | |||
1969 | /// | |||
1970 | VectorType *getType() const { | |||
1971 | return cast<VectorType>(Instruction::getType()); | |||
1972 | } | |||
1973 | ||||
1974 | /// Transparently provide more efficient getOperand methods. | |||
1975 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
1976 | ||||
1977 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
1978 | static bool classof(const Instruction *I) { | |||
1979 | return I->getOpcode() == Instruction::InsertElement; | |||
1980 | } | |||
1981 | static bool classof(const Value *V) { | |||
1982 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
1983 | } | |||
1984 | }; | |||
1985 | ||||
1986 | template <> | |||
1987 | struct OperandTraits<InsertElementInst> : | |||
1988 | public FixedNumOperandTraits<InsertElementInst, 3> { | |||
1989 | }; | |||
1990 | ||||
1991 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertElementInst, Value)InsertElementInst::op_iterator InsertElementInst::op_begin() { return OperandTraits<InsertElementInst>::op_begin(this ); } InsertElementInst::const_op_iterator InsertElementInst:: op_begin() const { return OperandTraits<InsertElementInst> ::op_begin(const_cast<InsertElementInst*>(this)); } InsertElementInst ::op_iterator InsertElementInst::op_end() { return OperandTraits <InsertElementInst>::op_end(this); } InsertElementInst:: const_op_iterator InsertElementInst::op_end() const { return OperandTraits <InsertElementInst>::op_end(const_cast<InsertElementInst *>(this)); } Value *InsertElementInst::getOperand(unsigned i_nocapture) const { (static_cast <bool> (i_nocapture < OperandTraits<InsertElementInst>::operands(this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<InsertElementInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1991, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<InsertElementInst>::op_begin (const_cast<InsertElementInst*>(this))[i_nocapture].get ()); } void InsertElementInst::setOperand(unsigned i_nocapture , Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<InsertElementInst>::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<InsertElementInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 1991, __extension__ __PRETTY_FUNCTION__)); OperandTraits< InsertElementInst>::op_begin(this)[i_nocapture] = Val_nocapture ; } unsigned InsertElementInst::getNumOperands() const { return OperandTraits<InsertElementInst>::operands(this); } template <int Idx_nocapture> Use &InsertElementInst::Op() { return this->OpFrom<Idx_nocapture>(this); } template <int Idx_nocapture> const Use &InsertElementInst:: Op() const { return this->OpFrom<Idx_nocapture>(this ); } | |||
1992 | ||||
1993 | //===----------------------------------------------------------------------===// | |||
1994 | // ShuffleVectorInst Class | |||
1995 | //===----------------------------------------------------------------------===// | |||
1996 | ||||
1997 | constexpr int UndefMaskElem = -1; | |||
1998 | ||||
1999 | /// This instruction constructs a fixed permutation of two | |||
2000 | /// input vectors. | |||
2001 | /// | |||
2002 | /// For each element of the result vector, the shuffle mask selects an element | |||
2003 | /// from one of the input vectors to copy to the result. Non-negative elements | |||
2004 | /// in the mask represent an index into the concatenated pair of input vectors. | |||
2005 | /// UndefMaskElem (-1) specifies that the result element is undefined. | |||
2006 | /// | |||
2007 | /// For scalable vectors, all the elements of the mask must be 0 or -1. This | |||
2008 | /// requirement may be relaxed in the future. | |||
2009 | class ShuffleVectorInst : public Instruction { | |||
2010 | SmallVector<int, 4> ShuffleMask; | |||
2011 | Constant *ShuffleMaskForBitcode; | |||
2012 | ||||
2013 | protected: | |||
2014 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
2015 | friend class Instruction; | |||
2016 | ||||
2017 | ShuffleVectorInst *cloneImpl() const; | |||
2018 | ||||
2019 | public: | |||
2020 | ShuffleVectorInst(Value *V1, Value *V2, Value *Mask, | |||
2021 | const Twine &NameStr = "", | |||
2022 | Instruction *InsertBefor = nullptr); | |||
2023 | ShuffleVectorInst(Value *V1, Value *V2, Value *Mask, | |||
2024 | const Twine &NameStr, BasicBlock *InsertAtEnd); | |||
2025 | ShuffleVectorInst(Value *V1, Value *V2, ArrayRef<int> Mask, | |||
2026 | const Twine &NameStr = "", | |||
2027 | Instruction *InsertBefor = nullptr); | |||
2028 | ShuffleVectorInst(Value *V1, Value *V2, ArrayRef<int> Mask, | |||
2029 | const Twine &NameStr, BasicBlock *InsertAtEnd); | |||
2030 | ||||
2031 | void *operator new(size_t S) { return User::operator new(S, 2); } | |||
2032 | void operator delete(void *Ptr) { return User::operator delete(Ptr); } | |||
2033 | ||||
2034 | /// Swap the operands and adjust the mask to preserve the semantics | |||
2035 | /// of the instruction. | |||
2036 | void commute(); | |||
2037 | ||||
2038 | /// Return true if a shufflevector instruction can be | |||
2039 | /// formed with the specified operands. | |||
2040 | static bool isValidOperands(const Value *V1, const Value *V2, | |||
2041 | const Value *Mask); | |||
2042 | static bool isValidOperands(const Value *V1, const Value *V2, | |||
2043 | ArrayRef<int> Mask); | |||
2044 | ||||
2045 | /// Overload to return most specific vector type. | |||
2046 | /// | |||
2047 | VectorType *getType() const { | |||
2048 | return cast<VectorType>(Instruction::getType()); | |||
2049 | } | |||
2050 | ||||
2051 | /// Transparently provide more efficient getOperand methods. | |||
2052 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
2053 | ||||
2054 | /// Return the shuffle mask value of this instruction for the given element | |||
2055 | /// index. Return UndefMaskElem if the element is undef. | |||
2056 | int getMaskValue(unsigned Elt) const { return ShuffleMask[Elt]; } | |||
2057 | ||||
2058 | /// Convert the input shuffle mask operand to a vector of integers. Undefined | |||
2059 | /// elements of the mask are returned as UndefMaskElem. | |||
2060 | static void getShuffleMask(const Constant *Mask, | |||
2061 | SmallVectorImpl<int> &Result); | |||
2062 | ||||
2063 | /// Return the mask for this instruction as a vector of integers. Undefined | |||
2064 | /// elements of the mask are returned as UndefMaskElem. | |||
2065 | void getShuffleMask(SmallVectorImpl<int> &Result) const { | |||
2066 | Result.assign(ShuffleMask.begin(), ShuffleMask.end()); | |||
2067 | } | |||
2068 | ||||
2069 | /// Return the mask for this instruction, for use in bitcode. | |||
2070 | /// | |||
2071 | /// TODO: This is temporary until we decide a new bitcode encoding for | |||
2072 | /// shufflevector. | |||
2073 | Constant *getShuffleMaskForBitcode() const { return ShuffleMaskForBitcode; } | |||
2074 | ||||
2075 | static Constant *convertShuffleMaskForBitcode(ArrayRef<int> Mask, | |||
2076 | Type *ResultTy); | |||
2077 | ||||
2078 | void setShuffleMask(ArrayRef<int> Mask); | |||
2079 | ||||
2080 | ArrayRef<int> getShuffleMask() const { return ShuffleMask; } | |||
2081 | ||||
2082 | /// Return true if this shuffle returns a vector with a different number of | |||
2083 | /// elements than its source vectors. | |||
2084 | /// Examples: shufflevector <4 x n> A, <4 x n> B, <1,2,3> | |||
2085 | /// shufflevector <4 x n> A, <4 x n> B, <1,2,3,4,5> | |||
2086 | bool changesLength() const { | |||
2087 | unsigned NumSourceElts = cast<VectorType>(Op<0>()->getType()) | |||
2088 | ->getElementCount() | |||
2089 | .getKnownMinValue(); | |||
2090 | unsigned NumMaskElts = ShuffleMask.size(); | |||
2091 | return NumSourceElts != NumMaskElts; | |||
2092 | } | |||
2093 | ||||
2094 | /// Return true if this shuffle returns a vector with a greater number of | |||
2095 | /// elements than its source vectors. | |||
2096 | /// Example: shufflevector <2 x n> A, <2 x n> B, <1,2,3> | |||
2097 | bool increasesLength() const { | |||
2098 | unsigned NumSourceElts = cast<VectorType>(Op<0>()->getType()) | |||
2099 | ->getElementCount() | |||
2100 | .getKnownMinValue(); | |||
2101 | unsigned NumMaskElts = ShuffleMask.size(); | |||
2102 | return NumSourceElts < NumMaskElts; | |||
2103 | } | |||
2104 | ||||
2105 | /// Return true if this shuffle mask chooses elements from exactly one source | |||
2106 | /// vector. | |||
2107 | /// Example: <7,5,undef,7> | |||
2108 | /// This assumes that vector operands are the same length as the mask. | |||
2109 | static bool isSingleSourceMask(ArrayRef<int> Mask); | |||
2110 | static bool isSingleSourceMask(const Constant *Mask) { | |||
2111 | assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy( ) && "Shuffle needs vector constant.") ? void (0) : __assert_fail ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2111, __extension__ __PRETTY_FUNCTION__)); | |||
2112 | SmallVector<int, 16> MaskAsInts; | |||
2113 | getShuffleMask(Mask, MaskAsInts); | |||
2114 | return isSingleSourceMask(MaskAsInts); | |||
2115 | } | |||
2116 | ||||
2117 | /// Return true if this shuffle chooses elements from exactly one source | |||
2118 | /// vector without changing the length of that vector. | |||
2119 | /// Example: shufflevector <4 x n> A, <4 x n> B, <3,0,undef,3> | |||
2120 | /// TODO: Optionally allow length-changing shuffles. | |||
2121 | bool isSingleSource() const { | |||
2122 | return !changesLength() && isSingleSourceMask(ShuffleMask); | |||
2123 | } | |||
2124 | ||||
2125 | /// Return true if this shuffle mask chooses elements from exactly one source | |||
2126 | /// vector without lane crossings. A shuffle using this mask is not | |||
2127 | /// necessarily a no-op because it may change the number of elements from its | |||
2128 | /// input vectors or it may provide demanded bits knowledge via undef lanes. | |||
2129 | /// Example: <undef,undef,2,3> | |||
2130 | static bool isIdentityMask(ArrayRef<int> Mask); | |||
2131 | static bool isIdentityMask(const Constant *Mask) { | |||
2132 | assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy( ) && "Shuffle needs vector constant.") ? void (0) : __assert_fail ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2132, __extension__ __PRETTY_FUNCTION__)); | |||
2133 | SmallVector<int, 16> MaskAsInts; | |||
2134 | getShuffleMask(Mask, MaskAsInts); | |||
2135 | return isIdentityMask(MaskAsInts); | |||
2136 | } | |||
2137 | ||||
2138 | /// Return true if this shuffle chooses elements from exactly one source | |||
2139 | /// vector without lane crossings and does not change the number of elements | |||
2140 | /// from its input vectors. | |||
2141 | /// Example: shufflevector <4 x n> A, <4 x n> B, <4,undef,6,undef> | |||
2142 | bool isIdentity() const { | |||
2143 | return !changesLength() && isIdentityMask(ShuffleMask); | |||
2144 | } | |||
2145 | ||||
2146 | /// Return true if this shuffle lengthens exactly one source vector with | |||
2147 | /// undefs in the high elements. | |||
2148 | bool isIdentityWithPadding() const; | |||
2149 | ||||
2150 | /// Return true if this shuffle extracts the first N elements of exactly one | |||
2151 | /// source vector. | |||
2152 | bool isIdentityWithExtract() const; | |||
2153 | ||||
2154 | /// Return true if this shuffle concatenates its 2 source vectors. This | |||
2155 | /// returns false if either input is undefined. In that case, the shuffle is | |||
2156 | /// is better classified as an identity with padding operation. | |||
2157 | bool isConcat() const; | |||
2158 | ||||
2159 | /// Return true if this shuffle mask chooses elements from its source vectors | |||
2160 | /// without lane crossings. A shuffle using this mask would be | |||
2161 | /// equivalent to a vector select with a constant condition operand. | |||
2162 | /// Example: <4,1,6,undef> | |||
2163 | /// This returns false if the mask does not choose from both input vectors. | |||
2164 | /// In that case, the shuffle is better classified as an identity shuffle. | |||
2165 | /// This assumes that vector operands are the same length as the mask | |||
2166 | /// (a length-changing shuffle can never be equivalent to a vector select). | |||
2167 | static bool isSelectMask(ArrayRef<int> Mask); | |||
2168 | static bool isSelectMask(const Constant *Mask) { | |||
2169 | assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy( ) && "Shuffle needs vector constant.") ? void (0) : __assert_fail ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2169, __extension__ __PRETTY_FUNCTION__)); | |||
2170 | SmallVector<int, 16> MaskAsInts; | |||
2171 | getShuffleMask(Mask, MaskAsInts); | |||
2172 | return isSelectMask(MaskAsInts); | |||
2173 | } | |||
2174 | ||||
2175 | /// Return true if this shuffle chooses elements from its source vectors | |||
2176 | /// without lane crossings and all operands have the same number of elements. | |||
2177 | /// In other words, this shuffle is equivalent to a vector select with a | |||
2178 | /// constant condition operand. | |||
2179 | /// Example: shufflevector <4 x n> A, <4 x n> B, <undef,1,6,3> | |||
2180 | /// This returns false if the mask does not choose from both input vectors. | |||
2181 | /// In that case, the shuffle is better classified as an identity shuffle. | |||
2182 | /// TODO: Optionally allow length-changing shuffles. | |||
2183 | bool isSelect() const { | |||
2184 | return !changesLength() && isSelectMask(ShuffleMask); | |||
2185 | } | |||
2186 | ||||
2187 | /// Return true if this shuffle mask swaps the order of elements from exactly | |||
2188 | /// one source vector. | |||
2189 | /// Example: <7,6,undef,4> | |||
2190 | /// This assumes that vector operands are the same length as the mask. | |||
2191 | static bool isReverseMask(ArrayRef<int> Mask); | |||
2192 | static bool isReverseMask(const Constant *Mask) { | |||
2193 | assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy( ) && "Shuffle needs vector constant.") ? void (0) : __assert_fail ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2193, __extension__ __PRETTY_FUNCTION__)); | |||
2194 | SmallVector<int, 16> MaskAsInts; | |||
2195 | getShuffleMask(Mask, MaskAsInts); | |||
2196 | return isReverseMask(MaskAsInts); | |||
2197 | } | |||
2198 | ||||
2199 | /// Return true if this shuffle swaps the order of elements from exactly | |||
2200 | /// one source vector. | |||
2201 | /// Example: shufflevector <4 x n> A, <4 x n> B, <3,undef,1,undef> | |||
2202 | /// TODO: Optionally allow length-changing shuffles. | |||
2203 | bool isReverse() const { | |||
2204 | return !changesLength() && isReverseMask(ShuffleMask); | |||
2205 | } | |||
2206 | ||||
2207 | /// Return true if this shuffle mask chooses all elements with the same value | |||
2208 | /// as the first element of exactly one source vector. | |||
2209 | /// Example: <4,undef,undef,4> | |||
2210 | /// This assumes that vector operands are the same length as the mask. | |||
2211 | static bool isZeroEltSplatMask(ArrayRef<int> Mask); | |||
2212 | static bool isZeroEltSplatMask(const Constant *Mask) { | |||
2213 | assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy( ) && "Shuffle needs vector constant.") ? void (0) : __assert_fail ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2213, __extension__ __PRETTY_FUNCTION__)); | |||
2214 | SmallVector<int, 16> MaskAsInts; | |||
2215 | getShuffleMask(Mask, MaskAsInts); | |||
2216 | return isZeroEltSplatMask(MaskAsInts); | |||
2217 | } | |||
2218 | ||||
2219 | /// Return true if all elements of this shuffle are the same value as the | |||
2220 | /// first element of exactly one source vector without changing the length | |||
2221 | /// of that vector. | |||
2222 | /// Example: shufflevector <4 x n> A, <4 x n> B, <undef,0,undef,0> | |||
2223 | /// TODO: Optionally allow length-changing shuffles. | |||
2224 | /// TODO: Optionally allow splats from other elements. | |||
2225 | bool isZeroEltSplat() const { | |||
2226 | return !changesLength() && isZeroEltSplatMask(ShuffleMask); | |||
2227 | } | |||
2228 | ||||
2229 | /// Return true if this shuffle mask is a transpose mask. | |||
2230 | /// Transpose vector masks transpose a 2xn matrix. They read corresponding | |||
2231 | /// even- or odd-numbered vector elements from two n-dimensional source | |||
2232 | /// vectors and write each result into consecutive elements of an | |||
2233 | /// n-dimensional destination vector. Two shuffles are necessary to complete | |||
2234 | /// the transpose, one for the even elements and another for the odd elements. | |||
2235 | /// This description closely follows how the TRN1 and TRN2 AArch64 | |||
2236 | /// instructions operate. | |||
2237 | /// | |||
2238 | /// For example, a simple 2x2 matrix can be transposed with: | |||
2239 | /// | |||
2240 | /// ; Original matrix | |||
2241 | /// m0 = < a, b > | |||
2242 | /// m1 = < c, d > | |||
2243 | /// | |||
2244 | /// ; Transposed matrix | |||
2245 | /// t0 = < a, c > = shufflevector m0, m1, < 0, 2 > | |||
2246 | /// t1 = < b, d > = shufflevector m0, m1, < 1, 3 > | |||
2247 | /// | |||
2248 | /// For matrices having greater than n columns, the resulting nx2 transposed | |||
2249 | /// matrix is stored in two result vectors such that one vector contains | |||
2250 | /// interleaved elements from all the even-numbered rows and the other vector | |||
2251 | /// contains interleaved elements from all the odd-numbered rows. For example, | |||
2252 | /// a 2x4 matrix can be transposed with: | |||
2253 | /// | |||
2254 | /// ; Original matrix | |||
2255 | /// m0 = < a, b, c, d > | |||
2256 | /// m1 = < e, f, g, h > | |||
2257 | /// | |||
2258 | /// ; Transposed matrix | |||
2259 | /// t0 = < a, e, c, g > = shufflevector m0, m1 < 0, 4, 2, 6 > | |||
2260 | /// t1 = < b, f, d, h > = shufflevector m0, m1 < 1, 5, 3, 7 > | |||
2261 | static bool isTransposeMask(ArrayRef<int> Mask); | |||
2262 | static bool isTransposeMask(const Constant *Mask) { | |||
2263 | assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy( ) && "Shuffle needs vector constant.") ? void (0) : __assert_fail ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2263, __extension__ __PRETTY_FUNCTION__)); | |||
2264 | SmallVector<int, 16> MaskAsInts; | |||
2265 | getShuffleMask(Mask, MaskAsInts); | |||
2266 | return isTransposeMask(MaskAsInts); | |||
2267 | } | |||
2268 | ||||
2269 | /// Return true if this shuffle transposes the elements of its inputs without | |||
2270 | /// changing the length of the vectors. This operation may also be known as a | |||
2271 | /// merge or interleave. See the description for isTransposeMask() for the | |||
2272 | /// exact specification. | |||
2273 | /// Example: shufflevector <4 x n> A, <4 x n> B, <0,4,2,6> | |||
2274 | bool isTranspose() const { | |||
2275 | return !changesLength() && isTransposeMask(ShuffleMask); | |||
2276 | } | |||
2277 | ||||
2278 | /// Return true if this shuffle mask is an extract subvector mask. | |||
2279 | /// A valid extract subvector mask returns a smaller vector from a single | |||
2280 | /// source operand. The base extraction index is returned as well. | |||
2281 | static bool isExtractSubvectorMask(ArrayRef<int> Mask, int NumSrcElts, | |||
2282 | int &Index); | |||
2283 | static bool isExtractSubvectorMask(const Constant *Mask, int NumSrcElts, | |||
2284 | int &Index) { | |||
2285 | assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy( ) && "Shuffle needs vector constant.") ? void (0) : __assert_fail ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2285, __extension__ __PRETTY_FUNCTION__)); | |||
2286 | // Not possible to express a shuffle mask for a scalable vector for this | |||
2287 | // case. | |||
2288 | if (isa<ScalableVectorType>(Mask->getType())) | |||
2289 | return false; | |||
2290 | SmallVector<int, 16> MaskAsInts; | |||
2291 | getShuffleMask(Mask, MaskAsInts); | |||
2292 | return isExtractSubvectorMask(MaskAsInts, NumSrcElts, Index); | |||
2293 | } | |||
2294 | ||||
2295 | /// Return true if this shuffle mask is an extract subvector mask. | |||
2296 | bool isExtractSubvectorMask(int &Index) const { | |||
2297 | // Not possible to express a shuffle mask for a scalable vector for this | |||
2298 | // case. | |||
2299 | if (isa<ScalableVectorType>(getType())) | |||
2300 | return false; | |||
2301 | ||||
2302 | int NumSrcElts = | |||
2303 | cast<FixedVectorType>(Op<0>()->getType())->getNumElements(); | |||
2304 | return isExtractSubvectorMask(ShuffleMask, NumSrcElts, Index); | |||
2305 | } | |||
2306 | ||||
2307 | /// Return true if this shuffle mask is an insert subvector mask. | |||
2308 | /// A valid insert subvector mask inserts the lowest elements of a second | |||
2309 | /// source operand into an in-place first source operand operand. | |||
2310 | /// Both the sub vector width and the insertion index is returned. | |||
2311 | static bool isInsertSubvectorMask(ArrayRef<int> Mask, int NumSrcElts, | |||
2312 | int &NumSubElts, int &Index); | |||
2313 | static bool isInsertSubvectorMask(const Constant *Mask, int NumSrcElts, | |||
2314 | int &NumSubElts, int &Index) { | |||
2315 | assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy( ) && "Shuffle needs vector constant.") ? void (0) : __assert_fail ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2315, __extension__ __PRETTY_FUNCTION__)); | |||
2316 | // Not possible to express a shuffle mask for a scalable vector for this | |||
2317 | // case. | |||
2318 | if (isa<ScalableVectorType>(Mask->getType())) | |||
2319 | return false; | |||
2320 | SmallVector<int, 16> MaskAsInts; | |||
2321 | getShuffleMask(Mask, MaskAsInts); | |||
2322 | return isInsertSubvectorMask(MaskAsInts, NumSrcElts, NumSubElts, Index); | |||
2323 | } | |||
2324 | ||||
2325 | /// Return true if this shuffle mask is an insert subvector mask. | |||
2326 | bool isInsertSubvectorMask(int &NumSubElts, int &Index) const { | |||
2327 | // Not possible to express a shuffle mask for a scalable vector for this | |||
2328 | // case. | |||
2329 | if (isa<ScalableVectorType>(getType())) | |||
2330 | return false; | |||
2331 | ||||
2332 | int NumSrcElts = | |||
2333 | cast<FixedVectorType>(Op<0>()->getType())->getNumElements(); | |||
2334 | return isInsertSubvectorMask(ShuffleMask, NumSrcElts, NumSubElts, Index); | |||
2335 | } | |||
2336 | ||||
2337 | /// Change values in a shuffle permute mask assuming the two vector operands | |||
2338 | /// of length InVecNumElts have swapped position. | |||
2339 | static void commuteShuffleMask(MutableArrayRef<int> Mask, | |||
2340 | unsigned InVecNumElts) { | |||
2341 | for (int &Idx : Mask) { | |||
2342 | if (Idx == -1) | |||
2343 | continue; | |||
2344 | Idx = Idx < (int)InVecNumElts ? Idx + InVecNumElts : Idx - InVecNumElts; | |||
2345 | assert(Idx >= 0 && Idx < (int)InVecNumElts * 2 &&(static_cast <bool> (Idx >= 0 && Idx < (int )InVecNumElts * 2 && "shufflevector mask index out of range" ) ? void (0) : __assert_fail ("Idx >= 0 && Idx < (int)InVecNumElts * 2 && \"shufflevector mask index out of range\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2346, __extension__ __PRETTY_FUNCTION__)) | |||
2346 | "shufflevector mask index out of range")(static_cast <bool> (Idx >= 0 && Idx < (int )InVecNumElts * 2 && "shufflevector mask index out of range" ) ? void (0) : __assert_fail ("Idx >= 0 && Idx < (int)InVecNumElts * 2 && \"shufflevector mask index out of range\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2346, __extension__ __PRETTY_FUNCTION__)); | |||
2347 | } | |||
2348 | } | |||
2349 | ||||
2350 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
2351 | static bool classof(const Instruction *I) { | |||
2352 | return I->getOpcode() == Instruction::ShuffleVector; | |||
2353 | } | |||
2354 | static bool classof(const Value *V) { | |||
2355 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
2356 | } | |||
2357 | }; | |||
2358 | ||||
2359 | template <> | |||
2360 | struct OperandTraits<ShuffleVectorInst> | |||
2361 | : public FixedNumOperandTraits<ShuffleVectorInst, 2> {}; | |||
2362 | ||||
2363 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ShuffleVectorInst, Value)ShuffleVectorInst::op_iterator ShuffleVectorInst::op_begin() { return OperandTraits<ShuffleVectorInst>::op_begin(this ); } ShuffleVectorInst::const_op_iterator ShuffleVectorInst:: op_begin() const { return OperandTraits<ShuffleVectorInst> ::op_begin(const_cast<ShuffleVectorInst*>(this)); } ShuffleVectorInst ::op_iterator ShuffleVectorInst::op_end() { return OperandTraits <ShuffleVectorInst>::op_end(this); } ShuffleVectorInst:: const_op_iterator ShuffleVectorInst::op_end() const { return OperandTraits <ShuffleVectorInst>::op_end(const_cast<ShuffleVectorInst *>(this)); } Value *ShuffleVectorInst::getOperand(unsigned i_nocapture) const { (static_cast <bool> (i_nocapture < OperandTraits<ShuffleVectorInst>::operands(this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ShuffleVectorInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2363, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<ShuffleVectorInst>::op_begin (const_cast<ShuffleVectorInst*>(this))[i_nocapture].get ()); } void ShuffleVectorInst::setOperand(unsigned i_nocapture , Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<ShuffleVectorInst>::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ShuffleVectorInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2363, __extension__ __PRETTY_FUNCTION__)); OperandTraits< ShuffleVectorInst>::op_begin(this)[i_nocapture] = Val_nocapture ; } unsigned ShuffleVectorInst::getNumOperands() const { return OperandTraits<ShuffleVectorInst>::operands(this); } template <int Idx_nocapture> Use &ShuffleVectorInst::Op() { return this->OpFrom<Idx_nocapture>(this); } template <int Idx_nocapture> const Use &ShuffleVectorInst:: Op() const { return this->OpFrom<Idx_nocapture>(this ); } | |||
2364 | ||||
2365 | //===----------------------------------------------------------------------===// | |||
2366 | // ExtractValueInst Class | |||
2367 | //===----------------------------------------------------------------------===// | |||
2368 | ||||
2369 | /// This instruction extracts a struct member or array | |||
2370 | /// element value from an aggregate value. | |||
2371 | /// | |||
2372 | class ExtractValueInst : public UnaryInstruction { | |||
2373 | SmallVector<unsigned, 4> Indices; | |||
2374 | ||||
2375 | ExtractValueInst(const ExtractValueInst &EVI); | |||
2376 | ||||
2377 | /// Constructors - Create a extractvalue instruction with a base aggregate | |||
2378 | /// value and a list of indices. The first ctor can optionally insert before | |||
2379 | /// an existing instruction, the second appends the new instruction to the | |||
2380 | /// specified BasicBlock. | |||
2381 | inline ExtractValueInst(Value *Agg, | |||
2382 | ArrayRef<unsigned> Idxs, | |||
2383 | const Twine &NameStr, | |||
2384 | Instruction *InsertBefore); | |||
2385 | inline ExtractValueInst(Value *Agg, | |||
2386 | ArrayRef<unsigned> Idxs, | |||
2387 | const Twine &NameStr, BasicBlock *InsertAtEnd); | |||
2388 | ||||
2389 | void init(ArrayRef<unsigned> Idxs, const Twine &NameStr); | |||
2390 | ||||
2391 | protected: | |||
2392 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
2393 | friend class Instruction; | |||
2394 | ||||
2395 | ExtractValueInst *cloneImpl() const; | |||
2396 | ||||
2397 | public: | |||
2398 | static ExtractValueInst *Create(Value *Agg, | |||
2399 | ArrayRef<unsigned> Idxs, | |||
2400 | const Twine &NameStr = "", | |||
2401 | Instruction *InsertBefore = nullptr) { | |||
2402 | return new | |||
2403 | ExtractValueInst(Agg, Idxs, NameStr, InsertBefore); | |||
2404 | } | |||
2405 | ||||
2406 | static ExtractValueInst *Create(Value *Agg, | |||
2407 | ArrayRef<unsigned> Idxs, | |||
2408 | const Twine &NameStr, | |||
2409 | BasicBlock *InsertAtEnd) { | |||
2410 | return new ExtractValueInst(Agg, Idxs, NameStr, InsertAtEnd); | |||
2411 | } | |||
2412 | ||||
2413 | /// Returns the type of the element that would be extracted | |||
2414 | /// with an extractvalue instruction with the specified parameters. | |||
2415 | /// | |||
2416 | /// Null is returned if the indices are invalid for the specified type. | |||
2417 | static Type *getIndexedType(Type *Agg, ArrayRef<unsigned> Idxs); | |||
2418 | ||||
2419 | using idx_iterator = const unsigned*; | |||
2420 | ||||
2421 | inline idx_iterator idx_begin() const { return Indices.begin(); } | |||
2422 | inline idx_iterator idx_end() const { return Indices.end(); } | |||
2423 | inline iterator_range<idx_iterator> indices() const { | |||
2424 | return make_range(idx_begin(), idx_end()); | |||
2425 | } | |||
2426 | ||||
2427 | Value *getAggregateOperand() { | |||
2428 | return getOperand(0); | |||
2429 | } | |||
2430 | const Value *getAggregateOperand() const { | |||
2431 | return getOperand(0); | |||
2432 | } | |||
2433 | static unsigned getAggregateOperandIndex() { | |||
2434 | return 0U; // get index for modifying correct operand | |||
2435 | } | |||
2436 | ||||
2437 | ArrayRef<unsigned> getIndices() const { | |||
2438 | return Indices; | |||
2439 | } | |||
2440 | ||||
2441 | unsigned getNumIndices() const { | |||
2442 | return (unsigned)Indices.size(); | |||
2443 | } | |||
2444 | ||||
2445 | bool hasIndices() const { | |||
2446 | return true; | |||
2447 | } | |||
2448 | ||||
2449 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
2450 | static bool classof(const Instruction *I) { | |||
2451 | return I->getOpcode() == Instruction::ExtractValue; | |||
2452 | } | |||
2453 | static bool classof(const Value *V) { | |||
2454 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
2455 | } | |||
2456 | }; | |||
2457 | ||||
2458 | ExtractValueInst::ExtractValueInst(Value *Agg, | |||
2459 | ArrayRef<unsigned> Idxs, | |||
2460 | const Twine &NameStr, | |||
2461 | Instruction *InsertBefore) | |||
2462 | : UnaryInstruction(checkGEPType(getIndexedType(Agg->getType(), Idxs)), | |||
2463 | ExtractValue, Agg, InsertBefore) { | |||
2464 | init(Idxs, NameStr); | |||
2465 | } | |||
2466 | ||||
2467 | ExtractValueInst::ExtractValueInst(Value *Agg, | |||
2468 | ArrayRef<unsigned> Idxs, | |||
2469 | const Twine &NameStr, | |||
2470 | BasicBlock *InsertAtEnd) | |||
2471 | : UnaryInstruction(checkGEPType(getIndexedType(Agg->getType(), Idxs)), | |||
2472 | ExtractValue, Agg, InsertAtEnd) { | |||
2473 | init(Idxs, NameStr); | |||
2474 | } | |||
2475 | ||||
2476 | //===----------------------------------------------------------------------===// | |||
2477 | // InsertValueInst Class | |||
2478 | //===----------------------------------------------------------------------===// | |||
2479 | ||||
2480 | /// This instruction inserts a struct field of array element | |||
2481 | /// value into an aggregate value. | |||
2482 | /// | |||
2483 | class InsertValueInst : public Instruction { | |||
2484 | SmallVector<unsigned, 4> Indices; | |||
2485 | ||||
2486 | InsertValueInst(const InsertValueInst &IVI); | |||
2487 | ||||
2488 | /// Constructors - Create a insertvalue instruction with a base aggregate | |||
2489 | /// value, a value to insert, and a list of indices. The first ctor can | |||
2490 | /// optionally insert before an existing instruction, the second appends | |||
2491 | /// the new instruction to the specified BasicBlock. | |||
2492 | inline InsertValueInst(Value *Agg, Value *Val, | |||
2493 | ArrayRef<unsigned> Idxs, | |||
2494 | const Twine &NameStr, | |||
2495 | Instruction *InsertBefore); | |||
2496 | inline InsertValueInst(Value *Agg, Value *Val, | |||
2497 | ArrayRef<unsigned> Idxs, | |||
2498 | const Twine &NameStr, BasicBlock *InsertAtEnd); | |||
2499 | ||||
2500 | /// Constructors - These two constructors are convenience methods because one | |||
2501 | /// and two index insertvalue instructions are so common. | |||
2502 | InsertValueInst(Value *Agg, Value *Val, unsigned Idx, | |||
2503 | const Twine &NameStr = "", | |||
2504 | Instruction *InsertBefore = nullptr); | |||
2505 | InsertValueInst(Value *Agg, Value *Val, unsigned Idx, const Twine &NameStr, | |||
2506 | BasicBlock *InsertAtEnd); | |||
2507 | ||||
2508 | void init(Value *Agg, Value *Val, ArrayRef<unsigned> Idxs, | |||
2509 | const Twine &NameStr); | |||
2510 | ||||
2511 | protected: | |||
2512 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
2513 | friend class Instruction; | |||
2514 | ||||
2515 | InsertValueInst *cloneImpl() const; | |||
2516 | ||||
2517 | public: | |||
2518 | // allocate space for exactly two operands | |||
2519 | void *operator new(size_t S) { return User::operator new(S, 2); } | |||
2520 | void operator delete(void *Ptr) { User::operator delete(Ptr); } | |||
2521 | ||||
2522 | static InsertValueInst *Create(Value *Agg, Value *Val, | |||
2523 | ArrayRef<unsigned> Idxs, | |||
2524 | const Twine &NameStr = "", | |||
2525 | Instruction *InsertBefore = nullptr) { | |||
2526 | return new InsertValueInst(Agg, Val, Idxs, NameStr, InsertBefore); | |||
2527 | } | |||
2528 | ||||
2529 | static InsertValueInst *Create(Value *Agg, Value *Val, | |||
2530 | ArrayRef<unsigned> Idxs, | |||
2531 | const Twine &NameStr, | |||
2532 | BasicBlock *InsertAtEnd) { | |||
2533 | return new InsertValueInst(Agg, Val, Idxs, NameStr, InsertAtEnd); | |||
2534 | } | |||
2535 | ||||
2536 | /// Transparently provide more efficient getOperand methods. | |||
2537 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
2538 | ||||
2539 | using idx_iterator = const unsigned*; | |||
2540 | ||||
2541 | inline idx_iterator idx_begin() const { return Indices.begin(); } | |||
2542 | inline idx_iterator idx_end() const { return Indices.end(); } | |||
2543 | inline iterator_range<idx_iterator> indices() const { | |||
2544 | return make_range(idx_begin(), idx_end()); | |||
2545 | } | |||
2546 | ||||
2547 | Value *getAggregateOperand() { | |||
2548 | return getOperand(0); | |||
2549 | } | |||
2550 | const Value *getAggregateOperand() const { | |||
2551 | return getOperand(0); | |||
2552 | } | |||
2553 | static unsigned getAggregateOperandIndex() { | |||
2554 | return 0U; // get index for modifying correct operand | |||
2555 | } | |||
2556 | ||||
2557 | Value *getInsertedValueOperand() { | |||
2558 | return getOperand(1); | |||
2559 | } | |||
2560 | const Value *getInsertedValueOperand() const { | |||
2561 | return getOperand(1); | |||
2562 | } | |||
2563 | static unsigned getInsertedValueOperandIndex() { | |||
2564 | return 1U; // get index for modifying correct operand | |||
2565 | } | |||
2566 | ||||
2567 | ArrayRef<unsigned> getIndices() const { | |||
2568 | return Indices; | |||
2569 | } | |||
2570 | ||||
2571 | unsigned getNumIndices() const { | |||
2572 | return (unsigned)Indices.size(); | |||
2573 | } | |||
2574 | ||||
2575 | bool hasIndices() const { | |||
2576 | return true; | |||
2577 | } | |||
2578 | ||||
2579 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
2580 | static bool classof(const Instruction *I) { | |||
2581 | return I->getOpcode() == Instruction::InsertValue; | |||
2582 | } | |||
2583 | static bool classof(const Value *V) { | |||
2584 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
2585 | } | |||
2586 | }; | |||
2587 | ||||
2588 | template <> | |||
2589 | struct OperandTraits<InsertValueInst> : | |||
2590 | public FixedNumOperandTraits<InsertValueInst, 2> { | |||
2591 | }; | |||
2592 | ||||
2593 | InsertValueInst::InsertValueInst(Value *Agg, | |||
2594 | Value *Val, | |||
2595 | ArrayRef<unsigned> Idxs, | |||
2596 | const Twine &NameStr, | |||
2597 | Instruction *InsertBefore) | |||
2598 | : Instruction(Agg->getType(), InsertValue, | |||
2599 | OperandTraits<InsertValueInst>::op_begin(this), | |||
2600 | 2, InsertBefore) { | |||
2601 | init(Agg, Val, Idxs, NameStr); | |||
2602 | } | |||
2603 | ||||
2604 | InsertValueInst::InsertValueInst(Value *Agg, | |||
2605 | Value *Val, | |||
2606 | ArrayRef<unsigned> Idxs, | |||
2607 | const Twine &NameStr, | |||
2608 | BasicBlock *InsertAtEnd) | |||
2609 | : Instruction(Agg->getType(), InsertValue, | |||
2610 | OperandTraits<InsertValueInst>::op_begin(this), | |||
2611 | 2, InsertAtEnd) { | |||
2612 | init(Agg, Val, Idxs, NameStr); | |||
2613 | } | |||
2614 | ||||
2615 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertValueInst, Value)InsertValueInst::op_iterator InsertValueInst::op_begin() { return OperandTraits<InsertValueInst>::op_begin(this); } InsertValueInst ::const_op_iterator InsertValueInst::op_begin() const { return OperandTraits<InsertValueInst>::op_begin(const_cast< InsertValueInst*>(this)); } InsertValueInst::op_iterator InsertValueInst ::op_end() { return OperandTraits<InsertValueInst>::op_end (this); } InsertValueInst::const_op_iterator InsertValueInst:: op_end() const { return OperandTraits<InsertValueInst>:: op_end(const_cast<InsertValueInst*>(this)); } Value *InsertValueInst ::getOperand(unsigned i_nocapture) const { (static_cast <bool > (i_nocapture < OperandTraits<InsertValueInst>:: operands(this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<InsertValueInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2615, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<InsertValueInst>::op_begin (const_cast<InsertValueInst*>(this))[i_nocapture].get() ); } void InsertValueInst::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<InsertValueInst>::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<InsertValueInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2615, __extension__ __PRETTY_FUNCTION__)); OperandTraits< InsertValueInst>::op_begin(this)[i_nocapture] = Val_nocapture ; } unsigned InsertValueInst::getNumOperands() const { return OperandTraits<InsertValueInst>::operands(this); } template <int Idx_nocapture> Use &InsertValueInst::Op() { return this->OpFrom<Idx_nocapture>(this); } template <int Idx_nocapture> const Use &InsertValueInst::Op() const { return this->OpFrom<Idx_nocapture>(this); } | |||
2616 | ||||
2617 | //===----------------------------------------------------------------------===// | |||
2618 | // PHINode Class | |||
2619 | //===----------------------------------------------------------------------===// | |||
2620 | ||||
2621 | // PHINode - The PHINode class is used to represent the magical mystical PHI | |||
2622 | // node, that can not exist in nature, but can be synthesized in a computer | |||
2623 | // scientist's overactive imagination. | |||
2624 | // | |||
2625 | class PHINode : public Instruction { | |||
2626 | /// The number of operands actually allocated. NumOperands is | |||
2627 | /// the number actually in use. | |||
2628 | unsigned ReservedSpace; | |||
2629 | ||||
2630 | PHINode(const PHINode &PN); | |||
2631 | ||||
2632 | explicit PHINode(Type *Ty, unsigned NumReservedValues, | |||
2633 | const Twine &NameStr = "", | |||
2634 | Instruction *InsertBefore = nullptr) | |||
2635 | : Instruction(Ty, Instruction::PHI, nullptr, 0, InsertBefore), | |||
2636 | ReservedSpace(NumReservedValues) { | |||
2637 | assert(!Ty->isTokenTy() && "PHI nodes cannot have token type!")(static_cast <bool> (!Ty->isTokenTy() && "PHI nodes cannot have token type!" ) ? void (0) : __assert_fail ("!Ty->isTokenTy() && \"PHI nodes cannot have token type!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2637, __extension__ __PRETTY_FUNCTION__)); | |||
2638 | setName(NameStr); | |||
2639 | allocHungoffUses(ReservedSpace); | |||
2640 | } | |||
2641 | ||||
2642 | PHINode(Type *Ty, unsigned NumReservedValues, const Twine &NameStr, | |||
2643 | BasicBlock *InsertAtEnd) | |||
2644 | : Instruction(Ty, Instruction::PHI, nullptr, 0, InsertAtEnd), | |||
2645 | ReservedSpace(NumReservedValues) { | |||
2646 | assert(!Ty->isTokenTy() && "PHI nodes cannot have token type!")(static_cast <bool> (!Ty->isTokenTy() && "PHI nodes cannot have token type!" ) ? void (0) : __assert_fail ("!Ty->isTokenTy() && \"PHI nodes cannot have token type!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2646, __extension__ __PRETTY_FUNCTION__)); | |||
| ||||
2647 | setName(NameStr); | |||
2648 | allocHungoffUses(ReservedSpace); | |||
2649 | } | |||
2650 | ||||
2651 | protected: | |||
2652 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
2653 | friend class Instruction; | |||
2654 | ||||
2655 | PHINode *cloneImpl() const; | |||
2656 | ||||
2657 | // allocHungoffUses - this is more complicated than the generic | |||
2658 | // User::allocHungoffUses, because we have to allocate Uses for the incoming | |||
2659 | // values and pointers to the incoming blocks, all in one allocation. | |||
2660 | void allocHungoffUses(unsigned N) { | |||
2661 | User::allocHungoffUses(N, /* IsPhi */ true); | |||
2662 | } | |||
2663 | ||||
2664 | public: | |||
2665 | /// Constructors - NumReservedValues is a hint for the number of incoming | |||
2666 | /// edges that this phi node will have (use 0 if you really have no idea). | |||
2667 | static PHINode *Create(Type *Ty, unsigned NumReservedValues, | |||
2668 | const Twine &NameStr = "", | |||
2669 | Instruction *InsertBefore = nullptr) { | |||
2670 | return new PHINode(Ty, NumReservedValues, NameStr, InsertBefore); | |||
2671 | } | |||
2672 | ||||
2673 | static PHINode *Create(Type *Ty, unsigned NumReservedValues, | |||
2674 | const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
2675 | return new PHINode(Ty, NumReservedValues, NameStr, InsertAtEnd); | |||
2676 | } | |||
2677 | ||||
2678 | /// Provide fast operand accessors | |||
2679 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
2680 | ||||
2681 | // Block iterator interface. This provides access to the list of incoming | |||
2682 | // basic blocks, which parallels the list of incoming values. | |||
2683 | ||||
2684 | using block_iterator = BasicBlock **; | |||
2685 | using const_block_iterator = BasicBlock * const *; | |||
2686 | ||||
2687 | block_iterator block_begin() { | |||
2688 | return reinterpret_cast<block_iterator>(op_begin() + ReservedSpace); | |||
2689 | } | |||
2690 | ||||
2691 | const_block_iterator block_begin() const { | |||
2692 | return reinterpret_cast<const_block_iterator>(op_begin() + ReservedSpace); | |||
2693 | } | |||
2694 | ||||
2695 | block_iterator block_end() { | |||
2696 | return block_begin() + getNumOperands(); | |||
2697 | } | |||
2698 | ||||
2699 | const_block_iterator block_end() const { | |||
2700 | return block_begin() + getNumOperands(); | |||
2701 | } | |||
2702 | ||||
2703 | iterator_range<block_iterator> blocks() { | |||
2704 | return make_range(block_begin(), block_end()); | |||
2705 | } | |||
2706 | ||||
2707 | iterator_range<const_block_iterator> blocks() const { | |||
2708 | return make_range(block_begin(), block_end()); | |||
2709 | } | |||
2710 | ||||
2711 | op_range incoming_values() { return operands(); } | |||
2712 | ||||
2713 | const_op_range incoming_values() const { return operands(); } | |||
2714 | ||||
2715 | /// Return the number of incoming edges | |||
2716 | /// | |||
2717 | unsigned getNumIncomingValues() const { return getNumOperands(); } | |||
2718 | ||||
2719 | /// Return incoming value number x | |||
2720 | /// | |||
2721 | Value *getIncomingValue(unsigned i) const { | |||
2722 | return getOperand(i); | |||
2723 | } | |||
2724 | void setIncomingValue(unsigned i, Value *V) { | |||
2725 | assert(V && "PHI node got a null value!")(static_cast <bool> (V && "PHI node got a null value!" ) ? void (0) : __assert_fail ("V && \"PHI node got a null value!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2725, __extension__ __PRETTY_FUNCTION__)); | |||
2726 | assert(getType() == V->getType() &&(static_cast <bool> (getType() == V->getType() && "All operands to PHI node must be the same type as the PHI node!" ) ? void (0) : __assert_fail ("getType() == V->getType() && \"All operands to PHI node must be the same type as the PHI node!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2727, __extension__ __PRETTY_FUNCTION__)) | |||
2727 | "All operands to PHI node must be the same type as the PHI node!")(static_cast <bool> (getType() == V->getType() && "All operands to PHI node must be the same type as the PHI node!" ) ? void (0) : __assert_fail ("getType() == V->getType() && \"All operands to PHI node must be the same type as the PHI node!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2727, __extension__ __PRETTY_FUNCTION__)); | |||
2728 | setOperand(i, V); | |||
2729 | } | |||
2730 | ||||
2731 | static unsigned getOperandNumForIncomingValue(unsigned i) { | |||
2732 | return i; | |||
2733 | } | |||
2734 | ||||
2735 | static unsigned getIncomingValueNumForOperand(unsigned i) { | |||
2736 | return i; | |||
2737 | } | |||
2738 | ||||
2739 | /// Return incoming basic block number @p i. | |||
2740 | /// | |||
2741 | BasicBlock *getIncomingBlock(unsigned i) const { | |||
2742 | return block_begin()[i]; | |||
2743 | } | |||
2744 | ||||
2745 | /// Return incoming basic block corresponding | |||
2746 | /// to an operand of the PHI. | |||
2747 | /// | |||
2748 | BasicBlock *getIncomingBlock(const Use &U) const { | |||
2749 | assert(this == U.getUser() && "Iterator doesn't point to PHI's Uses?")(static_cast <bool> (this == U.getUser() && "Iterator doesn't point to PHI's Uses?" ) ? void (0) : __assert_fail ("this == U.getUser() && \"Iterator doesn't point to PHI's Uses?\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2749, __extension__ __PRETTY_FUNCTION__)); | |||
2750 | return getIncomingBlock(unsigned(&U - op_begin())); | |||
2751 | } | |||
2752 | ||||
2753 | /// Return incoming basic block corresponding | |||
2754 | /// to value use iterator. | |||
2755 | /// | |||
2756 | BasicBlock *getIncomingBlock(Value::const_user_iterator I) const { | |||
2757 | return getIncomingBlock(I.getUse()); | |||
2758 | } | |||
2759 | ||||
2760 | void setIncomingBlock(unsigned i, BasicBlock *BB) { | |||
2761 | assert(BB && "PHI node got a null basic block!")(static_cast <bool> (BB && "PHI node got a null basic block!" ) ? void (0) : __assert_fail ("BB && \"PHI node got a null basic block!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2761, __extension__ __PRETTY_FUNCTION__)); | |||
2762 | block_begin()[i] = BB; | |||
2763 | } | |||
2764 | ||||
2765 | /// Replace every incoming basic block \p Old to basic block \p New. | |||
2766 | void replaceIncomingBlockWith(const BasicBlock *Old, BasicBlock *New) { | |||
2767 | assert(New && Old && "PHI node got a null basic block!")(static_cast <bool> (New && Old && "PHI node got a null basic block!" ) ? void (0) : __assert_fail ("New && Old && \"PHI node got a null basic block!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2767, __extension__ __PRETTY_FUNCTION__)); | |||
2768 | for (unsigned Op = 0, NumOps = getNumOperands(); Op != NumOps; ++Op) | |||
2769 | if (getIncomingBlock(Op) == Old) | |||
2770 | setIncomingBlock(Op, New); | |||
2771 | } | |||
2772 | ||||
2773 | /// Add an incoming value to the end of the PHI list | |||
2774 | /// | |||
2775 | void addIncoming(Value *V, BasicBlock *BB) { | |||
2776 | if (getNumOperands() == ReservedSpace) | |||
2777 | growOperands(); // Get more space! | |||
2778 | // Initialize some new operands. | |||
2779 | setNumHungOffUseOperands(getNumOperands() + 1); | |||
2780 | setIncomingValue(getNumOperands() - 1, V); | |||
2781 | setIncomingBlock(getNumOperands() - 1, BB); | |||
2782 | } | |||
2783 | ||||
2784 | /// Remove an incoming value. This is useful if a | |||
2785 | /// predecessor basic block is deleted. The value removed is returned. | |||
2786 | /// | |||
2787 | /// If the last incoming value for a PHI node is removed (and DeletePHIIfEmpty | |||
2788 | /// is true), the PHI node is destroyed and any uses of it are replaced with | |||
2789 | /// dummy values. The only time there should be zero incoming values to a PHI | |||
2790 | /// node is when the block is dead, so this strategy is sound. | |||
2791 | /// | |||
2792 | Value *removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty = true); | |||
2793 | ||||
2794 | Value *removeIncomingValue(const BasicBlock *BB, bool DeletePHIIfEmpty=true) { | |||
2795 | int Idx = getBasicBlockIndex(BB); | |||
2796 | assert(Idx >= 0 && "Invalid basic block argument to remove!")(static_cast <bool> (Idx >= 0 && "Invalid basic block argument to remove!" ) ? void (0) : __assert_fail ("Idx >= 0 && \"Invalid basic block argument to remove!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2796, __extension__ __PRETTY_FUNCTION__)); | |||
2797 | return removeIncomingValue(Idx, DeletePHIIfEmpty); | |||
2798 | } | |||
2799 | ||||
2800 | /// Return the first index of the specified basic | |||
2801 | /// block in the value list for this PHI. Returns -1 if no instance. | |||
2802 | /// | |||
2803 | int getBasicBlockIndex(const BasicBlock *BB) const { | |||
2804 | for (unsigned i = 0, e = getNumOperands(); i != e; ++i) | |||
2805 | if (block_begin()[i] == BB) | |||
2806 | return i; | |||
2807 | return -1; | |||
2808 | } | |||
2809 | ||||
2810 | Value *getIncomingValueForBlock(const BasicBlock *BB) const { | |||
2811 | int Idx = getBasicBlockIndex(BB); | |||
2812 | assert(Idx >= 0 && "Invalid basic block argument!")(static_cast <bool> (Idx >= 0 && "Invalid basic block argument!" ) ? void (0) : __assert_fail ("Idx >= 0 && \"Invalid basic block argument!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2812, __extension__ __PRETTY_FUNCTION__)); | |||
2813 | return getIncomingValue(Idx); | |||
2814 | } | |||
2815 | ||||
2816 | /// Set every incoming value(s) for block \p BB to \p V. | |||
2817 | void setIncomingValueForBlock(const BasicBlock *BB, Value *V) { | |||
2818 | assert(BB && "PHI node got a null basic block!")(static_cast <bool> (BB && "PHI node got a null basic block!" ) ? void (0) : __assert_fail ("BB && \"PHI node got a null basic block!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2818, __extension__ __PRETTY_FUNCTION__)); | |||
2819 | bool Found = false; | |||
2820 | for (unsigned Op = 0, NumOps = getNumOperands(); Op != NumOps; ++Op) | |||
2821 | if (getIncomingBlock(Op) == BB) { | |||
2822 | Found = true; | |||
2823 | setIncomingValue(Op, V); | |||
2824 | } | |||
2825 | (void)Found; | |||
2826 | assert(Found && "Invalid basic block argument to set!")(static_cast <bool> (Found && "Invalid basic block argument to set!" ) ? void (0) : __assert_fail ("Found && \"Invalid basic block argument to set!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2826, __extension__ __PRETTY_FUNCTION__)); | |||
2827 | } | |||
2828 | ||||
2829 | /// If the specified PHI node always merges together the | |||
2830 | /// same value, return the value, otherwise return null. | |||
2831 | Value *hasConstantValue() const; | |||
2832 | ||||
2833 | /// Whether the specified PHI node always merges | |||
2834 | /// together the same value, assuming undefs are equal to a unique | |||
2835 | /// non-undef value. | |||
2836 | bool hasConstantOrUndefValue() const; | |||
2837 | ||||
2838 | /// If the PHI node is complete which means all of its parent's predecessors | |||
2839 | /// have incoming value in this PHI, return true, otherwise return false. | |||
2840 | bool isComplete() const { | |||
2841 | return llvm::all_of(predecessors(getParent()), | |||
2842 | [this](const BasicBlock *Pred) { | |||
2843 | return getBasicBlockIndex(Pred) >= 0; | |||
2844 | }); | |||
2845 | } | |||
2846 | ||||
2847 | /// Methods for support type inquiry through isa, cast, and dyn_cast: | |||
2848 | static bool classof(const Instruction *I) { | |||
2849 | return I->getOpcode() == Instruction::PHI; | |||
2850 | } | |||
2851 | static bool classof(const Value *V) { | |||
2852 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
2853 | } | |||
2854 | ||||
2855 | private: | |||
2856 | void growOperands(); | |||
2857 | }; | |||
2858 | ||||
2859 | template <> | |||
2860 | struct OperandTraits<PHINode> : public HungoffOperandTraits<2> { | |||
2861 | }; | |||
2862 | ||||
2863 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(PHINode, Value)PHINode::op_iterator PHINode::op_begin() { return OperandTraits <PHINode>::op_begin(this); } PHINode::const_op_iterator PHINode::op_begin() const { return OperandTraits<PHINode> ::op_begin(const_cast<PHINode*>(this)); } PHINode::op_iterator PHINode::op_end() { return OperandTraits<PHINode>::op_end (this); } PHINode::const_op_iterator PHINode::op_end() const { return OperandTraits<PHINode>::op_end(const_cast<PHINode *>(this)); } Value *PHINode::getOperand(unsigned i_nocapture ) const { (static_cast <bool> (i_nocapture < OperandTraits <PHINode>::operands(this) && "getOperand() out of range!" ) ? void (0) : __assert_fail ("i_nocapture < OperandTraits<PHINode>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2863, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<PHINode>::op_begin(const_cast <PHINode*>(this))[i_nocapture].get()); } void PHINode:: setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<PHINode>:: operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<PHINode>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2863, __extension__ __PRETTY_FUNCTION__)); OperandTraits< PHINode>::op_begin(this)[i_nocapture] = Val_nocapture; } unsigned PHINode::getNumOperands() const { return OperandTraits<PHINode >::operands(this); } template <int Idx_nocapture> Use &PHINode::Op() { return this->OpFrom<Idx_nocapture >(this); } template <int Idx_nocapture> const Use & PHINode::Op() const { return this->OpFrom<Idx_nocapture >(this); } | |||
2864 | ||||
2865 | //===----------------------------------------------------------------------===// | |||
2866 | // LandingPadInst Class | |||
2867 | //===----------------------------------------------------------------------===// | |||
2868 | ||||
2869 | //===--------------------------------------------------------------------------- | |||
2870 | /// The landingpad instruction holds all of the information | |||
2871 | /// necessary to generate correct exception handling. The landingpad instruction | |||
2872 | /// cannot be moved from the top of a landing pad block, which itself is | |||
2873 | /// accessible only from the 'unwind' edge of an invoke. This uses the | |||
2874 | /// SubclassData field in Value to store whether or not the landingpad is a | |||
2875 | /// cleanup. | |||
2876 | /// | |||
2877 | class LandingPadInst : public Instruction { | |||
2878 | using CleanupField = BoolBitfieldElementT<0>; | |||
2879 | ||||
2880 | /// The number of operands actually allocated. NumOperands is | |||
2881 | /// the number actually in use. | |||
2882 | unsigned ReservedSpace; | |||
2883 | ||||
2884 | LandingPadInst(const LandingPadInst &LP); | |||
2885 | ||||
2886 | public: | |||
2887 | enum ClauseType { Catch, Filter }; | |||
2888 | ||||
2889 | private: | |||
2890 | explicit LandingPadInst(Type *RetTy, unsigned NumReservedValues, | |||
2891 | const Twine &NameStr, Instruction *InsertBefore); | |||
2892 | explicit LandingPadInst(Type *RetTy, unsigned NumReservedValues, | |||
2893 | const Twine &NameStr, BasicBlock *InsertAtEnd); | |||
2894 | ||||
2895 | // Allocate space for exactly zero operands. | |||
2896 | void *operator new(size_t S) { return User::operator new(S); } | |||
2897 | ||||
2898 | void growOperands(unsigned Size); | |||
2899 | void init(unsigned NumReservedValues, const Twine &NameStr); | |||
2900 | ||||
2901 | protected: | |||
2902 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
2903 | friend class Instruction; | |||
2904 | ||||
2905 | LandingPadInst *cloneImpl() const; | |||
2906 | ||||
2907 | public: | |||
2908 | void operator delete(void *Ptr) { User::operator delete(Ptr); } | |||
2909 | ||||
2910 | /// Constructors - NumReservedClauses is a hint for the number of incoming | |||
2911 | /// clauses that this landingpad will have (use 0 if you really have no idea). | |||
2912 | static LandingPadInst *Create(Type *RetTy, unsigned NumReservedClauses, | |||
2913 | const Twine &NameStr = "", | |||
2914 | Instruction *InsertBefore = nullptr); | |||
2915 | static LandingPadInst *Create(Type *RetTy, unsigned NumReservedClauses, | |||
2916 | const Twine &NameStr, BasicBlock *InsertAtEnd); | |||
2917 | ||||
2918 | /// Provide fast operand accessors | |||
2919 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
2920 | ||||
2921 | /// Return 'true' if this landingpad instruction is a | |||
2922 | /// cleanup. I.e., it should be run when unwinding even if its landing pad | |||
2923 | /// doesn't catch the exception. | |||
2924 | bool isCleanup() const { return getSubclassData<CleanupField>(); } | |||
2925 | ||||
2926 | /// Indicate that this landingpad instruction is a cleanup. | |||
2927 | void setCleanup(bool V) { setSubclassData<CleanupField>(V); } | |||
2928 | ||||
2929 | /// Add a catch or filter clause to the landing pad. | |||
2930 | void addClause(Constant *ClauseVal); | |||
2931 | ||||
2932 | /// Get the value of the clause at index Idx. Use isCatch/isFilter to | |||
2933 | /// determine what type of clause this is. | |||
2934 | Constant *getClause(unsigned Idx) const { | |||
2935 | return cast<Constant>(getOperandList()[Idx]); | |||
2936 | } | |||
2937 | ||||
2938 | /// Return 'true' if the clause and index Idx is a catch clause. | |||
2939 | bool isCatch(unsigned Idx) const { | |||
2940 | return !isa<ArrayType>(getOperandList()[Idx]->getType()); | |||
2941 | } | |||
2942 | ||||
2943 | /// Return 'true' if the clause and index Idx is a filter clause. | |||
2944 | bool isFilter(unsigned Idx) const { | |||
2945 | return isa<ArrayType>(getOperandList()[Idx]->getType()); | |||
2946 | } | |||
2947 | ||||
2948 | /// Get the number of clauses for this landing pad. | |||
2949 | unsigned getNumClauses() const { return getNumOperands(); } | |||
2950 | ||||
2951 | /// Grow the size of the operand list to accommodate the new | |||
2952 | /// number of clauses. | |||
2953 | void reserveClauses(unsigned Size) { growOperands(Size); } | |||
2954 | ||||
2955 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
2956 | static bool classof(const Instruction *I) { | |||
2957 | return I->getOpcode() == Instruction::LandingPad; | |||
2958 | } | |||
2959 | static bool classof(const Value *V) { | |||
2960 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
2961 | } | |||
2962 | }; | |||
2963 | ||||
2964 | template <> | |||
2965 | struct OperandTraits<LandingPadInst> : public HungoffOperandTraits<1> { | |||
2966 | }; | |||
2967 | ||||
2968 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(LandingPadInst, Value)LandingPadInst::op_iterator LandingPadInst::op_begin() { return OperandTraits<LandingPadInst>::op_begin(this); } LandingPadInst ::const_op_iterator LandingPadInst::op_begin() const { return OperandTraits<LandingPadInst>::op_begin(const_cast< LandingPadInst*>(this)); } LandingPadInst::op_iterator LandingPadInst ::op_end() { return OperandTraits<LandingPadInst>::op_end (this); } LandingPadInst::const_op_iterator LandingPadInst::op_end () const { return OperandTraits<LandingPadInst>::op_end (const_cast<LandingPadInst*>(this)); } Value *LandingPadInst ::getOperand(unsigned i_nocapture) const { (static_cast <bool > (i_nocapture < OperandTraits<LandingPadInst>::operands (this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<LandingPadInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2968, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<LandingPadInst>::op_begin( const_cast<LandingPadInst*>(this))[i_nocapture].get()); } void LandingPadInst::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<LandingPadInst>::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<LandingPadInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 2968, __extension__ __PRETTY_FUNCTION__)); OperandTraits< LandingPadInst>::op_begin(this)[i_nocapture] = Val_nocapture ; } unsigned LandingPadInst::getNumOperands() const { return OperandTraits <LandingPadInst>::operands(this); } template <int Idx_nocapture > Use &LandingPadInst::Op() { return this->OpFrom< Idx_nocapture>(this); } template <int Idx_nocapture> const Use &LandingPadInst::Op() const { return this-> OpFrom<Idx_nocapture>(this); } | |||
2969 | ||||
2970 | //===----------------------------------------------------------------------===// | |||
2971 | // ReturnInst Class | |||
2972 | //===----------------------------------------------------------------------===// | |||
2973 | ||||
2974 | //===--------------------------------------------------------------------------- | |||
2975 | /// Return a value (possibly void), from a function. Execution | |||
2976 | /// does not continue in this function any longer. | |||
2977 | /// | |||
2978 | class ReturnInst : public Instruction { | |||
2979 | ReturnInst(const ReturnInst &RI); | |||
2980 | ||||
2981 | private: | |||
2982 | // ReturnInst constructors: | |||
2983 | // ReturnInst() - 'ret void' instruction | |||
2984 | // ReturnInst( null) - 'ret void' instruction | |||
2985 | // ReturnInst(Value* X) - 'ret X' instruction | |||
2986 | // ReturnInst( null, Inst *I) - 'ret void' instruction, insert before I | |||
2987 | // ReturnInst(Value* X, Inst *I) - 'ret X' instruction, insert before I | |||
2988 | // ReturnInst( null, BB *B) - 'ret void' instruction, insert @ end of B | |||
2989 | // ReturnInst(Value* X, BB *B) - 'ret X' instruction, insert @ end of B | |||
2990 | // | |||
2991 | // NOTE: If the Value* passed is of type void then the constructor behaves as | |||
2992 | // if it was passed NULL. | |||
2993 | explicit ReturnInst(LLVMContext &C, Value *retVal = nullptr, | |||
2994 | Instruction *InsertBefore = nullptr); | |||
2995 | ReturnInst(LLVMContext &C, Value *retVal, BasicBlock *InsertAtEnd); | |||
2996 | explicit ReturnInst(LLVMContext &C, BasicBlock *InsertAtEnd); | |||
2997 | ||||
2998 | protected: | |||
2999 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
3000 | friend class Instruction; | |||
3001 | ||||
3002 | ReturnInst *cloneImpl() const; | |||
3003 | ||||
3004 | public: | |||
3005 | static ReturnInst* Create(LLVMContext &C, Value *retVal = nullptr, | |||
3006 | Instruction *InsertBefore = nullptr) { | |||
3007 | return new(!!retVal) ReturnInst(C, retVal, InsertBefore); | |||
3008 | } | |||
3009 | ||||
3010 | static ReturnInst* Create(LLVMContext &C, Value *retVal, | |||
3011 | BasicBlock *InsertAtEnd) { | |||
3012 | return new(!!retVal) ReturnInst(C, retVal, InsertAtEnd); | |||
3013 | } | |||
3014 | ||||
3015 | static ReturnInst* Create(LLVMContext &C, BasicBlock *InsertAtEnd) { | |||
3016 | return new(0) ReturnInst(C, InsertAtEnd); | |||
3017 | } | |||
3018 | ||||
3019 | /// Provide fast operand accessors | |||
3020 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
3021 | ||||
3022 | /// Convenience accessor. Returns null if there is no return value. | |||
3023 | Value *getReturnValue() const { | |||
3024 | return getNumOperands() != 0 ? getOperand(0) : nullptr; | |||
3025 | } | |||
3026 | ||||
3027 | unsigned getNumSuccessors() const { return 0; } | |||
3028 | ||||
3029 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
3030 | static bool classof(const Instruction *I) { | |||
3031 | return (I->getOpcode() == Instruction::Ret); | |||
3032 | } | |||
3033 | static bool classof(const Value *V) { | |||
3034 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
3035 | } | |||
3036 | ||||
3037 | private: | |||
3038 | BasicBlock *getSuccessor(unsigned idx) const { | |||
3039 | llvm_unreachable("ReturnInst has no successors!")::llvm::llvm_unreachable_internal("ReturnInst has no successors!" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3039); | |||
3040 | } | |||
3041 | ||||
3042 | void setSuccessor(unsigned idx, BasicBlock *B) { | |||
3043 | llvm_unreachable("ReturnInst has no successors!")::llvm::llvm_unreachable_internal("ReturnInst has no successors!" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3043); | |||
3044 | } | |||
3045 | }; | |||
3046 | ||||
3047 | template <> | |||
3048 | struct OperandTraits<ReturnInst> : public VariadicOperandTraits<ReturnInst> { | |||
3049 | }; | |||
3050 | ||||
3051 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ReturnInst, Value)ReturnInst::op_iterator ReturnInst::op_begin() { return OperandTraits <ReturnInst>::op_begin(this); } ReturnInst::const_op_iterator ReturnInst::op_begin() const { return OperandTraits<ReturnInst >::op_begin(const_cast<ReturnInst*>(this)); } ReturnInst ::op_iterator ReturnInst::op_end() { return OperandTraits< ReturnInst>::op_end(this); } ReturnInst::const_op_iterator ReturnInst::op_end() const { return OperandTraits<ReturnInst >::op_end(const_cast<ReturnInst*>(this)); } Value *ReturnInst ::getOperand(unsigned i_nocapture) const { (static_cast <bool > (i_nocapture < OperandTraits<ReturnInst>::operands (this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ReturnInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3051, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<ReturnInst>::op_begin(const_cast <ReturnInst*>(this))[i_nocapture].get()); } void ReturnInst ::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<ReturnInst> ::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ReturnInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3051, __extension__ __PRETTY_FUNCTION__)); OperandTraits< ReturnInst>::op_begin(this)[i_nocapture] = Val_nocapture; } unsigned ReturnInst::getNumOperands() const { return OperandTraits <ReturnInst>::operands(this); } template <int Idx_nocapture > Use &ReturnInst::Op() { return this->OpFrom<Idx_nocapture >(this); } template <int Idx_nocapture> const Use & ReturnInst::Op() const { return this->OpFrom<Idx_nocapture >(this); } | |||
3052 | ||||
3053 | //===----------------------------------------------------------------------===// | |||
3054 | // BranchInst Class | |||
3055 | //===----------------------------------------------------------------------===// | |||
3056 | ||||
3057 | //===--------------------------------------------------------------------------- | |||
3058 | /// Conditional or Unconditional Branch instruction. | |||
3059 | /// | |||
3060 | class BranchInst : public Instruction { | |||
3061 | /// Ops list - Branches are strange. The operands are ordered: | |||
3062 | /// [Cond, FalseDest,] TrueDest. This makes some accessors faster because | |||
3063 | /// they don't have to check for cond/uncond branchness. These are mostly | |||
3064 | /// accessed relative from op_end(). | |||
3065 | BranchInst(const BranchInst &BI); | |||
3066 | // BranchInst constructors (where {B, T, F} are blocks, and C is a condition): | |||
3067 | // BranchInst(BB *B) - 'br B' | |||
3068 | // BranchInst(BB* T, BB *F, Value *C) - 'br C, T, F' | |||
3069 | // BranchInst(BB* B, Inst *I) - 'br B' insert before I | |||
3070 | // BranchInst(BB* T, BB *F, Value *C, Inst *I) - 'br C, T, F', insert before I | |||
3071 | // BranchInst(BB* B, BB *I) - 'br B' insert at end | |||
3072 | // BranchInst(BB* T, BB *F, Value *C, BB *I) - 'br C, T, F', insert at end | |||
3073 | explicit BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore = nullptr); | |||
3074 | BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond, | |||
3075 | Instruction *InsertBefore = nullptr); | |||
3076 | BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd); | |||
3077 | BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond, | |||
3078 | BasicBlock *InsertAtEnd); | |||
3079 | ||||
3080 | void AssertOK(); | |||
3081 | ||||
3082 | protected: | |||
3083 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
3084 | friend class Instruction; | |||
3085 | ||||
3086 | BranchInst *cloneImpl() const; | |||
3087 | ||||
3088 | public: | |||
3089 | /// Iterator type that casts an operand to a basic block. | |||
3090 | /// | |||
3091 | /// This only makes sense because the successors are stored as adjacent | |||
3092 | /// operands for branch instructions. | |||
3093 | struct succ_op_iterator | |||
3094 | : iterator_adaptor_base<succ_op_iterator, value_op_iterator, | |||
3095 | std::random_access_iterator_tag, BasicBlock *, | |||
3096 | ptrdiff_t, BasicBlock *, BasicBlock *> { | |||
3097 | explicit succ_op_iterator(value_op_iterator I) : iterator_adaptor_base(I) {} | |||
3098 | ||||
3099 | BasicBlock *operator*() const { return cast<BasicBlock>(*I); } | |||
3100 | BasicBlock *operator->() const { return operator*(); } | |||
3101 | }; | |||
3102 | ||||
3103 | /// The const version of `succ_op_iterator`. | |||
3104 | struct const_succ_op_iterator | |||
3105 | : iterator_adaptor_base<const_succ_op_iterator, const_value_op_iterator, | |||
3106 | std::random_access_iterator_tag, | |||
3107 | const BasicBlock *, ptrdiff_t, const BasicBlock *, | |||
3108 | const BasicBlock *> { | |||
3109 | explicit const_succ_op_iterator(const_value_op_iterator I) | |||
3110 | : iterator_adaptor_base(I) {} | |||
3111 | ||||
3112 | const BasicBlock *operator*() const { return cast<BasicBlock>(*I); } | |||
3113 | const BasicBlock *operator->() const { return operator*(); } | |||
3114 | }; | |||
3115 | ||||
3116 | static BranchInst *Create(BasicBlock *IfTrue, | |||
3117 | Instruction *InsertBefore = nullptr) { | |||
3118 | return new(1) BranchInst(IfTrue, InsertBefore); | |||
3119 | } | |||
3120 | ||||
3121 | static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *IfFalse, | |||
3122 | Value *Cond, Instruction *InsertBefore = nullptr) { | |||
3123 | return new(3) BranchInst(IfTrue, IfFalse, Cond, InsertBefore); | |||
3124 | } | |||
3125 | ||||
3126 | static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *InsertAtEnd) { | |||
3127 | return new(1) BranchInst(IfTrue, InsertAtEnd); | |||
3128 | } | |||
3129 | ||||
3130 | static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *IfFalse, | |||
3131 | Value *Cond, BasicBlock *InsertAtEnd) { | |||
3132 | return new(3) BranchInst(IfTrue, IfFalse, Cond, InsertAtEnd); | |||
3133 | } | |||
3134 | ||||
3135 | /// Transparently provide more efficient getOperand methods. | |||
3136 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
3137 | ||||
3138 | bool isUnconditional() const { return getNumOperands() == 1; } | |||
3139 | bool isConditional() const { return getNumOperands() == 3; } | |||
3140 | ||||
3141 | Value *getCondition() const { | |||
3142 | assert(isConditional() && "Cannot get condition of an uncond branch!")(static_cast <bool> (isConditional() && "Cannot get condition of an uncond branch!" ) ? void (0) : __assert_fail ("isConditional() && \"Cannot get condition of an uncond branch!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3142, __extension__ __PRETTY_FUNCTION__)); | |||
3143 | return Op<-3>(); | |||
3144 | } | |||
3145 | ||||
3146 | void setCondition(Value *V) { | |||
3147 | assert(isConditional() && "Cannot set condition of unconditional branch!")(static_cast <bool> (isConditional() && "Cannot set condition of unconditional branch!" ) ? void (0) : __assert_fail ("isConditional() && \"Cannot set condition of unconditional branch!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3147, __extension__ __PRETTY_FUNCTION__)); | |||
3148 | Op<-3>() = V; | |||
3149 | } | |||
3150 | ||||
3151 | unsigned getNumSuccessors() const { return 1+isConditional(); } | |||
3152 | ||||
3153 | BasicBlock *getSuccessor(unsigned i) const { | |||
3154 | assert(i < getNumSuccessors() && "Successor # out of range for Branch!")(static_cast <bool> (i < getNumSuccessors() && "Successor # out of range for Branch!") ? void (0) : __assert_fail ("i < getNumSuccessors() && \"Successor # out of range for Branch!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3154, __extension__ __PRETTY_FUNCTION__)); | |||
3155 | return cast_or_null<BasicBlock>((&Op<-1>() - i)->get()); | |||
3156 | } | |||
3157 | ||||
3158 | void setSuccessor(unsigned idx, BasicBlock *NewSucc) { | |||
3159 | assert(idx < getNumSuccessors() && "Successor # out of range for Branch!")(static_cast <bool> (idx < getNumSuccessors() && "Successor # out of range for Branch!") ? void (0) : __assert_fail ("idx < getNumSuccessors() && \"Successor # out of range for Branch!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3159, __extension__ __PRETTY_FUNCTION__)); | |||
3160 | *(&Op<-1>() - idx) = NewSucc; | |||
3161 | } | |||
3162 | ||||
3163 | /// Swap the successors of this branch instruction. | |||
3164 | /// | |||
3165 | /// Swaps the successors of the branch instruction. This also swaps any | |||
3166 | /// branch weight metadata associated with the instruction so that it | |||
3167 | /// continues to map correctly to each operand. | |||
3168 | void swapSuccessors(); | |||
3169 | ||||
3170 | iterator_range<succ_op_iterator> successors() { | |||
3171 | return make_range( | |||
3172 | succ_op_iterator(std::next(value_op_begin(), isConditional() ? 1 : 0)), | |||
3173 | succ_op_iterator(value_op_end())); | |||
3174 | } | |||
3175 | ||||
3176 | iterator_range<const_succ_op_iterator> successors() const { | |||
3177 | return make_range(const_succ_op_iterator( | |||
3178 | std::next(value_op_begin(), isConditional() ? 1 : 0)), | |||
3179 | const_succ_op_iterator(value_op_end())); | |||
3180 | } | |||
3181 | ||||
3182 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
3183 | static bool classof(const Instruction *I) { | |||
3184 | return (I->getOpcode() == Instruction::Br); | |||
3185 | } | |||
3186 | static bool classof(const Value *V) { | |||
3187 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
3188 | } | |||
3189 | }; | |||
3190 | ||||
3191 | template <> | |||
3192 | struct OperandTraits<BranchInst> : public VariadicOperandTraits<BranchInst, 1> { | |||
3193 | }; | |||
3194 | ||||
3195 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(BranchInst, Value)BranchInst::op_iterator BranchInst::op_begin() { return OperandTraits <BranchInst>::op_begin(this); } BranchInst::const_op_iterator BranchInst::op_begin() const { return OperandTraits<BranchInst >::op_begin(const_cast<BranchInst*>(this)); } BranchInst ::op_iterator BranchInst::op_end() { return OperandTraits< BranchInst>::op_end(this); } BranchInst::const_op_iterator BranchInst::op_end() const { return OperandTraits<BranchInst >::op_end(const_cast<BranchInst*>(this)); } Value *BranchInst ::getOperand(unsigned i_nocapture) const { (static_cast <bool > (i_nocapture < OperandTraits<BranchInst>::operands (this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<BranchInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3195, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<BranchInst>::op_begin(const_cast <BranchInst*>(this))[i_nocapture].get()); } void BranchInst ::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<BranchInst> ::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<BranchInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3195, __extension__ __PRETTY_FUNCTION__)); OperandTraits< BranchInst>::op_begin(this)[i_nocapture] = Val_nocapture; } unsigned BranchInst::getNumOperands() const { return OperandTraits <BranchInst>::operands(this); } template <int Idx_nocapture > Use &BranchInst::Op() { return this->OpFrom<Idx_nocapture >(this); } template <int Idx_nocapture> const Use & BranchInst::Op() const { return this->OpFrom<Idx_nocapture >(this); } | |||
3196 | ||||
3197 | //===----------------------------------------------------------------------===// | |||
3198 | // SwitchInst Class | |||
3199 | //===----------------------------------------------------------------------===// | |||
3200 | ||||
3201 | //===--------------------------------------------------------------------------- | |||
3202 | /// Multiway switch | |||
3203 | /// | |||
3204 | class SwitchInst : public Instruction { | |||
3205 | unsigned ReservedSpace; | |||
3206 | ||||
3207 | // Operand[0] = Value to switch on | |||
3208 | // Operand[1] = Default basic block destination | |||
3209 | // Operand[2n ] = Value to match | |||
3210 | // Operand[2n+1] = BasicBlock to go to on match | |||
3211 | SwitchInst(const SwitchInst &SI); | |||
3212 | ||||
3213 | /// Create a new switch instruction, specifying a value to switch on and a | |||
3214 | /// default destination. The number of additional cases can be specified here | |||
3215 | /// to make memory allocation more efficient. This constructor can also | |||
3216 | /// auto-insert before another instruction. | |||
3217 | SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases, | |||
3218 | Instruction *InsertBefore); | |||
3219 | ||||
3220 | /// Create a new switch instruction, specifying a value to switch on and a | |||
3221 | /// default destination. The number of additional cases can be specified here | |||
3222 | /// to make memory allocation more efficient. This constructor also | |||
3223 | /// auto-inserts at the end of the specified BasicBlock. | |||
3224 | SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases, | |||
3225 | BasicBlock *InsertAtEnd); | |||
3226 | ||||
3227 | // allocate space for exactly zero operands | |||
3228 | void *operator new(size_t S) { return User::operator new(S); } | |||
3229 | ||||
3230 | void init(Value *Value, BasicBlock *Default, unsigned NumReserved); | |||
3231 | void growOperands(); | |||
3232 | ||||
3233 | protected: | |||
3234 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
3235 | friend class Instruction; | |||
3236 | ||||
3237 | SwitchInst *cloneImpl() const; | |||
3238 | ||||
3239 | public: | |||
3240 | void operator delete(void *Ptr) { User::operator delete(Ptr); } | |||
3241 | ||||
3242 | // -2 | |||
3243 | static const unsigned DefaultPseudoIndex = static_cast<unsigned>(~0L-1); | |||
3244 | ||||
3245 | template <typename CaseHandleT> class CaseIteratorImpl; | |||
3246 | ||||
3247 | /// A handle to a particular switch case. It exposes a convenient interface | |||
3248 | /// to both the case value and the successor block. | |||
3249 | /// | |||
3250 | /// We define this as a template and instantiate it to form both a const and | |||
3251 | /// non-const handle. | |||
3252 | template <typename SwitchInstT, typename ConstantIntT, typename BasicBlockT> | |||
3253 | class CaseHandleImpl { | |||
3254 | // Directly befriend both const and non-const iterators. | |||
3255 | friend class SwitchInst::CaseIteratorImpl< | |||
3256 | CaseHandleImpl<SwitchInstT, ConstantIntT, BasicBlockT>>; | |||
3257 | ||||
3258 | protected: | |||
3259 | // Expose the switch type we're parameterized with to the iterator. | |||
3260 | using SwitchInstType = SwitchInstT; | |||
3261 | ||||
3262 | SwitchInstT *SI; | |||
3263 | ptrdiff_t Index; | |||
3264 | ||||
3265 | CaseHandleImpl() = default; | |||
3266 | CaseHandleImpl(SwitchInstT *SI, ptrdiff_t Index) : SI(SI), Index(Index) {} | |||
3267 | ||||
3268 | public: | |||
3269 | /// Resolves case value for current case. | |||
3270 | ConstantIntT *getCaseValue() const { | |||
3271 | assert((unsigned)Index < SI->getNumCases() &&(static_cast <bool> ((unsigned)Index < SI->getNumCases () && "Index out the number of cases.") ? void (0) : __assert_fail ("(unsigned)Index < SI->getNumCases() && \"Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3272, __extension__ __PRETTY_FUNCTION__)) | |||
3272 | "Index out the number of cases.")(static_cast <bool> ((unsigned)Index < SI->getNumCases () && "Index out the number of cases.") ? void (0) : __assert_fail ("(unsigned)Index < SI->getNumCases() && \"Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3272, __extension__ __PRETTY_FUNCTION__)); | |||
3273 | return reinterpret_cast<ConstantIntT *>(SI->getOperand(2 + Index * 2)); | |||
3274 | } | |||
3275 | ||||
3276 | /// Resolves successor for current case. | |||
3277 | BasicBlockT *getCaseSuccessor() const { | |||
3278 | assert(((unsigned)Index < SI->getNumCases() ||(static_cast <bool> (((unsigned)Index < SI->getNumCases () || (unsigned)Index == DefaultPseudoIndex) && "Index out the number of cases." ) ? void (0) : __assert_fail ("((unsigned)Index < SI->getNumCases() || (unsigned)Index == DefaultPseudoIndex) && \"Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3280, __extension__ __PRETTY_FUNCTION__)) | |||
3279 | (unsigned)Index == DefaultPseudoIndex) &&(static_cast <bool> (((unsigned)Index < SI->getNumCases () || (unsigned)Index == DefaultPseudoIndex) && "Index out the number of cases." ) ? void (0) : __assert_fail ("((unsigned)Index < SI->getNumCases() || (unsigned)Index == DefaultPseudoIndex) && \"Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3280, __extension__ __PRETTY_FUNCTION__)) | |||
3280 | "Index out the number of cases.")(static_cast <bool> (((unsigned)Index < SI->getNumCases () || (unsigned)Index == DefaultPseudoIndex) && "Index out the number of cases." ) ? void (0) : __assert_fail ("((unsigned)Index < SI->getNumCases() || (unsigned)Index == DefaultPseudoIndex) && \"Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3280, __extension__ __PRETTY_FUNCTION__)); | |||
3281 | return SI->getSuccessor(getSuccessorIndex()); | |||
3282 | } | |||
3283 | ||||
3284 | /// Returns number of current case. | |||
3285 | unsigned getCaseIndex() const { return Index; } | |||
3286 | ||||
3287 | /// Returns successor index for current case successor. | |||
3288 | unsigned getSuccessorIndex() const { | |||
3289 | assert(((unsigned)Index == DefaultPseudoIndex ||(static_cast <bool> (((unsigned)Index == DefaultPseudoIndex || (unsigned)Index < SI->getNumCases()) && "Index out the number of cases." ) ? void (0) : __assert_fail ("((unsigned)Index == DefaultPseudoIndex || (unsigned)Index < SI->getNumCases()) && \"Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3291, __extension__ __PRETTY_FUNCTION__)) | |||
3290 | (unsigned)Index < SI->getNumCases()) &&(static_cast <bool> (((unsigned)Index == DefaultPseudoIndex || (unsigned)Index < SI->getNumCases()) && "Index out the number of cases." ) ? void (0) : __assert_fail ("((unsigned)Index == DefaultPseudoIndex || (unsigned)Index < SI->getNumCases()) && \"Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3291, __extension__ __PRETTY_FUNCTION__)) | |||
3291 | "Index out the number of cases.")(static_cast <bool> (((unsigned)Index == DefaultPseudoIndex || (unsigned)Index < SI->getNumCases()) && "Index out the number of cases." ) ? void (0) : __assert_fail ("((unsigned)Index == DefaultPseudoIndex || (unsigned)Index < SI->getNumCases()) && \"Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3291, __extension__ __PRETTY_FUNCTION__)); | |||
3292 | return (unsigned)Index != DefaultPseudoIndex ? Index + 1 : 0; | |||
3293 | } | |||
3294 | ||||
3295 | bool operator==(const CaseHandleImpl &RHS) const { | |||
3296 | assert(SI == RHS.SI && "Incompatible operators.")(static_cast <bool> (SI == RHS.SI && "Incompatible operators." ) ? void (0) : __assert_fail ("SI == RHS.SI && \"Incompatible operators.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3296, __extension__ __PRETTY_FUNCTION__)); | |||
3297 | return Index == RHS.Index; | |||
3298 | } | |||
3299 | }; | |||
3300 | ||||
3301 | using ConstCaseHandle = | |||
3302 | CaseHandleImpl<const SwitchInst, const ConstantInt, const BasicBlock>; | |||
3303 | ||||
3304 | class CaseHandle | |||
3305 | : public CaseHandleImpl<SwitchInst, ConstantInt, BasicBlock> { | |||
3306 | friend class SwitchInst::CaseIteratorImpl<CaseHandle>; | |||
3307 | ||||
3308 | public: | |||
3309 | CaseHandle(SwitchInst *SI, ptrdiff_t Index) : CaseHandleImpl(SI, Index) {} | |||
3310 | ||||
3311 | /// Sets the new value for current case. | |||
3312 | void setValue(ConstantInt *V) { | |||
3313 | assert((unsigned)Index < SI->getNumCases() &&(static_cast <bool> ((unsigned)Index < SI->getNumCases () && "Index out the number of cases.") ? void (0) : __assert_fail ("(unsigned)Index < SI->getNumCases() && \"Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3314, __extension__ __PRETTY_FUNCTION__)) | |||
3314 | "Index out the number of cases.")(static_cast <bool> ((unsigned)Index < SI->getNumCases () && "Index out the number of cases.") ? void (0) : __assert_fail ("(unsigned)Index < SI->getNumCases() && \"Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3314, __extension__ __PRETTY_FUNCTION__)); | |||
3315 | SI->setOperand(2 + Index*2, reinterpret_cast<Value*>(V)); | |||
3316 | } | |||
3317 | ||||
3318 | /// Sets the new successor for current case. | |||
3319 | void setSuccessor(BasicBlock *S) { | |||
3320 | SI->setSuccessor(getSuccessorIndex(), S); | |||
3321 | } | |||
3322 | }; | |||
3323 | ||||
3324 | template <typename CaseHandleT> | |||
3325 | class CaseIteratorImpl | |||
3326 | : public iterator_facade_base<CaseIteratorImpl<CaseHandleT>, | |||
3327 | std::random_access_iterator_tag, | |||
3328 | CaseHandleT> { | |||
3329 | using SwitchInstT = typename CaseHandleT::SwitchInstType; | |||
3330 | ||||
3331 | CaseHandleT Case; | |||
3332 | ||||
3333 | public: | |||
3334 | /// Default constructed iterator is in an invalid state until assigned to | |||
3335 | /// a case for a particular switch. | |||
3336 | CaseIteratorImpl() = default; | |||
3337 | ||||
3338 | /// Initializes case iterator for given SwitchInst and for given | |||
3339 | /// case number. | |||
3340 | CaseIteratorImpl(SwitchInstT *SI, unsigned CaseNum) : Case(SI, CaseNum) {} | |||
3341 | ||||
3342 | /// Initializes case iterator for given SwitchInst and for given | |||
3343 | /// successor index. | |||
3344 | static CaseIteratorImpl fromSuccessorIndex(SwitchInstT *SI, | |||
3345 | unsigned SuccessorIndex) { | |||
3346 | assert(SuccessorIndex < SI->getNumSuccessors() &&(static_cast <bool> (SuccessorIndex < SI->getNumSuccessors () && "Successor index # out of range!") ? void (0) : __assert_fail ("SuccessorIndex < SI->getNumSuccessors() && \"Successor index # out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3347, __extension__ __PRETTY_FUNCTION__)) | |||
3347 | "Successor index # out of range!")(static_cast <bool> (SuccessorIndex < SI->getNumSuccessors () && "Successor index # out of range!") ? void (0) : __assert_fail ("SuccessorIndex < SI->getNumSuccessors() && \"Successor index # out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3347, __extension__ __PRETTY_FUNCTION__)); | |||
3348 | return SuccessorIndex != 0 ? CaseIteratorImpl(SI, SuccessorIndex - 1) | |||
3349 | : CaseIteratorImpl(SI, DefaultPseudoIndex); | |||
3350 | } | |||
3351 | ||||
3352 | /// Support converting to the const variant. This will be a no-op for const | |||
3353 | /// variant. | |||
3354 | operator CaseIteratorImpl<ConstCaseHandle>() const { | |||
3355 | return CaseIteratorImpl<ConstCaseHandle>(Case.SI, Case.Index); | |||
3356 | } | |||
3357 | ||||
3358 | CaseIteratorImpl &operator+=(ptrdiff_t N) { | |||
3359 | // Check index correctness after addition. | |||
3360 | // Note: Index == getNumCases() means end(). | |||
3361 | assert(Case.Index + N >= 0 &&(static_cast <bool> (Case.Index + N >= 0 && ( unsigned)(Case.Index + N) <= Case.SI->getNumCases() && "Case.Index out the number of cases.") ? void (0) : __assert_fail ("Case.Index + N >= 0 && (unsigned)(Case.Index + N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3363, __extension__ __PRETTY_FUNCTION__)) | |||
3362 | (unsigned)(Case.Index + N) <= Case.SI->getNumCases() &&(static_cast <bool> (Case.Index + N >= 0 && ( unsigned)(Case.Index + N) <= Case.SI->getNumCases() && "Case.Index out the number of cases.") ? void (0) : __assert_fail ("Case.Index + N >= 0 && (unsigned)(Case.Index + N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3363, __extension__ __PRETTY_FUNCTION__)) | |||
3363 | "Case.Index out the number of cases.")(static_cast <bool> (Case.Index + N >= 0 && ( unsigned)(Case.Index + N) <= Case.SI->getNumCases() && "Case.Index out the number of cases.") ? void (0) : __assert_fail ("Case.Index + N >= 0 && (unsigned)(Case.Index + N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3363, __extension__ __PRETTY_FUNCTION__)); | |||
3364 | Case.Index += N; | |||
3365 | return *this; | |||
3366 | } | |||
3367 | CaseIteratorImpl &operator-=(ptrdiff_t N) { | |||
3368 | // Check index correctness after subtraction. | |||
3369 | // Note: Case.Index == getNumCases() means end(). | |||
3370 | assert(Case.Index - N >= 0 &&(static_cast <bool> (Case.Index - N >= 0 && ( unsigned)(Case.Index - N) <= Case.SI->getNumCases() && "Case.Index out the number of cases.") ? void (0) : __assert_fail ("Case.Index - N >= 0 && (unsigned)(Case.Index - N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3372, __extension__ __PRETTY_FUNCTION__)) | |||
3371 | (unsigned)(Case.Index - N) <= Case.SI->getNumCases() &&(static_cast <bool> (Case.Index - N >= 0 && ( unsigned)(Case.Index - N) <= Case.SI->getNumCases() && "Case.Index out the number of cases.") ? void (0) : __assert_fail ("Case.Index - N >= 0 && (unsigned)(Case.Index - N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3372, __extension__ __PRETTY_FUNCTION__)) | |||
3372 | "Case.Index out the number of cases.")(static_cast <bool> (Case.Index - N >= 0 && ( unsigned)(Case.Index - N) <= Case.SI->getNumCases() && "Case.Index out the number of cases.") ? void (0) : __assert_fail ("Case.Index - N >= 0 && (unsigned)(Case.Index - N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3372, __extension__ __PRETTY_FUNCTION__)); | |||
3373 | Case.Index -= N; | |||
3374 | return *this; | |||
3375 | } | |||
3376 | ptrdiff_t operator-(const CaseIteratorImpl &RHS) const { | |||
3377 | assert(Case.SI == RHS.Case.SI && "Incompatible operators.")(static_cast <bool> (Case.SI == RHS.Case.SI && "Incompatible operators." ) ? void (0) : __assert_fail ("Case.SI == RHS.Case.SI && \"Incompatible operators.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3377, __extension__ __PRETTY_FUNCTION__)); | |||
3378 | return Case.Index - RHS.Case.Index; | |||
3379 | } | |||
3380 | bool operator==(const CaseIteratorImpl &RHS) const { | |||
3381 | return Case == RHS.Case; | |||
3382 | } | |||
3383 | bool operator<(const CaseIteratorImpl &RHS) const { | |||
3384 | assert(Case.SI == RHS.Case.SI && "Incompatible operators.")(static_cast <bool> (Case.SI == RHS.Case.SI && "Incompatible operators." ) ? void (0) : __assert_fail ("Case.SI == RHS.Case.SI && \"Incompatible operators.\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3384, __extension__ __PRETTY_FUNCTION__)); | |||
3385 | return Case.Index < RHS.Case.Index; | |||
3386 | } | |||
3387 | CaseHandleT &operator*() { return Case; } | |||
3388 | const CaseHandleT &operator*() const { return Case; } | |||
3389 | }; | |||
3390 | ||||
3391 | using CaseIt = CaseIteratorImpl<CaseHandle>; | |||
3392 | using ConstCaseIt = CaseIteratorImpl<ConstCaseHandle>; | |||
3393 | ||||
3394 | static SwitchInst *Create(Value *Value, BasicBlock *Default, | |||
3395 | unsigned NumCases, | |||
3396 | Instruction *InsertBefore = nullptr) { | |||
3397 | return new SwitchInst(Value, Default, NumCases, InsertBefore); | |||
3398 | } | |||
3399 | ||||
3400 | static SwitchInst *Create(Value *Value, BasicBlock *Default, | |||
3401 | unsigned NumCases, BasicBlock *InsertAtEnd) { | |||
3402 | return new SwitchInst(Value, Default, NumCases, InsertAtEnd); | |||
3403 | } | |||
3404 | ||||
3405 | /// Provide fast operand accessors | |||
3406 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
3407 | ||||
3408 | // Accessor Methods for Switch stmt | |||
3409 | Value *getCondition() const { return getOperand(0); } | |||
3410 | void setCondition(Value *V) { setOperand(0, V); } | |||
3411 | ||||
3412 | BasicBlock *getDefaultDest() const { | |||
3413 | return cast<BasicBlock>(getOperand(1)); | |||
3414 | } | |||
3415 | ||||
3416 | void setDefaultDest(BasicBlock *DefaultCase) { | |||
3417 | setOperand(1, reinterpret_cast<Value*>(DefaultCase)); | |||
3418 | } | |||
3419 | ||||
3420 | /// Return the number of 'cases' in this switch instruction, excluding the | |||
3421 | /// default case. | |||
3422 | unsigned getNumCases() const { | |||
3423 | return getNumOperands()/2 - 1; | |||
3424 | } | |||
3425 | ||||
3426 | /// Returns a read/write iterator that points to the first case in the | |||
3427 | /// SwitchInst. | |||
3428 | CaseIt case_begin() { | |||
3429 | return CaseIt(this, 0); | |||
3430 | } | |||
3431 | ||||
3432 | /// Returns a read-only iterator that points to the first case in the | |||
3433 | /// SwitchInst. | |||
3434 | ConstCaseIt case_begin() const { | |||
3435 | return ConstCaseIt(this, 0); | |||
3436 | } | |||
3437 | ||||
3438 | /// Returns a read/write iterator that points one past the last in the | |||
3439 | /// SwitchInst. | |||
3440 | CaseIt case_end() { | |||
3441 | return CaseIt(this, getNumCases()); | |||
3442 | } | |||
3443 | ||||
3444 | /// Returns a read-only iterator that points one past the last in the | |||
3445 | /// SwitchInst. | |||
3446 | ConstCaseIt case_end() const { | |||
3447 | return ConstCaseIt(this, getNumCases()); | |||
3448 | } | |||
3449 | ||||
3450 | /// Iteration adapter for range-for loops. | |||
3451 | iterator_range<CaseIt> cases() { | |||
3452 | return make_range(case_begin(), case_end()); | |||
3453 | } | |||
3454 | ||||
3455 | /// Constant iteration adapter for range-for loops. | |||
3456 | iterator_range<ConstCaseIt> cases() const { | |||
3457 | return make_range(case_begin(), case_end()); | |||
3458 | } | |||
3459 | ||||
3460 | /// Returns an iterator that points to the default case. | |||
3461 | /// Note: this iterator allows to resolve successor only. Attempt | |||
3462 | /// to resolve case value causes an assertion. | |||
3463 | /// Also note, that increment and decrement also causes an assertion and | |||
3464 | /// makes iterator invalid. | |||
3465 | CaseIt case_default() { | |||
3466 | return CaseIt(this, DefaultPseudoIndex); | |||
3467 | } | |||
3468 | ConstCaseIt case_default() const { | |||
3469 | return ConstCaseIt(this, DefaultPseudoIndex); | |||
3470 | } | |||
3471 | ||||
3472 | /// Search all of the case values for the specified constant. If it is | |||
3473 | /// explicitly handled, return the case iterator of it, otherwise return | |||
3474 | /// default case iterator to indicate that it is handled by the default | |||
3475 | /// handler. | |||
3476 | CaseIt findCaseValue(const ConstantInt *C) { | |||
3477 | CaseIt I = llvm::find_if( | |||
3478 | cases(), [C](CaseHandle &Case) { return Case.getCaseValue() == C; }); | |||
3479 | if (I != case_end()) | |||
3480 | return I; | |||
3481 | ||||
3482 | return case_default(); | |||
3483 | } | |||
3484 | ConstCaseIt findCaseValue(const ConstantInt *C) const { | |||
3485 | ConstCaseIt I = llvm::find_if(cases(), [C](ConstCaseHandle &Case) { | |||
3486 | return Case.getCaseValue() == C; | |||
3487 | }); | |||
3488 | if (I != case_end()) | |||
3489 | return I; | |||
3490 | ||||
3491 | return case_default(); | |||
3492 | } | |||
3493 | ||||
3494 | /// Finds the unique case value for a given successor. Returns null if the | |||
3495 | /// successor is not found, not unique, or is the default case. | |||
3496 | ConstantInt *findCaseDest(BasicBlock *BB) { | |||
3497 | if (BB == getDefaultDest()) | |||
3498 | return nullptr; | |||
3499 | ||||
3500 | ConstantInt *CI = nullptr; | |||
3501 | for (auto Case : cases()) { | |||
3502 | if (Case.getCaseSuccessor() != BB) | |||
3503 | continue; | |||
3504 | ||||
3505 | if (CI) | |||
3506 | return nullptr; // Multiple cases lead to BB. | |||
3507 | ||||
3508 | CI = Case.getCaseValue(); | |||
3509 | } | |||
3510 | ||||
3511 | return CI; | |||
3512 | } | |||
3513 | ||||
3514 | /// Add an entry to the switch instruction. | |||
3515 | /// Note: | |||
3516 | /// This action invalidates case_end(). Old case_end() iterator will | |||
3517 | /// point to the added case. | |||
3518 | void addCase(ConstantInt *OnVal, BasicBlock *Dest); | |||
3519 | ||||
3520 | /// This method removes the specified case and its successor from the switch | |||
3521 | /// instruction. Note that this operation may reorder the remaining cases at | |||
3522 | /// index idx and above. | |||
3523 | /// Note: | |||
3524 | /// This action invalidates iterators for all cases following the one removed, | |||
3525 | /// including the case_end() iterator. It returns an iterator for the next | |||
3526 | /// case. | |||
3527 | CaseIt removeCase(CaseIt I); | |||
3528 | ||||
3529 | unsigned getNumSuccessors() const { return getNumOperands()/2; } | |||
3530 | BasicBlock *getSuccessor(unsigned idx) const { | |||
3531 | assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!")(static_cast <bool> (idx < getNumSuccessors() && "Successor idx out of range for switch!") ? void (0) : __assert_fail ("idx < getNumSuccessors() &&\"Successor idx out of range for switch!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3531, __extension__ __PRETTY_FUNCTION__)); | |||
3532 | return cast<BasicBlock>(getOperand(idx*2+1)); | |||
3533 | } | |||
3534 | void setSuccessor(unsigned idx, BasicBlock *NewSucc) { | |||
3535 | assert(idx < getNumSuccessors() && "Successor # out of range for switch!")(static_cast <bool> (idx < getNumSuccessors() && "Successor # out of range for switch!") ? void (0) : __assert_fail ("idx < getNumSuccessors() && \"Successor # out of range for switch!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3535, __extension__ __PRETTY_FUNCTION__)); | |||
3536 | setOperand(idx * 2 + 1, NewSucc); | |||
3537 | } | |||
3538 | ||||
3539 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
3540 | static bool classof(const Instruction *I) { | |||
3541 | return I->getOpcode() == Instruction::Switch; | |||
3542 | } | |||
3543 | static bool classof(const Value *V) { | |||
3544 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
3545 | } | |||
3546 | }; | |||
3547 | ||||
3548 | /// A wrapper class to simplify modification of SwitchInst cases along with | |||
3549 | /// their prof branch_weights metadata. | |||
3550 | class SwitchInstProfUpdateWrapper { | |||
3551 | SwitchInst &SI; | |||
3552 | Optional<SmallVector<uint32_t, 8> > Weights = None; | |||
3553 | bool Changed = false; | |||
3554 | ||||
3555 | protected: | |||
3556 | static MDNode *getProfBranchWeightsMD(const SwitchInst &SI); | |||
3557 | ||||
3558 | MDNode *buildProfBranchWeightsMD(); | |||
3559 | ||||
3560 | void init(); | |||
3561 | ||||
3562 | public: | |||
3563 | using CaseWeightOpt = Optional<uint32_t>; | |||
3564 | SwitchInst *operator->() { return &SI; } | |||
3565 | SwitchInst &operator*() { return SI; } | |||
3566 | operator SwitchInst *() { return &SI; } | |||
3567 | ||||
3568 | SwitchInstProfUpdateWrapper(SwitchInst &SI) : SI(SI) { init(); } | |||
3569 | ||||
3570 | ~SwitchInstProfUpdateWrapper() { | |||
3571 | if (Changed) | |||
3572 | SI.setMetadata(LLVMContext::MD_prof, buildProfBranchWeightsMD()); | |||
3573 | } | |||
3574 | ||||
3575 | /// Delegate the call to the underlying SwitchInst::removeCase() and remove | |||
3576 | /// correspondent branch weight. | |||
3577 | SwitchInst::CaseIt removeCase(SwitchInst::CaseIt I); | |||
3578 | ||||
3579 | /// Delegate the call to the underlying SwitchInst::addCase() and set the | |||
3580 | /// specified branch weight for the added case. | |||
3581 | void addCase(ConstantInt *OnVal, BasicBlock *Dest, CaseWeightOpt W); | |||
3582 | ||||
3583 | /// Delegate the call to the underlying SwitchInst::eraseFromParent() and mark | |||
3584 | /// this object to not touch the underlying SwitchInst in destructor. | |||
3585 | SymbolTableList<Instruction>::iterator eraseFromParent(); | |||
3586 | ||||
3587 | void setSuccessorWeight(unsigned idx, CaseWeightOpt W); | |||
3588 | CaseWeightOpt getSuccessorWeight(unsigned idx); | |||
3589 | ||||
3590 | static CaseWeightOpt getSuccessorWeight(const SwitchInst &SI, unsigned idx); | |||
3591 | }; | |||
3592 | ||||
3593 | template <> | |||
3594 | struct OperandTraits<SwitchInst> : public HungoffOperandTraits<2> { | |||
3595 | }; | |||
3596 | ||||
3597 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(SwitchInst, Value)SwitchInst::op_iterator SwitchInst::op_begin() { return OperandTraits <SwitchInst>::op_begin(this); } SwitchInst::const_op_iterator SwitchInst::op_begin() const { return OperandTraits<SwitchInst >::op_begin(const_cast<SwitchInst*>(this)); } SwitchInst ::op_iterator SwitchInst::op_end() { return OperandTraits< SwitchInst>::op_end(this); } SwitchInst::const_op_iterator SwitchInst::op_end() const { return OperandTraits<SwitchInst >::op_end(const_cast<SwitchInst*>(this)); } Value *SwitchInst ::getOperand(unsigned i_nocapture) const { (static_cast <bool > (i_nocapture < OperandTraits<SwitchInst>::operands (this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<SwitchInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3597, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<SwitchInst>::op_begin(const_cast <SwitchInst*>(this))[i_nocapture].get()); } void SwitchInst ::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<SwitchInst> ::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<SwitchInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3597, __extension__ __PRETTY_FUNCTION__)); OperandTraits< SwitchInst>::op_begin(this)[i_nocapture] = Val_nocapture; } unsigned SwitchInst::getNumOperands() const { return OperandTraits <SwitchInst>::operands(this); } template <int Idx_nocapture > Use &SwitchInst::Op() { return this->OpFrom<Idx_nocapture >(this); } template <int Idx_nocapture> const Use & SwitchInst::Op() const { return this->OpFrom<Idx_nocapture >(this); } | |||
3598 | ||||
3599 | //===----------------------------------------------------------------------===// | |||
3600 | // IndirectBrInst Class | |||
3601 | //===----------------------------------------------------------------------===// | |||
3602 | ||||
3603 | //===--------------------------------------------------------------------------- | |||
3604 | /// Indirect Branch Instruction. | |||
3605 | /// | |||
3606 | class IndirectBrInst : public Instruction { | |||
3607 | unsigned ReservedSpace; | |||
3608 | ||||
3609 | // Operand[0] = Address to jump to | |||
3610 | // Operand[n+1] = n-th destination | |||
3611 | IndirectBrInst(const IndirectBrInst &IBI); | |||
3612 | ||||
3613 | /// Create a new indirectbr instruction, specifying an | |||
3614 | /// Address to jump to. The number of expected destinations can be specified | |||
3615 | /// here to make memory allocation more efficient. This constructor can also | |||
3616 | /// autoinsert before another instruction. | |||
3617 | IndirectBrInst(Value *Address, unsigned NumDests, Instruction *InsertBefore); | |||
3618 | ||||
3619 | /// Create a new indirectbr instruction, specifying an | |||
3620 | /// Address to jump to. The number of expected destinations can be specified | |||
3621 | /// here to make memory allocation more efficient. This constructor also | |||
3622 | /// autoinserts at the end of the specified BasicBlock. | |||
3623 | IndirectBrInst(Value *Address, unsigned NumDests, BasicBlock *InsertAtEnd); | |||
3624 | ||||
3625 | // allocate space for exactly zero operands | |||
3626 | void *operator new(size_t S) { return User::operator new(S); } | |||
3627 | ||||
3628 | void init(Value *Address, unsigned NumDests); | |||
3629 | void growOperands(); | |||
3630 | ||||
3631 | protected: | |||
3632 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
3633 | friend class Instruction; | |||
3634 | ||||
3635 | IndirectBrInst *cloneImpl() const; | |||
3636 | ||||
3637 | public: | |||
3638 | void operator delete(void *Ptr) { User::operator delete(Ptr); } | |||
3639 | ||||
3640 | /// Iterator type that casts an operand to a basic block. | |||
3641 | /// | |||
3642 | /// This only makes sense because the successors are stored as adjacent | |||
3643 | /// operands for indirectbr instructions. | |||
3644 | struct succ_op_iterator | |||
3645 | : iterator_adaptor_base<succ_op_iterator, value_op_iterator, | |||
3646 | std::random_access_iterator_tag, BasicBlock *, | |||
3647 | ptrdiff_t, BasicBlock *, BasicBlock *> { | |||
3648 | explicit succ_op_iterator(value_op_iterator I) : iterator_adaptor_base(I) {} | |||
3649 | ||||
3650 | BasicBlock *operator*() const { return cast<BasicBlock>(*I); } | |||
3651 | BasicBlock *operator->() const { return operator*(); } | |||
3652 | }; | |||
3653 | ||||
3654 | /// The const version of `succ_op_iterator`. | |||
3655 | struct const_succ_op_iterator | |||
3656 | : iterator_adaptor_base<const_succ_op_iterator, const_value_op_iterator, | |||
3657 | std::random_access_iterator_tag, | |||
3658 | const BasicBlock *, ptrdiff_t, const BasicBlock *, | |||
3659 | const BasicBlock *> { | |||
3660 | explicit const_succ_op_iterator(const_value_op_iterator I) | |||
3661 | : iterator_adaptor_base(I) {} | |||
3662 | ||||
3663 | const BasicBlock *operator*() const { return cast<BasicBlock>(*I); } | |||
3664 | const BasicBlock *operator->() const { return operator*(); } | |||
3665 | }; | |||
3666 | ||||
3667 | static IndirectBrInst *Create(Value *Address, unsigned NumDests, | |||
3668 | Instruction *InsertBefore = nullptr) { | |||
3669 | return new IndirectBrInst(Address, NumDests, InsertBefore); | |||
3670 | } | |||
3671 | ||||
3672 | static IndirectBrInst *Create(Value *Address, unsigned NumDests, | |||
3673 | BasicBlock *InsertAtEnd) { | |||
3674 | return new IndirectBrInst(Address, NumDests, InsertAtEnd); | |||
3675 | } | |||
3676 | ||||
3677 | /// Provide fast operand accessors. | |||
3678 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
3679 | ||||
3680 | // Accessor Methods for IndirectBrInst instruction. | |||
3681 | Value *getAddress() { return getOperand(0); } | |||
3682 | const Value *getAddress() const { return getOperand(0); } | |||
3683 | void setAddress(Value *V) { setOperand(0, V); } | |||
3684 | ||||
3685 | /// return the number of possible destinations in this | |||
3686 | /// indirectbr instruction. | |||
3687 | unsigned getNumDestinations() const { return getNumOperands()-1; } | |||
3688 | ||||
3689 | /// Return the specified destination. | |||
3690 | BasicBlock *getDestination(unsigned i) { return getSuccessor(i); } | |||
3691 | const BasicBlock *getDestination(unsigned i) const { return getSuccessor(i); } | |||
3692 | ||||
3693 | /// Add a destination. | |||
3694 | /// | |||
3695 | void addDestination(BasicBlock *Dest); | |||
3696 | ||||
3697 | /// This method removes the specified successor from the | |||
3698 | /// indirectbr instruction. | |||
3699 | void removeDestination(unsigned i); | |||
3700 | ||||
3701 | unsigned getNumSuccessors() const { return getNumOperands()-1; } | |||
3702 | BasicBlock *getSuccessor(unsigned i) const { | |||
3703 | return cast<BasicBlock>(getOperand(i+1)); | |||
3704 | } | |||
3705 | void setSuccessor(unsigned i, BasicBlock *NewSucc) { | |||
3706 | setOperand(i + 1, NewSucc); | |||
3707 | } | |||
3708 | ||||
3709 | iterator_range<succ_op_iterator> successors() { | |||
3710 | return make_range(succ_op_iterator(std::next(value_op_begin())), | |||
3711 | succ_op_iterator(value_op_end())); | |||
3712 | } | |||
3713 | ||||
3714 | iterator_range<const_succ_op_iterator> successors() const { | |||
3715 | return make_range(const_succ_op_iterator(std::next(value_op_begin())), | |||
3716 | const_succ_op_iterator(value_op_end())); | |||
3717 | } | |||
3718 | ||||
3719 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
3720 | static bool classof(const Instruction *I) { | |||
3721 | return I->getOpcode() == Instruction::IndirectBr; | |||
3722 | } | |||
3723 | static bool classof(const Value *V) { | |||
3724 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
3725 | } | |||
3726 | }; | |||
3727 | ||||
3728 | template <> | |||
3729 | struct OperandTraits<IndirectBrInst> : public HungoffOperandTraits<1> { | |||
3730 | }; | |||
3731 | ||||
3732 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(IndirectBrInst, Value)IndirectBrInst::op_iterator IndirectBrInst::op_begin() { return OperandTraits<IndirectBrInst>::op_begin(this); } IndirectBrInst ::const_op_iterator IndirectBrInst::op_begin() const { return OperandTraits<IndirectBrInst>::op_begin(const_cast< IndirectBrInst*>(this)); } IndirectBrInst::op_iterator IndirectBrInst ::op_end() { return OperandTraits<IndirectBrInst>::op_end (this); } IndirectBrInst::const_op_iterator IndirectBrInst::op_end () const { return OperandTraits<IndirectBrInst>::op_end (const_cast<IndirectBrInst*>(this)); } Value *IndirectBrInst ::getOperand(unsigned i_nocapture) const { (static_cast <bool > (i_nocapture < OperandTraits<IndirectBrInst>::operands (this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<IndirectBrInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3732, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<IndirectBrInst>::op_begin( const_cast<IndirectBrInst*>(this))[i_nocapture].get()); } void IndirectBrInst::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<IndirectBrInst>::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<IndirectBrInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3732, __extension__ __PRETTY_FUNCTION__)); OperandTraits< IndirectBrInst>::op_begin(this)[i_nocapture] = Val_nocapture ; } unsigned IndirectBrInst::getNumOperands() const { return OperandTraits <IndirectBrInst>::operands(this); } template <int Idx_nocapture > Use &IndirectBrInst::Op() { return this->OpFrom< Idx_nocapture>(this); } template <int Idx_nocapture> const Use &IndirectBrInst::Op() const { return this-> OpFrom<Idx_nocapture>(this); } | |||
3733 | ||||
3734 | //===----------------------------------------------------------------------===// | |||
3735 | // InvokeInst Class | |||
3736 | //===----------------------------------------------------------------------===// | |||
3737 | ||||
3738 | /// Invoke instruction. The SubclassData field is used to hold the | |||
3739 | /// calling convention of the call. | |||
3740 | /// | |||
3741 | class InvokeInst : public CallBase { | |||
3742 | /// The number of operands for this call beyond the called function, | |||
3743 | /// arguments, and operand bundles. | |||
3744 | static constexpr int NumExtraOperands = 2; | |||
3745 | ||||
3746 | /// The index from the end of the operand array to the normal destination. | |||
3747 | static constexpr int NormalDestOpEndIdx = -3; | |||
3748 | ||||
3749 | /// The index from the end of the operand array to the unwind destination. | |||
3750 | static constexpr int UnwindDestOpEndIdx = -2; | |||
3751 | ||||
3752 | InvokeInst(const InvokeInst &BI); | |||
3753 | ||||
3754 | /// Construct an InvokeInst given a range of arguments. | |||
3755 | /// | |||
3756 | /// Construct an InvokeInst from a range of arguments | |||
3757 | inline InvokeInst(FunctionType *Ty, Value *Func, BasicBlock *IfNormal, | |||
3758 | BasicBlock *IfException, ArrayRef<Value *> Args, | |||
3759 | ArrayRef<OperandBundleDef> Bundles, int NumOperands, | |||
3760 | const Twine &NameStr, Instruction *InsertBefore); | |||
3761 | ||||
3762 | inline InvokeInst(FunctionType *Ty, Value *Func, BasicBlock *IfNormal, | |||
3763 | BasicBlock *IfException, ArrayRef<Value *> Args, | |||
3764 | ArrayRef<OperandBundleDef> Bundles, int NumOperands, | |||
3765 | const Twine &NameStr, BasicBlock *InsertAtEnd); | |||
3766 | ||||
3767 | void init(FunctionType *Ty, Value *Func, BasicBlock *IfNormal, | |||
3768 | BasicBlock *IfException, ArrayRef<Value *> Args, | |||
3769 | ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr); | |||
3770 | ||||
3771 | /// Compute the number of operands to allocate. | |||
3772 | static int ComputeNumOperands(int NumArgs, int NumBundleInputs = 0) { | |||
3773 | // We need one operand for the called function, plus our extra operands and | |||
3774 | // the input operand counts provided. | |||
3775 | return 1 + NumExtraOperands + NumArgs + NumBundleInputs; | |||
3776 | } | |||
3777 | ||||
3778 | protected: | |||
3779 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
3780 | friend class Instruction; | |||
3781 | ||||
3782 | InvokeInst *cloneImpl() const; | |||
3783 | ||||
3784 | public: | |||
3785 | static InvokeInst *Create(FunctionType *Ty, Value *Func, BasicBlock *IfNormal, | |||
3786 | BasicBlock *IfException, ArrayRef<Value *> Args, | |||
3787 | const Twine &NameStr, | |||
3788 | Instruction *InsertBefore = nullptr) { | |||
3789 | int NumOperands = ComputeNumOperands(Args.size()); | |||
3790 | return new (NumOperands) | |||
3791 | InvokeInst(Ty, Func, IfNormal, IfException, Args, None, NumOperands, | |||
3792 | NameStr, InsertBefore); | |||
3793 | } | |||
3794 | ||||
3795 | static InvokeInst *Create(FunctionType *Ty, Value *Func, BasicBlock *IfNormal, | |||
3796 | BasicBlock *IfException, ArrayRef<Value *> Args, | |||
3797 | ArrayRef<OperandBundleDef> Bundles = None, | |||
3798 | const Twine &NameStr = "", | |||
3799 | Instruction *InsertBefore = nullptr) { | |||
3800 | int NumOperands = | |||
3801 | ComputeNumOperands(Args.size(), CountBundleInputs(Bundles)); | |||
3802 | unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo); | |||
3803 | ||||
3804 | return new (NumOperands, DescriptorBytes) | |||
3805 | InvokeInst(Ty, Func, IfNormal, IfException, Args, Bundles, NumOperands, | |||
3806 | NameStr, InsertBefore); | |||
3807 | } | |||
3808 | ||||
3809 | static InvokeInst *Create(FunctionType *Ty, Value *Func, BasicBlock *IfNormal, | |||
3810 | BasicBlock *IfException, ArrayRef<Value *> Args, | |||
3811 | const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
3812 | int NumOperands = ComputeNumOperands(Args.size()); | |||
3813 | return new (NumOperands) | |||
3814 | InvokeInst(Ty, Func, IfNormal, IfException, Args, None, NumOperands, | |||
3815 | NameStr, InsertAtEnd); | |||
3816 | } | |||
3817 | ||||
3818 | static InvokeInst *Create(FunctionType *Ty, Value *Func, BasicBlock *IfNormal, | |||
3819 | BasicBlock *IfException, ArrayRef<Value *> Args, | |||
3820 | ArrayRef<OperandBundleDef> Bundles, | |||
3821 | const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
3822 | int NumOperands = | |||
3823 | ComputeNumOperands(Args.size(), CountBundleInputs(Bundles)); | |||
3824 | unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo); | |||
3825 | ||||
3826 | return new (NumOperands, DescriptorBytes) | |||
3827 | InvokeInst(Ty, Func, IfNormal, IfException, Args, Bundles, NumOperands, | |||
3828 | NameStr, InsertAtEnd); | |||
3829 | } | |||
3830 | ||||
3831 | static InvokeInst *Create(FunctionCallee Func, BasicBlock *IfNormal, | |||
3832 | BasicBlock *IfException, ArrayRef<Value *> Args, | |||
3833 | const Twine &NameStr, | |||
3834 | Instruction *InsertBefore = nullptr) { | |||
3835 | return Create(Func.getFunctionType(), Func.getCallee(), IfNormal, | |||
3836 | IfException, Args, None, NameStr, InsertBefore); | |||
3837 | } | |||
3838 | ||||
3839 | static InvokeInst *Create(FunctionCallee Func, BasicBlock *IfNormal, | |||
3840 | BasicBlock *IfException, ArrayRef<Value *> Args, | |||
3841 | ArrayRef<OperandBundleDef> Bundles = None, | |||
3842 | const Twine &NameStr = "", | |||
3843 | Instruction *InsertBefore = nullptr) { | |||
3844 | return Create(Func.getFunctionType(), Func.getCallee(), IfNormal, | |||
3845 | IfException, Args, Bundles, NameStr, InsertBefore); | |||
3846 | } | |||
3847 | ||||
3848 | static InvokeInst *Create(FunctionCallee Func, BasicBlock *IfNormal, | |||
3849 | BasicBlock *IfException, ArrayRef<Value *> Args, | |||
3850 | const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
3851 | return Create(Func.getFunctionType(), Func.getCallee(), IfNormal, | |||
3852 | IfException, Args, NameStr, InsertAtEnd); | |||
3853 | } | |||
3854 | ||||
3855 | static InvokeInst *Create(FunctionCallee Func, BasicBlock *IfNormal, | |||
3856 | BasicBlock *IfException, ArrayRef<Value *> Args, | |||
3857 | ArrayRef<OperandBundleDef> Bundles, | |||
3858 | const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
3859 | return Create(Func.getFunctionType(), Func.getCallee(), IfNormal, | |||
3860 | IfException, Args, Bundles, NameStr, InsertAtEnd); | |||
3861 | } | |||
3862 | ||||
3863 | /// Create a clone of \p II with a different set of operand bundles and | |||
3864 | /// insert it before \p InsertPt. | |||
3865 | /// | |||
3866 | /// The returned invoke instruction is identical to \p II in every way except | |||
3867 | /// that the operand bundles for the new instruction are set to the operand | |||
3868 | /// bundles in \p Bundles. | |||
3869 | static InvokeInst *Create(InvokeInst *II, ArrayRef<OperandBundleDef> Bundles, | |||
3870 | Instruction *InsertPt = nullptr); | |||
3871 | ||||
3872 | // get*Dest - Return the destination basic blocks... | |||
3873 | BasicBlock *getNormalDest() const { | |||
3874 | return cast<BasicBlock>(Op<NormalDestOpEndIdx>()); | |||
3875 | } | |||
3876 | BasicBlock *getUnwindDest() const { | |||
3877 | return cast<BasicBlock>(Op<UnwindDestOpEndIdx>()); | |||
3878 | } | |||
3879 | void setNormalDest(BasicBlock *B) { | |||
3880 | Op<NormalDestOpEndIdx>() = reinterpret_cast<Value *>(B); | |||
3881 | } | |||
3882 | void setUnwindDest(BasicBlock *B) { | |||
3883 | Op<UnwindDestOpEndIdx>() = reinterpret_cast<Value *>(B); | |||
3884 | } | |||
3885 | ||||
3886 | /// Get the landingpad instruction from the landing pad | |||
3887 | /// block (the unwind destination). | |||
3888 | LandingPadInst *getLandingPadInst() const; | |||
3889 | ||||
3890 | BasicBlock *getSuccessor(unsigned i) const { | |||
3891 | assert(i < 2 && "Successor # out of range for invoke!")(static_cast <bool> (i < 2 && "Successor # out of range for invoke!" ) ? void (0) : __assert_fail ("i < 2 && \"Successor # out of range for invoke!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3891, __extension__ __PRETTY_FUNCTION__)); | |||
3892 | return i == 0 ? getNormalDest() : getUnwindDest(); | |||
3893 | } | |||
3894 | ||||
3895 | void setSuccessor(unsigned i, BasicBlock *NewSucc) { | |||
3896 | assert(i < 2 && "Successor # out of range for invoke!")(static_cast <bool> (i < 2 && "Successor # out of range for invoke!" ) ? void (0) : __assert_fail ("i < 2 && \"Successor # out of range for invoke!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 3896, __extension__ __PRETTY_FUNCTION__)); | |||
3897 | if (i == 0) | |||
3898 | setNormalDest(NewSucc); | |||
3899 | else | |||
3900 | setUnwindDest(NewSucc); | |||
3901 | } | |||
3902 | ||||
3903 | unsigned getNumSuccessors() const { return 2; } | |||
3904 | ||||
3905 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
3906 | static bool classof(const Instruction *I) { | |||
3907 | return (I->getOpcode() == Instruction::Invoke); | |||
3908 | } | |||
3909 | static bool classof(const Value *V) { | |||
3910 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
3911 | } | |||
3912 | ||||
3913 | private: | |||
3914 | // Shadow Instruction::setInstructionSubclassData with a private forwarding | |||
3915 | // method so that subclasses cannot accidentally use it. | |||
3916 | template <typename Bitfield> | |||
3917 | void setSubclassData(typename Bitfield::Type Value) { | |||
3918 | Instruction::setSubclassData<Bitfield>(Value); | |||
3919 | } | |||
3920 | }; | |||
3921 | ||||
3922 | InvokeInst::InvokeInst(FunctionType *Ty, Value *Func, BasicBlock *IfNormal, | |||
3923 | BasicBlock *IfException, ArrayRef<Value *> Args, | |||
3924 | ArrayRef<OperandBundleDef> Bundles, int NumOperands, | |||
3925 | const Twine &NameStr, Instruction *InsertBefore) | |||
3926 | : CallBase(Ty->getReturnType(), Instruction::Invoke, | |||
3927 | OperandTraits<CallBase>::op_end(this) - NumOperands, NumOperands, | |||
3928 | InsertBefore) { | |||
3929 | init(Ty, Func, IfNormal, IfException, Args, Bundles, NameStr); | |||
3930 | } | |||
3931 | ||||
3932 | InvokeInst::InvokeInst(FunctionType *Ty, Value *Func, BasicBlock *IfNormal, | |||
3933 | BasicBlock *IfException, ArrayRef<Value *> Args, | |||
3934 | ArrayRef<OperandBundleDef> Bundles, int NumOperands, | |||
3935 | const Twine &NameStr, BasicBlock *InsertAtEnd) | |||
3936 | : CallBase(Ty->getReturnType(), Instruction::Invoke, | |||
3937 | OperandTraits<CallBase>::op_end(this) - NumOperands, NumOperands, | |||
3938 | InsertAtEnd) { | |||
3939 | init(Ty, Func, IfNormal, IfException, Args, Bundles, NameStr); | |||
3940 | } | |||
3941 | ||||
3942 | //===----------------------------------------------------------------------===// | |||
3943 | // CallBrInst Class | |||
3944 | //===----------------------------------------------------------------------===// | |||
3945 | ||||
3946 | /// CallBr instruction, tracking function calls that may not return control but | |||
3947 | /// instead transfer it to a third location. The SubclassData field is used to | |||
3948 | /// hold the calling convention of the call. | |||
3949 | /// | |||
3950 | class CallBrInst : public CallBase { | |||
3951 | ||||
3952 | unsigned NumIndirectDests; | |||
3953 | ||||
3954 | CallBrInst(const CallBrInst &BI); | |||
3955 | ||||
3956 | /// Construct a CallBrInst given a range of arguments. | |||
3957 | /// | |||
3958 | /// Construct a CallBrInst from a range of arguments | |||
3959 | inline CallBrInst(FunctionType *Ty, Value *Func, BasicBlock *DefaultDest, | |||
3960 | ArrayRef<BasicBlock *> IndirectDests, | |||
3961 | ArrayRef<Value *> Args, | |||
3962 | ArrayRef<OperandBundleDef> Bundles, int NumOperands, | |||
3963 | const Twine &NameStr, Instruction *InsertBefore); | |||
3964 | ||||
3965 | inline CallBrInst(FunctionType *Ty, Value *Func, BasicBlock *DefaultDest, | |||
3966 | ArrayRef<BasicBlock *> IndirectDests, | |||
3967 | ArrayRef<Value *> Args, | |||
3968 | ArrayRef<OperandBundleDef> Bundles, int NumOperands, | |||
3969 | const Twine &NameStr, BasicBlock *InsertAtEnd); | |||
3970 | ||||
3971 | void init(FunctionType *FTy, Value *Func, BasicBlock *DefaultDest, | |||
3972 | ArrayRef<BasicBlock *> IndirectDests, ArrayRef<Value *> Args, | |||
3973 | ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr); | |||
3974 | ||||
3975 | /// Should the Indirect Destinations change, scan + update the Arg list. | |||
3976 | void updateArgBlockAddresses(unsigned i, BasicBlock *B); | |||
3977 | ||||
3978 | /// Compute the number of operands to allocate. | |||
3979 | static int ComputeNumOperands(int NumArgs, int NumIndirectDests, | |||
3980 | int NumBundleInputs = 0) { | |||
3981 | // We need one operand for the called function, plus our extra operands and | |||
3982 | // the input operand counts provided. | |||
3983 | return 2 + NumIndirectDests + NumArgs + NumBundleInputs; | |||
3984 | } | |||
3985 | ||||
3986 | protected: | |||
3987 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
3988 | friend class Instruction; | |||
3989 | ||||
3990 | CallBrInst *cloneImpl() const; | |||
3991 | ||||
3992 | public: | |||
3993 | static CallBrInst *Create(FunctionType *Ty, Value *Func, | |||
3994 | BasicBlock *DefaultDest, | |||
3995 | ArrayRef<BasicBlock *> IndirectDests, | |||
3996 | ArrayRef<Value *> Args, const Twine &NameStr, | |||
3997 | Instruction *InsertBefore = nullptr) { | |||
3998 | int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size()); | |||
3999 | return new (NumOperands) | |||
4000 | CallBrInst(Ty, Func, DefaultDest, IndirectDests, Args, None, | |||
4001 | NumOperands, NameStr, InsertBefore); | |||
4002 | } | |||
4003 | ||||
4004 | static CallBrInst *Create(FunctionType *Ty, Value *Func, | |||
4005 | BasicBlock *DefaultDest, | |||
4006 | ArrayRef<BasicBlock *> IndirectDests, | |||
4007 | ArrayRef<Value *> Args, | |||
4008 | ArrayRef<OperandBundleDef> Bundles = None, | |||
4009 | const Twine &NameStr = "", | |||
4010 | Instruction *InsertBefore = nullptr) { | |||
4011 | int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size(), | |||
4012 | CountBundleInputs(Bundles)); | |||
4013 | unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo); | |||
4014 | ||||
4015 | return new (NumOperands, DescriptorBytes) | |||
4016 | CallBrInst(Ty, Func, DefaultDest, IndirectDests, Args, Bundles, | |||
4017 | NumOperands, NameStr, InsertBefore); | |||
4018 | } | |||
4019 | ||||
4020 | static CallBrInst *Create(FunctionType *Ty, Value *Func, | |||
4021 | BasicBlock *DefaultDest, | |||
4022 | ArrayRef<BasicBlock *> IndirectDests, | |||
4023 | ArrayRef<Value *> Args, const Twine &NameStr, | |||
4024 | BasicBlock *InsertAtEnd) { | |||
4025 | int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size()); | |||
4026 | return new (NumOperands) | |||
4027 | CallBrInst(Ty, Func, DefaultDest, IndirectDests, Args, None, | |||
4028 | NumOperands, NameStr, InsertAtEnd); | |||
4029 | } | |||
4030 | ||||
4031 | static CallBrInst *Create(FunctionType *Ty, Value *Func, | |||
4032 | BasicBlock *DefaultDest, | |||
4033 | ArrayRef<BasicBlock *> IndirectDests, | |||
4034 | ArrayRef<Value *> Args, | |||
4035 | ArrayRef<OperandBundleDef> Bundles, | |||
4036 | const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
4037 | int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size(), | |||
4038 | CountBundleInputs(Bundles)); | |||
4039 | unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo); | |||
4040 | ||||
4041 | return new (NumOperands, DescriptorBytes) | |||
4042 | CallBrInst(Ty, Func, DefaultDest, IndirectDests, Args, Bundles, | |||
4043 | NumOperands, NameStr, InsertAtEnd); | |||
4044 | } | |||
4045 | ||||
4046 | static CallBrInst *Create(FunctionCallee Func, BasicBlock *DefaultDest, | |||
4047 | ArrayRef<BasicBlock *> IndirectDests, | |||
4048 | ArrayRef<Value *> Args, const Twine &NameStr, | |||
4049 | Instruction *InsertBefore = nullptr) { | |||
4050 | return Create(Func.getFunctionType(), Func.getCallee(), DefaultDest, | |||
4051 | IndirectDests, Args, NameStr, InsertBefore); | |||
4052 | } | |||
4053 | ||||
4054 | static CallBrInst *Create(FunctionCallee Func, BasicBlock *DefaultDest, | |||
4055 | ArrayRef<BasicBlock *> IndirectDests, | |||
4056 | ArrayRef<Value *> Args, | |||
4057 | ArrayRef<OperandBundleDef> Bundles = None, | |||
4058 | const Twine &NameStr = "", | |||
4059 | Instruction *InsertBefore = nullptr) { | |||
4060 | return Create(Func.getFunctionType(), Func.getCallee(), DefaultDest, | |||
4061 | IndirectDests, Args, Bundles, NameStr, InsertBefore); | |||
4062 | } | |||
4063 | ||||
4064 | static CallBrInst *Create(FunctionCallee Func, BasicBlock *DefaultDest, | |||
4065 | ArrayRef<BasicBlock *> IndirectDests, | |||
4066 | ArrayRef<Value *> Args, const Twine &NameStr, | |||
4067 | BasicBlock *InsertAtEnd) { | |||
4068 | return Create(Func.getFunctionType(), Func.getCallee(), DefaultDest, | |||
4069 | IndirectDests, Args, NameStr, InsertAtEnd); | |||
4070 | } | |||
4071 | ||||
4072 | static CallBrInst *Create(FunctionCallee Func, | |||
4073 | BasicBlock *DefaultDest, | |||
4074 | ArrayRef<BasicBlock *> IndirectDests, | |||
4075 | ArrayRef<Value *> Args, | |||
4076 | ArrayRef<OperandBundleDef> Bundles, | |||
4077 | const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
4078 | return Create(Func.getFunctionType(), Func.getCallee(), DefaultDest, | |||
4079 | IndirectDests, Args, Bundles, NameStr, InsertAtEnd); | |||
4080 | } | |||
4081 | ||||
4082 | /// Create a clone of \p CBI with a different set of operand bundles and | |||
4083 | /// insert it before \p InsertPt. | |||
4084 | /// | |||
4085 | /// The returned callbr instruction is identical to \p CBI in every way | |||
4086 | /// except that the operand bundles for the new instruction are set to the | |||
4087 | /// operand bundles in \p Bundles. | |||
4088 | static CallBrInst *Create(CallBrInst *CBI, | |||
4089 | ArrayRef<OperandBundleDef> Bundles, | |||
4090 | Instruction *InsertPt = nullptr); | |||
4091 | ||||
4092 | /// Return the number of callbr indirect dest labels. | |||
4093 | /// | |||
4094 | unsigned getNumIndirectDests() const { return NumIndirectDests; } | |||
4095 | ||||
4096 | /// getIndirectDestLabel - Return the i-th indirect dest label. | |||
4097 | /// | |||
4098 | Value *getIndirectDestLabel(unsigned i) const { | |||
4099 | assert(i < getNumIndirectDests() && "Out of bounds!")(static_cast <bool> (i < getNumIndirectDests() && "Out of bounds!") ? void (0) : __assert_fail ("i < getNumIndirectDests() && \"Out of bounds!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4099, __extension__ __PRETTY_FUNCTION__)); | |||
4100 | return getOperand(i + getNumArgOperands() + getNumTotalBundleOperands() + | |||
4101 | 1); | |||
4102 | } | |||
4103 | ||||
4104 | Value *getIndirectDestLabelUse(unsigned i) const { | |||
4105 | assert(i < getNumIndirectDests() && "Out of bounds!")(static_cast <bool> (i < getNumIndirectDests() && "Out of bounds!") ? void (0) : __assert_fail ("i < getNumIndirectDests() && \"Out of bounds!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4105, __extension__ __PRETTY_FUNCTION__)); | |||
4106 | return getOperandUse(i + getNumArgOperands() + getNumTotalBundleOperands() + | |||
4107 | 1); | |||
4108 | } | |||
4109 | ||||
4110 | // Return the destination basic blocks... | |||
4111 | BasicBlock *getDefaultDest() const { | |||
4112 | return cast<BasicBlock>(*(&Op<-1>() - getNumIndirectDests() - 1)); | |||
4113 | } | |||
4114 | BasicBlock *getIndirectDest(unsigned i) const { | |||
4115 | return cast_or_null<BasicBlock>(*(&Op<-1>() - getNumIndirectDests() + i)); | |||
4116 | } | |||
4117 | SmallVector<BasicBlock *, 16> getIndirectDests() const { | |||
4118 | SmallVector<BasicBlock *, 16> IndirectDests; | |||
4119 | for (unsigned i = 0, e = getNumIndirectDests(); i < e; ++i) | |||
4120 | IndirectDests.push_back(getIndirectDest(i)); | |||
4121 | return IndirectDests; | |||
4122 | } | |||
4123 | void setDefaultDest(BasicBlock *B) { | |||
4124 | *(&Op<-1>() - getNumIndirectDests() - 1) = reinterpret_cast<Value *>(B); | |||
4125 | } | |||
4126 | void setIndirectDest(unsigned i, BasicBlock *B) { | |||
4127 | updateArgBlockAddresses(i, B); | |||
4128 | *(&Op<-1>() - getNumIndirectDests() + i) = reinterpret_cast<Value *>(B); | |||
4129 | } | |||
4130 | ||||
4131 | BasicBlock *getSuccessor(unsigned i) const { | |||
4132 | assert(i < getNumSuccessors() + 1 &&(static_cast <bool> (i < getNumSuccessors() + 1 && "Successor # out of range for callbr!") ? void (0) : __assert_fail ("i < getNumSuccessors() + 1 && \"Successor # out of range for callbr!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4133, __extension__ __PRETTY_FUNCTION__)) | |||
4133 | "Successor # out of range for callbr!")(static_cast <bool> (i < getNumSuccessors() + 1 && "Successor # out of range for callbr!") ? void (0) : __assert_fail ("i < getNumSuccessors() + 1 && \"Successor # out of range for callbr!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4133, __extension__ __PRETTY_FUNCTION__)); | |||
4134 | return i == 0 ? getDefaultDest() : getIndirectDest(i - 1); | |||
4135 | } | |||
4136 | ||||
4137 | void setSuccessor(unsigned i, BasicBlock *NewSucc) { | |||
4138 | assert(i < getNumIndirectDests() + 1 &&(static_cast <bool> (i < getNumIndirectDests() + 1 && "Successor # out of range for callbr!") ? void (0) : __assert_fail ("i < getNumIndirectDests() + 1 && \"Successor # out of range for callbr!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4139, __extension__ __PRETTY_FUNCTION__)) | |||
4139 | "Successor # out of range for callbr!")(static_cast <bool> (i < getNumIndirectDests() + 1 && "Successor # out of range for callbr!") ? void (0) : __assert_fail ("i < getNumIndirectDests() + 1 && \"Successor # out of range for callbr!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4139, __extension__ __PRETTY_FUNCTION__)); | |||
4140 | return i == 0 ? setDefaultDest(NewSucc) : setIndirectDest(i - 1, NewSucc); | |||
4141 | } | |||
4142 | ||||
4143 | unsigned getNumSuccessors() const { return getNumIndirectDests() + 1; } | |||
4144 | ||||
4145 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4146 | static bool classof(const Instruction *I) { | |||
4147 | return (I->getOpcode() == Instruction::CallBr); | |||
4148 | } | |||
4149 | static bool classof(const Value *V) { | |||
4150 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4151 | } | |||
4152 | ||||
4153 | private: | |||
4154 | // Shadow Instruction::setInstructionSubclassData with a private forwarding | |||
4155 | // method so that subclasses cannot accidentally use it. | |||
4156 | template <typename Bitfield> | |||
4157 | void setSubclassData(typename Bitfield::Type Value) { | |||
4158 | Instruction::setSubclassData<Bitfield>(Value); | |||
4159 | } | |||
4160 | }; | |||
4161 | ||||
4162 | CallBrInst::CallBrInst(FunctionType *Ty, Value *Func, BasicBlock *DefaultDest, | |||
4163 | ArrayRef<BasicBlock *> IndirectDests, | |||
4164 | ArrayRef<Value *> Args, | |||
4165 | ArrayRef<OperandBundleDef> Bundles, int NumOperands, | |||
4166 | const Twine &NameStr, Instruction *InsertBefore) | |||
4167 | : CallBase(Ty->getReturnType(), Instruction::CallBr, | |||
4168 | OperandTraits<CallBase>::op_end(this) - NumOperands, NumOperands, | |||
4169 | InsertBefore) { | |||
4170 | init(Ty, Func, DefaultDest, IndirectDests, Args, Bundles, NameStr); | |||
4171 | } | |||
4172 | ||||
4173 | CallBrInst::CallBrInst(FunctionType *Ty, Value *Func, BasicBlock *DefaultDest, | |||
4174 | ArrayRef<BasicBlock *> IndirectDests, | |||
4175 | ArrayRef<Value *> Args, | |||
4176 | ArrayRef<OperandBundleDef> Bundles, int NumOperands, | |||
4177 | const Twine &NameStr, BasicBlock *InsertAtEnd) | |||
4178 | : CallBase(Ty->getReturnType(), Instruction::CallBr, | |||
4179 | OperandTraits<CallBase>::op_end(this) - NumOperands, NumOperands, | |||
4180 | InsertAtEnd) { | |||
4181 | init(Ty, Func, DefaultDest, IndirectDests, Args, Bundles, NameStr); | |||
4182 | } | |||
4183 | ||||
4184 | //===----------------------------------------------------------------------===// | |||
4185 | // ResumeInst Class | |||
4186 | //===----------------------------------------------------------------------===// | |||
4187 | ||||
4188 | //===--------------------------------------------------------------------------- | |||
4189 | /// Resume the propagation of an exception. | |||
4190 | /// | |||
4191 | class ResumeInst : public Instruction { | |||
4192 | ResumeInst(const ResumeInst &RI); | |||
4193 | ||||
4194 | explicit ResumeInst(Value *Exn, Instruction *InsertBefore=nullptr); | |||
4195 | ResumeInst(Value *Exn, BasicBlock *InsertAtEnd); | |||
4196 | ||||
4197 | protected: | |||
4198 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
4199 | friend class Instruction; | |||
4200 | ||||
4201 | ResumeInst *cloneImpl() const; | |||
4202 | ||||
4203 | public: | |||
4204 | static ResumeInst *Create(Value *Exn, Instruction *InsertBefore = nullptr) { | |||
4205 | return new(1) ResumeInst(Exn, InsertBefore); | |||
4206 | } | |||
4207 | ||||
4208 | static ResumeInst *Create(Value *Exn, BasicBlock *InsertAtEnd) { | |||
4209 | return new(1) ResumeInst(Exn, InsertAtEnd); | |||
4210 | } | |||
4211 | ||||
4212 | /// Provide fast operand accessors | |||
4213 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
4214 | ||||
4215 | /// Convenience accessor. | |||
4216 | Value *getValue() const { return Op<0>(); } | |||
4217 | ||||
4218 | unsigned getNumSuccessors() const { return 0; } | |||
4219 | ||||
4220 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4221 | static bool classof(const Instruction *I) { | |||
4222 | return I->getOpcode() == Instruction::Resume; | |||
4223 | } | |||
4224 | static bool classof(const Value *V) { | |||
4225 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4226 | } | |||
4227 | ||||
4228 | private: | |||
4229 | BasicBlock *getSuccessor(unsigned idx) const { | |||
4230 | llvm_unreachable("ResumeInst has no successors!")::llvm::llvm_unreachable_internal("ResumeInst has no successors!" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4230); | |||
4231 | } | |||
4232 | ||||
4233 | void setSuccessor(unsigned idx, BasicBlock *NewSucc) { | |||
4234 | llvm_unreachable("ResumeInst has no successors!")::llvm::llvm_unreachable_internal("ResumeInst has no successors!" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4234); | |||
4235 | } | |||
4236 | }; | |||
4237 | ||||
4238 | template <> | |||
4239 | struct OperandTraits<ResumeInst> : | |||
4240 | public FixedNumOperandTraits<ResumeInst, 1> { | |||
4241 | }; | |||
4242 | ||||
4243 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ResumeInst, Value)ResumeInst::op_iterator ResumeInst::op_begin() { return OperandTraits <ResumeInst>::op_begin(this); } ResumeInst::const_op_iterator ResumeInst::op_begin() const { return OperandTraits<ResumeInst >::op_begin(const_cast<ResumeInst*>(this)); } ResumeInst ::op_iterator ResumeInst::op_end() { return OperandTraits< ResumeInst>::op_end(this); } ResumeInst::const_op_iterator ResumeInst::op_end() const { return OperandTraits<ResumeInst >::op_end(const_cast<ResumeInst*>(this)); } Value *ResumeInst ::getOperand(unsigned i_nocapture) const { (static_cast <bool > (i_nocapture < OperandTraits<ResumeInst>::operands (this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ResumeInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4243, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<ResumeInst>::op_begin(const_cast <ResumeInst*>(this))[i_nocapture].get()); } void ResumeInst ::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<ResumeInst> ::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ResumeInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4243, __extension__ __PRETTY_FUNCTION__)); OperandTraits< ResumeInst>::op_begin(this)[i_nocapture] = Val_nocapture; } unsigned ResumeInst::getNumOperands() const { return OperandTraits <ResumeInst>::operands(this); } template <int Idx_nocapture > Use &ResumeInst::Op() { return this->OpFrom<Idx_nocapture >(this); } template <int Idx_nocapture> const Use & ResumeInst::Op() const { return this->OpFrom<Idx_nocapture >(this); } | |||
4244 | ||||
4245 | //===----------------------------------------------------------------------===// | |||
4246 | // CatchSwitchInst Class | |||
4247 | //===----------------------------------------------------------------------===// | |||
4248 | class CatchSwitchInst : public Instruction { | |||
4249 | using UnwindDestField = BoolBitfieldElementT<0>; | |||
4250 | ||||
4251 | /// The number of operands actually allocated. NumOperands is | |||
4252 | /// the number actually in use. | |||
4253 | unsigned ReservedSpace; | |||
4254 | ||||
4255 | // Operand[0] = Outer scope | |||
4256 | // Operand[1] = Unwind block destination | |||
4257 | // Operand[n] = BasicBlock to go to on match | |||
4258 | CatchSwitchInst(const CatchSwitchInst &CSI); | |||
4259 | ||||
4260 | /// Create a new switch instruction, specifying a | |||
4261 | /// default destination. The number of additional handlers can be specified | |||
4262 | /// here to make memory allocation more efficient. | |||
4263 | /// This constructor can also autoinsert before another instruction. | |||
4264 | CatchSwitchInst(Value *ParentPad, BasicBlock *UnwindDest, | |||
4265 | unsigned NumHandlers, const Twine &NameStr, | |||
4266 | Instruction *InsertBefore); | |||
4267 | ||||
4268 | /// Create a new switch instruction, specifying a | |||
4269 | /// default destination. The number of additional handlers can be specified | |||
4270 | /// here to make memory allocation more efficient. | |||
4271 | /// This constructor also autoinserts at the end of the specified BasicBlock. | |||
4272 | CatchSwitchInst(Value *ParentPad, BasicBlock *UnwindDest, | |||
4273 | unsigned NumHandlers, const Twine &NameStr, | |||
4274 | BasicBlock *InsertAtEnd); | |||
4275 | ||||
4276 | // allocate space for exactly zero operands | |||
4277 | void *operator new(size_t S) { return User::operator new(S); } | |||
4278 | ||||
4279 | void init(Value *ParentPad, BasicBlock *UnwindDest, unsigned NumReserved); | |||
4280 | void growOperands(unsigned Size); | |||
4281 | ||||
4282 | protected: | |||
4283 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
4284 | friend class Instruction; | |||
4285 | ||||
4286 | CatchSwitchInst *cloneImpl() const; | |||
4287 | ||||
4288 | public: | |||
4289 | void operator delete(void *Ptr) { return User::operator delete(Ptr); } | |||
4290 | ||||
4291 | static CatchSwitchInst *Create(Value *ParentPad, BasicBlock *UnwindDest, | |||
4292 | unsigned NumHandlers, | |||
4293 | const Twine &NameStr = "", | |||
4294 | Instruction *InsertBefore = nullptr) { | |||
4295 | return new CatchSwitchInst(ParentPad, UnwindDest, NumHandlers, NameStr, | |||
4296 | InsertBefore); | |||
4297 | } | |||
4298 | ||||
4299 | static CatchSwitchInst *Create(Value *ParentPad, BasicBlock *UnwindDest, | |||
4300 | unsigned NumHandlers, const Twine &NameStr, | |||
4301 | BasicBlock *InsertAtEnd) { | |||
4302 | return new CatchSwitchInst(ParentPad, UnwindDest, NumHandlers, NameStr, | |||
4303 | InsertAtEnd); | |||
4304 | } | |||
4305 | ||||
4306 | /// Provide fast operand accessors | |||
4307 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
4308 | ||||
4309 | // Accessor Methods for CatchSwitch stmt | |||
4310 | Value *getParentPad() const { return getOperand(0); } | |||
4311 | void setParentPad(Value *ParentPad) { setOperand(0, ParentPad); } | |||
4312 | ||||
4313 | // Accessor Methods for CatchSwitch stmt | |||
4314 | bool hasUnwindDest() const { return getSubclassData<UnwindDestField>(); } | |||
4315 | bool unwindsToCaller() const { return !hasUnwindDest(); } | |||
4316 | BasicBlock *getUnwindDest() const { | |||
4317 | if (hasUnwindDest()) | |||
4318 | return cast<BasicBlock>(getOperand(1)); | |||
4319 | return nullptr; | |||
4320 | } | |||
4321 | void setUnwindDest(BasicBlock *UnwindDest) { | |||
4322 | assert(UnwindDest)(static_cast <bool> (UnwindDest) ? void (0) : __assert_fail ("UnwindDest", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4322, __extension__ __PRETTY_FUNCTION__)); | |||
4323 | assert(hasUnwindDest())(static_cast <bool> (hasUnwindDest()) ? void (0) : __assert_fail ("hasUnwindDest()", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4323, __extension__ __PRETTY_FUNCTION__)); | |||
4324 | setOperand(1, UnwindDest); | |||
4325 | } | |||
4326 | ||||
4327 | /// return the number of 'handlers' in this catchswitch | |||
4328 | /// instruction, except the default handler | |||
4329 | unsigned getNumHandlers() const { | |||
4330 | if (hasUnwindDest()) | |||
4331 | return getNumOperands() - 2; | |||
4332 | return getNumOperands() - 1; | |||
4333 | } | |||
4334 | ||||
4335 | private: | |||
4336 | static BasicBlock *handler_helper(Value *V) { return cast<BasicBlock>(V); } | |||
4337 | static const BasicBlock *handler_helper(const Value *V) { | |||
4338 | return cast<BasicBlock>(V); | |||
4339 | } | |||
4340 | ||||
4341 | public: | |||
4342 | using DerefFnTy = BasicBlock *(*)(Value *); | |||
4343 | using handler_iterator = mapped_iterator<op_iterator, DerefFnTy>; | |||
4344 | using handler_range = iterator_range<handler_iterator>; | |||
4345 | using ConstDerefFnTy = const BasicBlock *(*)(const Value *); | |||
4346 | using const_handler_iterator = | |||
4347 | mapped_iterator<const_op_iterator, ConstDerefFnTy>; | |||
4348 | using const_handler_range = iterator_range<const_handler_iterator>; | |||
4349 | ||||
4350 | /// Returns an iterator that points to the first handler in CatchSwitchInst. | |||
4351 | handler_iterator handler_begin() { | |||
4352 | op_iterator It = op_begin() + 1; | |||
4353 | if (hasUnwindDest()) | |||
4354 | ++It; | |||
4355 | return handler_iterator(It, DerefFnTy(handler_helper)); | |||
4356 | } | |||
4357 | ||||
4358 | /// Returns an iterator that points to the first handler in the | |||
4359 | /// CatchSwitchInst. | |||
4360 | const_handler_iterator handler_begin() const { | |||
4361 | const_op_iterator It = op_begin() + 1; | |||
4362 | if (hasUnwindDest()) | |||
4363 | ++It; | |||
4364 | return const_handler_iterator(It, ConstDerefFnTy(handler_helper)); | |||
4365 | } | |||
4366 | ||||
4367 | /// Returns a read-only iterator that points one past the last | |||
4368 | /// handler in the CatchSwitchInst. | |||
4369 | handler_iterator handler_end() { | |||
4370 | return handler_iterator(op_end(), DerefFnTy(handler_helper)); | |||
4371 | } | |||
4372 | ||||
4373 | /// Returns an iterator that points one past the last handler in the | |||
4374 | /// CatchSwitchInst. | |||
4375 | const_handler_iterator handler_end() const { | |||
4376 | return const_handler_iterator(op_end(), ConstDerefFnTy(handler_helper)); | |||
4377 | } | |||
4378 | ||||
4379 | /// iteration adapter for range-for loops. | |||
4380 | handler_range handlers() { | |||
4381 | return make_range(handler_begin(), handler_end()); | |||
4382 | } | |||
4383 | ||||
4384 | /// iteration adapter for range-for loops. | |||
4385 | const_handler_range handlers() const { | |||
4386 | return make_range(handler_begin(), handler_end()); | |||
4387 | } | |||
4388 | ||||
4389 | /// Add an entry to the switch instruction... | |||
4390 | /// Note: | |||
4391 | /// This action invalidates handler_end(). Old handler_end() iterator will | |||
4392 | /// point to the added handler. | |||
4393 | void addHandler(BasicBlock *Dest); | |||
4394 | ||||
4395 | void removeHandler(handler_iterator HI); | |||
4396 | ||||
4397 | unsigned getNumSuccessors() const { return getNumOperands() - 1; } | |||
4398 | BasicBlock *getSuccessor(unsigned Idx) const { | |||
4399 | assert(Idx < getNumSuccessors() &&(static_cast <bool> (Idx < getNumSuccessors() && "Successor # out of range for catchswitch!") ? void (0) : __assert_fail ("Idx < getNumSuccessors() && \"Successor # out of range for catchswitch!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4400, __extension__ __PRETTY_FUNCTION__)) | |||
4400 | "Successor # out of range for catchswitch!")(static_cast <bool> (Idx < getNumSuccessors() && "Successor # out of range for catchswitch!") ? void (0) : __assert_fail ("Idx < getNumSuccessors() && \"Successor # out of range for catchswitch!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4400, __extension__ __PRETTY_FUNCTION__)); | |||
4401 | return cast<BasicBlock>(getOperand(Idx + 1)); | |||
4402 | } | |||
4403 | void setSuccessor(unsigned Idx, BasicBlock *NewSucc) { | |||
4404 | assert(Idx < getNumSuccessors() &&(static_cast <bool> (Idx < getNumSuccessors() && "Successor # out of range for catchswitch!") ? void (0) : __assert_fail ("Idx < getNumSuccessors() && \"Successor # out of range for catchswitch!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4405, __extension__ __PRETTY_FUNCTION__)) | |||
4405 | "Successor # out of range for catchswitch!")(static_cast <bool> (Idx < getNumSuccessors() && "Successor # out of range for catchswitch!") ? void (0) : __assert_fail ("Idx < getNumSuccessors() && \"Successor # out of range for catchswitch!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4405, __extension__ __PRETTY_FUNCTION__)); | |||
4406 | setOperand(Idx + 1, NewSucc); | |||
4407 | } | |||
4408 | ||||
4409 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4410 | static bool classof(const Instruction *I) { | |||
4411 | return I->getOpcode() == Instruction::CatchSwitch; | |||
4412 | } | |||
4413 | static bool classof(const Value *V) { | |||
4414 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4415 | } | |||
4416 | }; | |||
4417 | ||||
4418 | template <> | |||
4419 | struct OperandTraits<CatchSwitchInst> : public HungoffOperandTraits<2> {}; | |||
4420 | ||||
4421 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CatchSwitchInst, Value)CatchSwitchInst::op_iterator CatchSwitchInst::op_begin() { return OperandTraits<CatchSwitchInst>::op_begin(this); } CatchSwitchInst ::const_op_iterator CatchSwitchInst::op_begin() const { return OperandTraits<CatchSwitchInst>::op_begin(const_cast< CatchSwitchInst*>(this)); } CatchSwitchInst::op_iterator CatchSwitchInst ::op_end() { return OperandTraits<CatchSwitchInst>::op_end (this); } CatchSwitchInst::const_op_iterator CatchSwitchInst:: op_end() const { return OperandTraits<CatchSwitchInst>:: op_end(const_cast<CatchSwitchInst*>(this)); } Value *CatchSwitchInst ::getOperand(unsigned i_nocapture) const { (static_cast <bool > (i_nocapture < OperandTraits<CatchSwitchInst>:: operands(this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CatchSwitchInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4421, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<CatchSwitchInst>::op_begin (const_cast<CatchSwitchInst*>(this))[i_nocapture].get() ); } void CatchSwitchInst::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<CatchSwitchInst>::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CatchSwitchInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4421, __extension__ __PRETTY_FUNCTION__)); OperandTraits< CatchSwitchInst>::op_begin(this)[i_nocapture] = Val_nocapture ; } unsigned CatchSwitchInst::getNumOperands() const { return OperandTraits<CatchSwitchInst>::operands(this); } template <int Idx_nocapture> Use &CatchSwitchInst::Op() { return this->OpFrom<Idx_nocapture>(this); } template <int Idx_nocapture> const Use &CatchSwitchInst::Op() const { return this->OpFrom<Idx_nocapture>(this); } | |||
4422 | ||||
4423 | //===----------------------------------------------------------------------===// | |||
4424 | // CleanupPadInst Class | |||
4425 | //===----------------------------------------------------------------------===// | |||
4426 | class CleanupPadInst : public FuncletPadInst { | |||
4427 | private: | |||
4428 | explicit CleanupPadInst(Value *ParentPad, ArrayRef<Value *> Args, | |||
4429 | unsigned Values, const Twine &NameStr, | |||
4430 | Instruction *InsertBefore) | |||
4431 | : FuncletPadInst(Instruction::CleanupPad, ParentPad, Args, Values, | |||
4432 | NameStr, InsertBefore) {} | |||
4433 | explicit CleanupPadInst(Value *ParentPad, ArrayRef<Value *> Args, | |||
4434 | unsigned Values, const Twine &NameStr, | |||
4435 | BasicBlock *InsertAtEnd) | |||
4436 | : FuncletPadInst(Instruction::CleanupPad, ParentPad, Args, Values, | |||
4437 | NameStr, InsertAtEnd) {} | |||
4438 | ||||
4439 | public: | |||
4440 | static CleanupPadInst *Create(Value *ParentPad, ArrayRef<Value *> Args = None, | |||
4441 | const Twine &NameStr = "", | |||
4442 | Instruction *InsertBefore = nullptr) { | |||
4443 | unsigned Values = 1 + Args.size(); | |||
4444 | return new (Values) | |||
4445 | CleanupPadInst(ParentPad, Args, Values, NameStr, InsertBefore); | |||
4446 | } | |||
4447 | ||||
4448 | static CleanupPadInst *Create(Value *ParentPad, ArrayRef<Value *> Args, | |||
4449 | const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
4450 | unsigned Values = 1 + Args.size(); | |||
4451 | return new (Values) | |||
4452 | CleanupPadInst(ParentPad, Args, Values, NameStr, InsertAtEnd); | |||
4453 | } | |||
4454 | ||||
4455 | /// Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4456 | static bool classof(const Instruction *I) { | |||
4457 | return I->getOpcode() == Instruction::CleanupPad; | |||
4458 | } | |||
4459 | static bool classof(const Value *V) { | |||
4460 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4461 | } | |||
4462 | }; | |||
4463 | ||||
4464 | //===----------------------------------------------------------------------===// | |||
4465 | // CatchPadInst Class | |||
4466 | //===----------------------------------------------------------------------===// | |||
4467 | class CatchPadInst : public FuncletPadInst { | |||
4468 | private: | |||
4469 | explicit CatchPadInst(Value *CatchSwitch, ArrayRef<Value *> Args, | |||
4470 | unsigned Values, const Twine &NameStr, | |||
4471 | Instruction *InsertBefore) | |||
4472 | : FuncletPadInst(Instruction::CatchPad, CatchSwitch, Args, Values, | |||
4473 | NameStr, InsertBefore) {} | |||
4474 | explicit CatchPadInst(Value *CatchSwitch, ArrayRef<Value *> Args, | |||
4475 | unsigned Values, const Twine &NameStr, | |||
4476 | BasicBlock *InsertAtEnd) | |||
4477 | : FuncletPadInst(Instruction::CatchPad, CatchSwitch, Args, Values, | |||
4478 | NameStr, InsertAtEnd) {} | |||
4479 | ||||
4480 | public: | |||
4481 | static CatchPadInst *Create(Value *CatchSwitch, ArrayRef<Value *> Args, | |||
4482 | const Twine &NameStr = "", | |||
4483 | Instruction *InsertBefore = nullptr) { | |||
4484 | unsigned Values = 1 + Args.size(); | |||
4485 | return new (Values) | |||
4486 | CatchPadInst(CatchSwitch, Args, Values, NameStr, InsertBefore); | |||
4487 | } | |||
4488 | ||||
4489 | static CatchPadInst *Create(Value *CatchSwitch, ArrayRef<Value *> Args, | |||
4490 | const Twine &NameStr, BasicBlock *InsertAtEnd) { | |||
4491 | unsigned Values = 1 + Args.size(); | |||
4492 | return new (Values) | |||
4493 | CatchPadInst(CatchSwitch, Args, Values, NameStr, InsertAtEnd); | |||
4494 | } | |||
4495 | ||||
4496 | /// Convenience accessors | |||
4497 | CatchSwitchInst *getCatchSwitch() const { | |||
4498 | return cast<CatchSwitchInst>(Op<-1>()); | |||
4499 | } | |||
4500 | void setCatchSwitch(Value *CatchSwitch) { | |||
4501 | assert(CatchSwitch)(static_cast <bool> (CatchSwitch) ? void (0) : __assert_fail ("CatchSwitch", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4501, __extension__ __PRETTY_FUNCTION__)); | |||
4502 | Op<-1>() = CatchSwitch; | |||
4503 | } | |||
4504 | ||||
4505 | /// Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4506 | static bool classof(const Instruction *I) { | |||
4507 | return I->getOpcode() == Instruction::CatchPad; | |||
4508 | } | |||
4509 | static bool classof(const Value *V) { | |||
4510 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4511 | } | |||
4512 | }; | |||
4513 | ||||
4514 | //===----------------------------------------------------------------------===// | |||
4515 | // CatchReturnInst Class | |||
4516 | //===----------------------------------------------------------------------===// | |||
4517 | ||||
4518 | class CatchReturnInst : public Instruction { | |||
4519 | CatchReturnInst(const CatchReturnInst &RI); | |||
4520 | CatchReturnInst(Value *CatchPad, BasicBlock *BB, Instruction *InsertBefore); | |||
4521 | CatchReturnInst(Value *CatchPad, BasicBlock *BB, BasicBlock *InsertAtEnd); | |||
4522 | ||||
4523 | void init(Value *CatchPad, BasicBlock *BB); | |||
4524 | ||||
4525 | protected: | |||
4526 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
4527 | friend class Instruction; | |||
4528 | ||||
4529 | CatchReturnInst *cloneImpl() const; | |||
4530 | ||||
4531 | public: | |||
4532 | static CatchReturnInst *Create(Value *CatchPad, BasicBlock *BB, | |||
4533 | Instruction *InsertBefore = nullptr) { | |||
4534 | assert(CatchPad)(static_cast <bool> (CatchPad) ? void (0) : __assert_fail ("CatchPad", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4534, __extension__ __PRETTY_FUNCTION__)); | |||
4535 | assert(BB)(static_cast <bool> (BB) ? void (0) : __assert_fail ("BB" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4535, __extension__ __PRETTY_FUNCTION__)); | |||
4536 | return new (2) CatchReturnInst(CatchPad, BB, InsertBefore); | |||
4537 | } | |||
4538 | ||||
4539 | static CatchReturnInst *Create(Value *CatchPad, BasicBlock *BB, | |||
4540 | BasicBlock *InsertAtEnd) { | |||
4541 | assert(CatchPad)(static_cast <bool> (CatchPad) ? void (0) : __assert_fail ("CatchPad", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4541, __extension__ __PRETTY_FUNCTION__)); | |||
4542 | assert(BB)(static_cast <bool> (BB) ? void (0) : __assert_fail ("BB" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4542, __extension__ __PRETTY_FUNCTION__)); | |||
4543 | return new (2) CatchReturnInst(CatchPad, BB, InsertAtEnd); | |||
4544 | } | |||
4545 | ||||
4546 | /// Provide fast operand accessors | |||
4547 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
4548 | ||||
4549 | /// Convenience accessors. | |||
4550 | CatchPadInst *getCatchPad() const { return cast<CatchPadInst>(Op<0>()); } | |||
4551 | void setCatchPad(CatchPadInst *CatchPad) { | |||
4552 | assert(CatchPad)(static_cast <bool> (CatchPad) ? void (0) : __assert_fail ("CatchPad", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4552, __extension__ __PRETTY_FUNCTION__)); | |||
4553 | Op<0>() = CatchPad; | |||
4554 | } | |||
4555 | ||||
4556 | BasicBlock *getSuccessor() const { return cast<BasicBlock>(Op<1>()); } | |||
4557 | void setSuccessor(BasicBlock *NewSucc) { | |||
4558 | assert(NewSucc)(static_cast <bool> (NewSucc) ? void (0) : __assert_fail ("NewSucc", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4558, __extension__ __PRETTY_FUNCTION__)); | |||
4559 | Op<1>() = NewSucc; | |||
4560 | } | |||
4561 | unsigned getNumSuccessors() const { return 1; } | |||
4562 | ||||
4563 | /// Get the parentPad of this catchret's catchpad's catchswitch. | |||
4564 | /// The successor block is implicitly a member of this funclet. | |||
4565 | Value *getCatchSwitchParentPad() const { | |||
4566 | return getCatchPad()->getCatchSwitch()->getParentPad(); | |||
4567 | } | |||
4568 | ||||
4569 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4570 | static bool classof(const Instruction *I) { | |||
4571 | return (I->getOpcode() == Instruction::CatchRet); | |||
4572 | } | |||
4573 | static bool classof(const Value *V) { | |||
4574 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4575 | } | |||
4576 | ||||
4577 | private: | |||
4578 | BasicBlock *getSuccessor(unsigned Idx) const { | |||
4579 | assert(Idx < getNumSuccessors() && "Successor # out of range for catchret!")(static_cast <bool> (Idx < getNumSuccessors() && "Successor # out of range for catchret!") ? void (0) : __assert_fail ("Idx < getNumSuccessors() && \"Successor # out of range for catchret!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4579, __extension__ __PRETTY_FUNCTION__)); | |||
4580 | return getSuccessor(); | |||
4581 | } | |||
4582 | ||||
4583 | void setSuccessor(unsigned Idx, BasicBlock *B) { | |||
4584 | assert(Idx < getNumSuccessors() && "Successor # out of range for catchret!")(static_cast <bool> (Idx < getNumSuccessors() && "Successor # out of range for catchret!") ? void (0) : __assert_fail ("Idx < getNumSuccessors() && \"Successor # out of range for catchret!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4584, __extension__ __PRETTY_FUNCTION__)); | |||
4585 | setSuccessor(B); | |||
4586 | } | |||
4587 | }; | |||
4588 | ||||
4589 | template <> | |||
4590 | struct OperandTraits<CatchReturnInst> | |||
4591 | : public FixedNumOperandTraits<CatchReturnInst, 2> {}; | |||
4592 | ||||
4593 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CatchReturnInst, Value)CatchReturnInst::op_iterator CatchReturnInst::op_begin() { return OperandTraits<CatchReturnInst>::op_begin(this); } CatchReturnInst ::const_op_iterator CatchReturnInst::op_begin() const { return OperandTraits<CatchReturnInst>::op_begin(const_cast< CatchReturnInst*>(this)); } CatchReturnInst::op_iterator CatchReturnInst ::op_end() { return OperandTraits<CatchReturnInst>::op_end (this); } CatchReturnInst::const_op_iterator CatchReturnInst:: op_end() const { return OperandTraits<CatchReturnInst>:: op_end(const_cast<CatchReturnInst*>(this)); } Value *CatchReturnInst ::getOperand(unsigned i_nocapture) const { (static_cast <bool > (i_nocapture < OperandTraits<CatchReturnInst>:: operands(this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CatchReturnInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4593, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<CatchReturnInst>::op_begin (const_cast<CatchReturnInst*>(this))[i_nocapture].get() ); } void CatchReturnInst::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<CatchReturnInst>::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CatchReturnInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4593, __extension__ __PRETTY_FUNCTION__)); OperandTraits< CatchReturnInst>::op_begin(this)[i_nocapture] = Val_nocapture ; } unsigned CatchReturnInst::getNumOperands() const { return OperandTraits<CatchReturnInst>::operands(this); } template <int Idx_nocapture> Use &CatchReturnInst::Op() { return this->OpFrom<Idx_nocapture>(this); } template <int Idx_nocapture> const Use &CatchReturnInst::Op() const { return this->OpFrom<Idx_nocapture>(this); } | |||
4594 | ||||
4595 | //===----------------------------------------------------------------------===// | |||
4596 | // CleanupReturnInst Class | |||
4597 | //===----------------------------------------------------------------------===// | |||
4598 | ||||
4599 | class CleanupReturnInst : public Instruction { | |||
4600 | using UnwindDestField = BoolBitfieldElementT<0>; | |||
4601 | ||||
4602 | private: | |||
4603 | CleanupReturnInst(const CleanupReturnInst &RI); | |||
4604 | CleanupReturnInst(Value *CleanupPad, BasicBlock *UnwindBB, unsigned Values, | |||
4605 | Instruction *InsertBefore = nullptr); | |||
4606 | CleanupReturnInst(Value *CleanupPad, BasicBlock *UnwindBB, unsigned Values, | |||
4607 | BasicBlock *InsertAtEnd); | |||
4608 | ||||
4609 | void init(Value *CleanupPad, BasicBlock *UnwindBB); | |||
4610 | ||||
4611 | protected: | |||
4612 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
4613 | friend class Instruction; | |||
4614 | ||||
4615 | CleanupReturnInst *cloneImpl() const; | |||
4616 | ||||
4617 | public: | |||
4618 | static CleanupReturnInst *Create(Value *CleanupPad, | |||
4619 | BasicBlock *UnwindBB = nullptr, | |||
4620 | Instruction *InsertBefore = nullptr) { | |||
4621 | assert(CleanupPad)(static_cast <bool> (CleanupPad) ? void (0) : __assert_fail ("CleanupPad", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4621, __extension__ __PRETTY_FUNCTION__)); | |||
4622 | unsigned Values = 1; | |||
4623 | if (UnwindBB) | |||
4624 | ++Values; | |||
4625 | return new (Values) | |||
4626 | CleanupReturnInst(CleanupPad, UnwindBB, Values, InsertBefore); | |||
4627 | } | |||
4628 | ||||
4629 | static CleanupReturnInst *Create(Value *CleanupPad, BasicBlock *UnwindBB, | |||
4630 | BasicBlock *InsertAtEnd) { | |||
4631 | assert(CleanupPad)(static_cast <bool> (CleanupPad) ? void (0) : __assert_fail ("CleanupPad", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4631, __extension__ __PRETTY_FUNCTION__)); | |||
4632 | unsigned Values = 1; | |||
4633 | if (UnwindBB) | |||
4634 | ++Values; | |||
4635 | return new (Values) | |||
4636 | CleanupReturnInst(CleanupPad, UnwindBB, Values, InsertAtEnd); | |||
4637 | } | |||
4638 | ||||
4639 | /// Provide fast operand accessors | |||
4640 | DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void setOperand(unsigned, Value*); inline op_iterator op_begin(); inline const_op_iterator op_begin() const; inline op_iterator op_end(); inline const_op_iterator op_end() const; protected : template <int> inline Use &Op(); template <int > inline const Use &Op() const; public: inline unsigned getNumOperands() const; | |||
4641 | ||||
4642 | bool hasUnwindDest() const { return getSubclassData<UnwindDestField>(); } | |||
4643 | bool unwindsToCaller() const { return !hasUnwindDest(); } | |||
4644 | ||||
4645 | /// Convenience accessor. | |||
4646 | CleanupPadInst *getCleanupPad() const { | |||
4647 | return cast<CleanupPadInst>(Op<0>()); | |||
4648 | } | |||
4649 | void setCleanupPad(CleanupPadInst *CleanupPad) { | |||
4650 | assert(CleanupPad)(static_cast <bool> (CleanupPad) ? void (0) : __assert_fail ("CleanupPad", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4650, __extension__ __PRETTY_FUNCTION__)); | |||
4651 | Op<0>() = CleanupPad; | |||
4652 | } | |||
4653 | ||||
4654 | unsigned getNumSuccessors() const { return hasUnwindDest() ? 1 : 0; } | |||
4655 | ||||
4656 | BasicBlock *getUnwindDest() const { | |||
4657 | return hasUnwindDest() ? cast<BasicBlock>(Op<1>()) : nullptr; | |||
4658 | } | |||
4659 | void setUnwindDest(BasicBlock *NewDest) { | |||
4660 | assert(NewDest)(static_cast <bool> (NewDest) ? void (0) : __assert_fail ("NewDest", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4660, __extension__ __PRETTY_FUNCTION__)); | |||
4661 | assert(hasUnwindDest())(static_cast <bool> (hasUnwindDest()) ? void (0) : __assert_fail ("hasUnwindDest()", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4661, __extension__ __PRETTY_FUNCTION__)); | |||
4662 | Op<1>() = NewDest; | |||
4663 | } | |||
4664 | ||||
4665 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4666 | static bool classof(const Instruction *I) { | |||
4667 | return (I->getOpcode() == Instruction::CleanupRet); | |||
4668 | } | |||
4669 | static bool classof(const Value *V) { | |||
4670 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4671 | } | |||
4672 | ||||
4673 | private: | |||
4674 | BasicBlock *getSuccessor(unsigned Idx) const { | |||
4675 | assert(Idx == 0)(static_cast <bool> (Idx == 0) ? void (0) : __assert_fail ("Idx == 0", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4675, __extension__ __PRETTY_FUNCTION__)); | |||
4676 | return getUnwindDest(); | |||
4677 | } | |||
4678 | ||||
4679 | void setSuccessor(unsigned Idx, BasicBlock *B) { | |||
4680 | assert(Idx == 0)(static_cast <bool> (Idx == 0) ? void (0) : __assert_fail ("Idx == 0", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4680, __extension__ __PRETTY_FUNCTION__)); | |||
4681 | setUnwindDest(B); | |||
4682 | } | |||
4683 | ||||
4684 | // Shadow Instruction::setInstructionSubclassData with a private forwarding | |||
4685 | // method so that subclasses cannot accidentally use it. | |||
4686 | template <typename Bitfield> | |||
4687 | void setSubclassData(typename Bitfield::Type Value) { | |||
4688 | Instruction::setSubclassData<Bitfield>(Value); | |||
4689 | } | |||
4690 | }; | |||
4691 | ||||
4692 | template <> | |||
4693 | struct OperandTraits<CleanupReturnInst> | |||
4694 | : public VariadicOperandTraits<CleanupReturnInst, /*MINARITY=*/1> {}; | |||
4695 | ||||
4696 | DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CleanupReturnInst, Value)CleanupReturnInst::op_iterator CleanupReturnInst::op_begin() { return OperandTraits<CleanupReturnInst>::op_begin(this ); } CleanupReturnInst::const_op_iterator CleanupReturnInst:: op_begin() const { return OperandTraits<CleanupReturnInst> ::op_begin(const_cast<CleanupReturnInst*>(this)); } CleanupReturnInst ::op_iterator CleanupReturnInst::op_end() { return OperandTraits <CleanupReturnInst>::op_end(this); } CleanupReturnInst:: const_op_iterator CleanupReturnInst::op_end() const { return OperandTraits <CleanupReturnInst>::op_end(const_cast<CleanupReturnInst *>(this)); } Value *CleanupReturnInst::getOperand(unsigned i_nocapture) const { (static_cast <bool> (i_nocapture < OperandTraits<CleanupReturnInst>::operands(this) && "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CleanupReturnInst>::operands(this) && \"getOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4696, __extension__ __PRETTY_FUNCTION__)); return cast_or_null <Value>( OperandTraits<CleanupReturnInst>::op_begin (const_cast<CleanupReturnInst*>(this))[i_nocapture].get ()); } void CleanupReturnInst::setOperand(unsigned i_nocapture , Value *Val_nocapture) { (static_cast <bool> (i_nocapture < OperandTraits<CleanupReturnInst>::operands(this) && "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CleanupReturnInst>::operands(this) && \"setOperand() out of range!\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4696, __extension__ __PRETTY_FUNCTION__)); OperandTraits< CleanupReturnInst>::op_begin(this)[i_nocapture] = Val_nocapture ; } unsigned CleanupReturnInst::getNumOperands() const { return OperandTraits<CleanupReturnInst>::operands(this); } template <int Idx_nocapture> Use &CleanupReturnInst::Op() { return this->OpFrom<Idx_nocapture>(this); } template <int Idx_nocapture> const Use &CleanupReturnInst:: Op() const { return this->OpFrom<Idx_nocapture>(this ); } | |||
4697 | ||||
4698 | //===----------------------------------------------------------------------===// | |||
4699 | // UnreachableInst Class | |||
4700 | //===----------------------------------------------------------------------===// | |||
4701 | ||||
4702 | //===--------------------------------------------------------------------------- | |||
4703 | /// This function has undefined behavior. In particular, the | |||
4704 | /// presence of this instruction indicates some higher level knowledge that the | |||
4705 | /// end of the block cannot be reached. | |||
4706 | /// | |||
4707 | class UnreachableInst : public Instruction { | |||
4708 | protected: | |||
4709 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
4710 | friend class Instruction; | |||
4711 | ||||
4712 | UnreachableInst *cloneImpl() const; | |||
4713 | ||||
4714 | public: | |||
4715 | explicit UnreachableInst(LLVMContext &C, Instruction *InsertBefore = nullptr); | |||
4716 | explicit UnreachableInst(LLVMContext &C, BasicBlock *InsertAtEnd); | |||
4717 | ||||
4718 | // allocate space for exactly zero operands | |||
4719 | void *operator new(size_t S) { return User::operator new(S, 0); } | |||
4720 | void operator delete(void *Ptr) { User::operator delete(Ptr); } | |||
4721 | ||||
4722 | unsigned getNumSuccessors() const { return 0; } | |||
4723 | ||||
4724 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4725 | static bool classof(const Instruction *I) { | |||
4726 | return I->getOpcode() == Instruction::Unreachable; | |||
4727 | } | |||
4728 | static bool classof(const Value *V) { | |||
4729 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4730 | } | |||
4731 | ||||
4732 | private: | |||
4733 | BasicBlock *getSuccessor(unsigned idx) const { | |||
4734 | llvm_unreachable("UnreachableInst has no successors!")::llvm::llvm_unreachable_internal("UnreachableInst has no successors!" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4734); | |||
4735 | } | |||
4736 | ||||
4737 | void setSuccessor(unsigned idx, BasicBlock *B) { | |||
4738 | llvm_unreachable("UnreachableInst has no successors!")::llvm::llvm_unreachable_internal("UnreachableInst has no successors!" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 4738); | |||
4739 | } | |||
4740 | }; | |||
4741 | ||||
4742 | //===----------------------------------------------------------------------===// | |||
4743 | // TruncInst Class | |||
4744 | //===----------------------------------------------------------------------===// | |||
4745 | ||||
4746 | /// This class represents a truncation of integer types. | |||
4747 | class TruncInst : public CastInst { | |||
4748 | protected: | |||
4749 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
4750 | friend class Instruction; | |||
4751 | ||||
4752 | /// Clone an identical TruncInst | |||
4753 | TruncInst *cloneImpl() const; | |||
4754 | ||||
4755 | public: | |||
4756 | /// Constructor with insert-before-instruction semantics | |||
4757 | TruncInst( | |||
4758 | Value *S, ///< The value to be truncated | |||
4759 | Type *Ty, ///< The (smaller) type to truncate to | |||
4760 | const Twine &NameStr = "", ///< A name for the new instruction | |||
4761 | Instruction *InsertBefore = nullptr ///< Where to insert the new instruction | |||
4762 | ); | |||
4763 | ||||
4764 | /// Constructor with insert-at-end-of-block semantics | |||
4765 | TruncInst( | |||
4766 | Value *S, ///< The value to be truncated | |||
4767 | Type *Ty, ///< The (smaller) type to truncate to | |||
4768 | const Twine &NameStr, ///< A name for the new instruction | |||
4769 | BasicBlock *InsertAtEnd ///< The block to insert the instruction into | |||
4770 | ); | |||
4771 | ||||
4772 | /// Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4773 | static bool classof(const Instruction *I) { | |||
4774 | return I->getOpcode() == Trunc; | |||
4775 | } | |||
4776 | static bool classof(const Value *V) { | |||
4777 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4778 | } | |||
4779 | }; | |||
4780 | ||||
4781 | //===----------------------------------------------------------------------===// | |||
4782 | // ZExtInst Class | |||
4783 | //===----------------------------------------------------------------------===// | |||
4784 | ||||
4785 | /// This class represents zero extension of integer types. | |||
4786 | class ZExtInst : public CastInst { | |||
4787 | protected: | |||
4788 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
4789 | friend class Instruction; | |||
4790 | ||||
4791 | /// Clone an identical ZExtInst | |||
4792 | ZExtInst *cloneImpl() const; | |||
4793 | ||||
4794 | public: | |||
4795 | /// Constructor with insert-before-instruction semantics | |||
4796 | ZExtInst( | |||
4797 | Value *S, ///< The value to be zero extended | |||
4798 | Type *Ty, ///< The type to zero extend to | |||
4799 | const Twine &NameStr = "", ///< A name for the new instruction | |||
4800 | Instruction *InsertBefore = nullptr ///< Where to insert the new instruction | |||
4801 | ); | |||
4802 | ||||
4803 | /// Constructor with insert-at-end semantics. | |||
4804 | ZExtInst( | |||
4805 | Value *S, ///< The value to be zero extended | |||
4806 | Type *Ty, ///< The type to zero extend to | |||
4807 | const Twine &NameStr, ///< A name for the new instruction | |||
4808 | BasicBlock *InsertAtEnd ///< The block to insert the instruction into | |||
4809 | ); | |||
4810 | ||||
4811 | /// Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4812 | static bool classof(const Instruction *I) { | |||
4813 | return I->getOpcode() == ZExt; | |||
4814 | } | |||
4815 | static bool classof(const Value *V) { | |||
4816 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4817 | } | |||
4818 | }; | |||
4819 | ||||
4820 | //===----------------------------------------------------------------------===// | |||
4821 | // SExtInst Class | |||
4822 | //===----------------------------------------------------------------------===// | |||
4823 | ||||
4824 | /// This class represents a sign extension of integer types. | |||
4825 | class SExtInst : public CastInst { | |||
4826 | protected: | |||
4827 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
4828 | friend class Instruction; | |||
4829 | ||||
4830 | /// Clone an identical SExtInst | |||
4831 | SExtInst *cloneImpl() const; | |||
4832 | ||||
4833 | public: | |||
4834 | /// Constructor with insert-before-instruction semantics | |||
4835 | SExtInst( | |||
4836 | Value *S, ///< The value to be sign extended | |||
4837 | Type *Ty, ///< The type to sign extend to | |||
4838 | const Twine &NameStr = "", ///< A name for the new instruction | |||
4839 | Instruction *InsertBefore = nullptr ///< Where to insert the new instruction | |||
4840 | ); | |||
4841 | ||||
4842 | /// Constructor with insert-at-end-of-block semantics | |||
4843 | SExtInst( | |||
4844 | Value *S, ///< The value to be sign extended | |||
4845 | Type *Ty, ///< The type to sign extend to | |||
4846 | const Twine &NameStr, ///< A name for the new instruction | |||
4847 | BasicBlock *InsertAtEnd ///< The block to insert the instruction into | |||
4848 | ); | |||
4849 | ||||
4850 | /// Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4851 | static bool classof(const Instruction *I) { | |||
4852 | return I->getOpcode() == SExt; | |||
4853 | } | |||
4854 | static bool classof(const Value *V) { | |||
4855 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4856 | } | |||
4857 | }; | |||
4858 | ||||
4859 | //===----------------------------------------------------------------------===// | |||
4860 | // FPTruncInst Class | |||
4861 | //===----------------------------------------------------------------------===// | |||
4862 | ||||
4863 | /// This class represents a truncation of floating point types. | |||
4864 | class FPTruncInst : public CastInst { | |||
4865 | protected: | |||
4866 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
4867 | friend class Instruction; | |||
4868 | ||||
4869 | /// Clone an identical FPTruncInst | |||
4870 | FPTruncInst *cloneImpl() const; | |||
4871 | ||||
4872 | public: | |||
4873 | /// Constructor with insert-before-instruction semantics | |||
4874 | FPTruncInst( | |||
4875 | Value *S, ///< The value to be truncated | |||
4876 | Type *Ty, ///< The type to truncate to | |||
4877 | const Twine &NameStr = "", ///< A name for the new instruction | |||
4878 | Instruction *InsertBefore = nullptr ///< Where to insert the new instruction | |||
4879 | ); | |||
4880 | ||||
4881 | /// Constructor with insert-before-instruction semantics | |||
4882 | FPTruncInst( | |||
4883 | Value *S, ///< The value to be truncated | |||
4884 | Type *Ty, ///< The type to truncate to | |||
4885 | const Twine &NameStr, ///< A name for the new instruction | |||
4886 | BasicBlock *InsertAtEnd ///< The block to insert the instruction into | |||
4887 | ); | |||
4888 | ||||
4889 | /// Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4890 | static bool classof(const Instruction *I) { | |||
4891 | return I->getOpcode() == FPTrunc; | |||
4892 | } | |||
4893 | static bool classof(const Value *V) { | |||
4894 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4895 | } | |||
4896 | }; | |||
4897 | ||||
4898 | //===----------------------------------------------------------------------===// | |||
4899 | // FPExtInst Class | |||
4900 | //===----------------------------------------------------------------------===// | |||
4901 | ||||
4902 | /// This class represents an extension of floating point types. | |||
4903 | class FPExtInst : public CastInst { | |||
4904 | protected: | |||
4905 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
4906 | friend class Instruction; | |||
4907 | ||||
4908 | /// Clone an identical FPExtInst | |||
4909 | FPExtInst *cloneImpl() const; | |||
4910 | ||||
4911 | public: | |||
4912 | /// Constructor with insert-before-instruction semantics | |||
4913 | FPExtInst( | |||
4914 | Value *S, ///< The value to be extended | |||
4915 | Type *Ty, ///< The type to extend to | |||
4916 | const Twine &NameStr = "", ///< A name for the new instruction | |||
4917 | Instruction *InsertBefore = nullptr ///< Where to insert the new instruction | |||
4918 | ); | |||
4919 | ||||
4920 | /// Constructor with insert-at-end-of-block semantics | |||
4921 | FPExtInst( | |||
4922 | Value *S, ///< The value to be extended | |||
4923 | Type *Ty, ///< The type to extend to | |||
4924 | const Twine &NameStr, ///< A name for the new instruction | |||
4925 | BasicBlock *InsertAtEnd ///< The block to insert the instruction into | |||
4926 | ); | |||
4927 | ||||
4928 | /// Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4929 | static bool classof(const Instruction *I) { | |||
4930 | return I->getOpcode() == FPExt; | |||
4931 | } | |||
4932 | static bool classof(const Value *V) { | |||
4933 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4934 | } | |||
4935 | }; | |||
4936 | ||||
4937 | //===----------------------------------------------------------------------===// | |||
4938 | // UIToFPInst Class | |||
4939 | //===----------------------------------------------------------------------===// | |||
4940 | ||||
4941 | /// This class represents a cast unsigned integer to floating point. | |||
4942 | class UIToFPInst : public CastInst { | |||
4943 | protected: | |||
4944 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
4945 | friend class Instruction; | |||
4946 | ||||
4947 | /// Clone an identical UIToFPInst | |||
4948 | UIToFPInst *cloneImpl() const; | |||
4949 | ||||
4950 | public: | |||
4951 | /// Constructor with insert-before-instruction semantics | |||
4952 | UIToFPInst( | |||
4953 | Value *S, ///< The value to be converted | |||
4954 | Type *Ty, ///< The type to convert to | |||
4955 | const Twine &NameStr = "", ///< A name for the new instruction | |||
4956 | Instruction *InsertBefore = nullptr ///< Where to insert the new instruction | |||
4957 | ); | |||
4958 | ||||
4959 | /// Constructor with insert-at-end-of-block semantics | |||
4960 | UIToFPInst( | |||
4961 | Value *S, ///< The value to be converted | |||
4962 | Type *Ty, ///< The type to convert to | |||
4963 | const Twine &NameStr, ///< A name for the new instruction | |||
4964 | BasicBlock *InsertAtEnd ///< The block to insert the instruction into | |||
4965 | ); | |||
4966 | ||||
4967 | /// Methods for support type inquiry through isa, cast, and dyn_cast: | |||
4968 | static bool classof(const Instruction *I) { | |||
4969 | return I->getOpcode() == UIToFP; | |||
4970 | } | |||
4971 | static bool classof(const Value *V) { | |||
4972 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
4973 | } | |||
4974 | }; | |||
4975 | ||||
4976 | //===----------------------------------------------------------------------===// | |||
4977 | // SIToFPInst Class | |||
4978 | //===----------------------------------------------------------------------===// | |||
4979 | ||||
4980 | /// This class represents a cast from signed integer to floating point. | |||
4981 | class SIToFPInst : public CastInst { | |||
4982 | protected: | |||
4983 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
4984 | friend class Instruction; | |||
4985 | ||||
4986 | /// Clone an identical SIToFPInst | |||
4987 | SIToFPInst *cloneImpl() const; | |||
4988 | ||||
4989 | public: | |||
4990 | /// Constructor with insert-before-instruction semantics | |||
4991 | SIToFPInst( | |||
4992 | Value *S, ///< The value to be converted | |||
4993 | Type *Ty, ///< The type to convert to | |||
4994 | const Twine &NameStr = "", ///< A name for the new instruction | |||
4995 | Instruction *InsertBefore = nullptr ///< Where to insert the new instruction | |||
4996 | ); | |||
4997 | ||||
4998 | /// Constructor with insert-at-end-of-block semantics | |||
4999 | SIToFPInst( | |||
5000 | Value *S, ///< The value to be converted | |||
5001 | Type *Ty, ///< The type to convert to | |||
5002 | const Twine &NameStr, ///< A name for the new instruction | |||
5003 | BasicBlock *InsertAtEnd ///< The block to insert the instruction into | |||
5004 | ); | |||
5005 | ||||
5006 | /// Methods for support type inquiry through isa, cast, and dyn_cast: | |||
5007 | static bool classof(const Instruction *I) { | |||
5008 | return I->getOpcode() == SIToFP; | |||
5009 | } | |||
5010 | static bool classof(const Value *V) { | |||
5011 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
5012 | } | |||
5013 | }; | |||
5014 | ||||
5015 | //===----------------------------------------------------------------------===// | |||
5016 | // FPToUIInst Class | |||
5017 | //===----------------------------------------------------------------------===// | |||
5018 | ||||
5019 | /// This class represents a cast from floating point to unsigned integer | |||
5020 | class FPToUIInst : public CastInst { | |||
5021 | protected: | |||
5022 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
5023 | friend class Instruction; | |||
5024 | ||||
5025 | /// Clone an identical FPToUIInst | |||
5026 | FPToUIInst *cloneImpl() const; | |||
5027 | ||||
5028 | public: | |||
5029 | /// Constructor with insert-before-instruction semantics | |||
5030 | FPToUIInst( | |||
5031 | Value *S, ///< The value to be converted | |||
5032 | Type *Ty, ///< The type to convert to | |||
5033 | const Twine &NameStr = "", ///< A name for the new instruction | |||
5034 | Instruction *InsertBefore = nullptr ///< Where to insert the new instruction | |||
5035 | ); | |||
5036 | ||||
5037 | /// Constructor with insert-at-end-of-block semantics | |||
5038 | FPToUIInst( | |||
5039 | Value *S, ///< The value to be converted | |||
5040 | Type *Ty, ///< The type to convert to | |||
5041 | const Twine &NameStr, ///< A name for the new instruction | |||
5042 | BasicBlock *InsertAtEnd ///< Where to insert the new instruction | |||
5043 | ); | |||
5044 | ||||
5045 | /// Methods for support type inquiry through isa, cast, and dyn_cast: | |||
5046 | static bool classof(const Instruction *I) { | |||
5047 | return I->getOpcode() == FPToUI; | |||
5048 | } | |||
5049 | static bool classof(const Value *V) { | |||
5050 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
5051 | } | |||
5052 | }; | |||
5053 | ||||
5054 | //===----------------------------------------------------------------------===// | |||
5055 | // FPToSIInst Class | |||
5056 | //===----------------------------------------------------------------------===// | |||
5057 | ||||
5058 | /// This class represents a cast from floating point to signed integer. | |||
5059 | class FPToSIInst : public CastInst { | |||
5060 | protected: | |||
5061 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
5062 | friend class Instruction; | |||
5063 | ||||
5064 | /// Clone an identical FPToSIInst | |||
5065 | FPToSIInst *cloneImpl() const; | |||
5066 | ||||
5067 | public: | |||
5068 | /// Constructor with insert-before-instruction semantics | |||
5069 | FPToSIInst( | |||
5070 | Value *S, ///< The value to be converted | |||
5071 | Type *Ty, ///< The type to convert to | |||
5072 | const Twine &NameStr = "", ///< A name for the new instruction | |||
5073 | Instruction *InsertBefore = nullptr ///< Where to insert the new instruction | |||
5074 | ); | |||
5075 | ||||
5076 | /// Constructor with insert-at-end-of-block semantics | |||
5077 | FPToSIInst( | |||
5078 | Value *S, ///< The value to be converted | |||
5079 | Type *Ty, ///< The type to convert to | |||
5080 | const Twine &NameStr, ///< A name for the new instruction | |||
5081 | BasicBlock *InsertAtEnd ///< The block to insert the instruction into | |||
5082 | ); | |||
5083 | ||||
5084 | /// Methods for support type inquiry through isa, cast, and dyn_cast: | |||
5085 | static bool classof(const Instruction *I) { | |||
5086 | return I->getOpcode() == FPToSI; | |||
5087 | } | |||
5088 | static bool classof(const Value *V) { | |||
5089 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
5090 | } | |||
5091 | }; | |||
5092 | ||||
5093 | //===----------------------------------------------------------------------===// | |||
5094 | // IntToPtrInst Class | |||
5095 | //===----------------------------------------------------------------------===// | |||
5096 | ||||
5097 | /// This class represents a cast from an integer to a pointer. | |||
5098 | class IntToPtrInst : public CastInst { | |||
5099 | public: | |||
5100 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
5101 | friend class Instruction; | |||
5102 | ||||
5103 | /// Constructor with insert-before-instruction semantics | |||
5104 | IntToPtrInst( | |||
5105 | Value *S, ///< The value to be converted | |||
5106 | Type *Ty, ///< The type to convert to | |||
5107 | const Twine &NameStr = "", ///< A name for the new instruction | |||
5108 | Instruction *InsertBefore = nullptr ///< Where to insert the new instruction | |||
5109 | ); | |||
5110 | ||||
5111 | /// Constructor with insert-at-end-of-block semantics | |||
5112 | IntToPtrInst( | |||
5113 | Value *S, ///< The value to be converted | |||
5114 | Type *Ty, ///< The type to convert to | |||
5115 | const Twine &NameStr, ///< A name for the new instruction | |||
5116 | BasicBlock *InsertAtEnd ///< The block to insert the instruction into | |||
5117 | ); | |||
5118 | ||||
5119 | /// Clone an identical IntToPtrInst. | |||
5120 | IntToPtrInst *cloneImpl() const; | |||
5121 | ||||
5122 | /// Returns the address space of this instruction's pointer type. | |||
5123 | unsigned getAddressSpace() const { | |||
5124 | return getType()->getPointerAddressSpace(); | |||
5125 | } | |||
5126 | ||||
5127 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
5128 | static bool classof(const Instruction *I) { | |||
5129 | return I->getOpcode() == IntToPtr; | |||
5130 | } | |||
5131 | static bool classof(const Value *V) { | |||
5132 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
5133 | } | |||
5134 | }; | |||
5135 | ||||
5136 | //===----------------------------------------------------------------------===// | |||
5137 | // PtrToIntInst Class | |||
5138 | //===----------------------------------------------------------------------===// | |||
5139 | ||||
5140 | /// This class represents a cast from a pointer to an integer. | |||
5141 | class PtrToIntInst : public CastInst { | |||
5142 | protected: | |||
5143 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
5144 | friend class Instruction; | |||
5145 | ||||
5146 | /// Clone an identical PtrToIntInst. | |||
5147 | PtrToIntInst *cloneImpl() const; | |||
5148 | ||||
5149 | public: | |||
5150 | /// Constructor with insert-before-instruction semantics | |||
5151 | PtrToIntInst( | |||
5152 | Value *S, ///< The value to be converted | |||
5153 | Type *Ty, ///< The type to convert to | |||
5154 | const Twine &NameStr = "", ///< A name for the new instruction | |||
5155 | Instruction *InsertBefore = nullptr ///< Where to insert the new instruction | |||
5156 | ); | |||
5157 | ||||
5158 | /// Constructor with insert-at-end-of-block semantics | |||
5159 | PtrToIntInst( | |||
5160 | Value *S, ///< The value to be converted | |||
5161 | Type *Ty, ///< The type to convert to | |||
5162 | const Twine &NameStr, ///< A name for the new instruction | |||
5163 | BasicBlock *InsertAtEnd ///< The block to insert the instruction into | |||
5164 | ); | |||
5165 | ||||
5166 | /// Gets the pointer operand. | |||
5167 | Value *getPointerOperand() { return getOperand(0); } | |||
5168 | /// Gets the pointer operand. | |||
5169 | const Value *getPointerOperand() const { return getOperand(0); } | |||
5170 | /// Gets the operand index of the pointer operand. | |||
5171 | static unsigned getPointerOperandIndex() { return 0U; } | |||
5172 | ||||
5173 | /// Returns the address space of the pointer operand. | |||
5174 | unsigned getPointerAddressSpace() const { | |||
5175 | return getPointerOperand()->getType()->getPointerAddressSpace(); | |||
5176 | } | |||
5177 | ||||
5178 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
5179 | static bool classof(const Instruction *I) { | |||
5180 | return I->getOpcode() == PtrToInt; | |||
5181 | } | |||
5182 | static bool classof(const Value *V) { | |||
5183 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
5184 | } | |||
5185 | }; | |||
5186 | ||||
5187 | //===----------------------------------------------------------------------===// | |||
5188 | // BitCastInst Class | |||
5189 | //===----------------------------------------------------------------------===// | |||
5190 | ||||
5191 | /// This class represents a no-op cast from one type to another. | |||
5192 | class BitCastInst : public CastInst { | |||
5193 | protected: | |||
5194 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
5195 | friend class Instruction; | |||
5196 | ||||
5197 | /// Clone an identical BitCastInst. | |||
5198 | BitCastInst *cloneImpl() const; | |||
5199 | ||||
5200 | public: | |||
5201 | /// Constructor with insert-before-instruction semantics | |||
5202 | BitCastInst( | |||
5203 | Value *S, ///< The value to be casted | |||
5204 | Type *Ty, ///< The type to casted to | |||
5205 | const Twine &NameStr = "", ///< A name for the new instruction | |||
5206 | Instruction *InsertBefore = nullptr ///< Where to insert the new instruction | |||
5207 | ); | |||
5208 | ||||
5209 | /// Constructor with insert-at-end-of-block semantics | |||
5210 | BitCastInst( | |||
5211 | Value *S, ///< The value to be casted | |||
5212 | Type *Ty, ///< The type to casted to | |||
5213 | const Twine &NameStr, ///< A name for the new instruction | |||
5214 | BasicBlock *InsertAtEnd ///< The block to insert the instruction into | |||
5215 | ); | |||
5216 | ||||
5217 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
5218 | static bool classof(const Instruction *I) { | |||
5219 | return I->getOpcode() == BitCast; | |||
5220 | } | |||
5221 | static bool classof(const Value *V) { | |||
5222 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
5223 | } | |||
5224 | }; | |||
5225 | ||||
5226 | //===----------------------------------------------------------------------===// | |||
5227 | // AddrSpaceCastInst Class | |||
5228 | //===----------------------------------------------------------------------===// | |||
5229 | ||||
5230 | /// This class represents a conversion between pointers from one address space | |||
5231 | /// to another. | |||
5232 | class AddrSpaceCastInst : public CastInst { | |||
5233 | protected: | |||
5234 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
5235 | friend class Instruction; | |||
5236 | ||||
5237 | /// Clone an identical AddrSpaceCastInst. | |||
5238 | AddrSpaceCastInst *cloneImpl() const; | |||
5239 | ||||
5240 | public: | |||
5241 | /// Constructor with insert-before-instruction semantics | |||
5242 | AddrSpaceCastInst( | |||
5243 | Value *S, ///< The value to be casted | |||
5244 | Type *Ty, ///< The type to casted to | |||
5245 | const Twine &NameStr = "", ///< A name for the new instruction | |||
5246 | Instruction *InsertBefore = nullptr ///< Where to insert the new instruction | |||
5247 | ); | |||
5248 | ||||
5249 | /// Constructor with insert-at-end-of-block semantics | |||
5250 | AddrSpaceCastInst( | |||
5251 | Value *S, ///< The value to be casted | |||
5252 | Type *Ty, ///< The type to casted to | |||
5253 | const Twine &NameStr, ///< A name for the new instruction | |||
5254 | BasicBlock *InsertAtEnd ///< The block to insert the instruction into | |||
5255 | ); | |||
5256 | ||||
5257 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
5258 | static bool classof(const Instruction *I) { | |||
5259 | return I->getOpcode() == AddrSpaceCast; | |||
5260 | } | |||
5261 | static bool classof(const Value *V) { | |||
5262 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
5263 | } | |||
5264 | ||||
5265 | /// Gets the pointer operand. | |||
5266 | Value *getPointerOperand() { | |||
5267 | return getOperand(0); | |||
5268 | } | |||
5269 | ||||
5270 | /// Gets the pointer operand. | |||
5271 | const Value *getPointerOperand() const { | |||
5272 | return getOperand(0); | |||
5273 | } | |||
5274 | ||||
5275 | /// Gets the operand index of the pointer operand. | |||
5276 | static unsigned getPointerOperandIndex() { | |||
5277 | return 0U; | |||
5278 | } | |||
5279 | ||||
5280 | /// Returns the address space of the pointer operand. | |||
5281 | unsigned getSrcAddressSpace() const { | |||
5282 | return getPointerOperand()->getType()->getPointerAddressSpace(); | |||
5283 | } | |||
5284 | ||||
5285 | /// Returns the address space of the result. | |||
5286 | unsigned getDestAddressSpace() const { | |||
5287 | return getType()->getPointerAddressSpace(); | |||
5288 | } | |||
5289 | }; | |||
5290 | ||||
5291 | /// A helper function that returns the pointer operand of a load or store | |||
5292 | /// instruction. Returns nullptr if not load or store. | |||
5293 | inline const Value *getLoadStorePointerOperand(const Value *V) { | |||
5294 | if (auto *Load = dyn_cast<LoadInst>(V)) | |||
5295 | return Load->getPointerOperand(); | |||
5296 | if (auto *Store = dyn_cast<StoreInst>(V)) | |||
5297 | return Store->getPointerOperand(); | |||
5298 | return nullptr; | |||
5299 | } | |||
5300 | inline Value *getLoadStorePointerOperand(Value *V) { | |||
5301 | return const_cast<Value *>( | |||
5302 | getLoadStorePointerOperand(static_cast<const Value *>(V))); | |||
5303 | } | |||
5304 | ||||
5305 | /// A helper function that returns the pointer operand of a load, store | |||
5306 | /// or GEP instruction. Returns nullptr if not load, store, or GEP. | |||
5307 | inline const Value *getPointerOperand(const Value *V) { | |||
5308 | if (auto *Ptr = getLoadStorePointerOperand(V)) | |||
5309 | return Ptr; | |||
5310 | if (auto *Gep = dyn_cast<GetElementPtrInst>(V)) | |||
5311 | return Gep->getPointerOperand(); | |||
5312 | return nullptr; | |||
5313 | } | |||
5314 | inline Value *getPointerOperand(Value *V) { | |||
5315 | return const_cast<Value *>(getPointerOperand(static_cast<const Value *>(V))); | |||
5316 | } | |||
5317 | ||||
5318 | /// A helper function that returns the alignment of load or store instruction. | |||
5319 | inline Align getLoadStoreAlignment(Value *I) { | |||
5320 | assert((isa<LoadInst>(I) || isa<StoreInst>(I)) &&(static_cast <bool> ((isa<LoadInst>(I) || isa< StoreInst>(I)) && "Expected Load or Store instruction" ) ? void (0) : __assert_fail ("(isa<LoadInst>(I) || isa<StoreInst>(I)) && \"Expected Load or Store instruction\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 5321, __extension__ __PRETTY_FUNCTION__)) | |||
5321 | "Expected Load or Store instruction")(static_cast <bool> ((isa<LoadInst>(I) || isa< StoreInst>(I)) && "Expected Load or Store instruction" ) ? void (0) : __assert_fail ("(isa<LoadInst>(I) || isa<StoreInst>(I)) && \"Expected Load or Store instruction\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 5321, __extension__ __PRETTY_FUNCTION__)); | |||
5322 | if (auto *LI = dyn_cast<LoadInst>(I)) | |||
5323 | return LI->getAlign(); | |||
5324 | return cast<StoreInst>(I)->getAlign(); | |||
5325 | } | |||
5326 | ||||
5327 | /// A helper function that returns the address space of the pointer operand of | |||
5328 | /// load or store instruction. | |||
5329 | inline unsigned getLoadStoreAddressSpace(Value *I) { | |||
5330 | assert((isa<LoadInst>(I) || isa<StoreInst>(I)) &&(static_cast <bool> ((isa<LoadInst>(I) || isa< StoreInst>(I)) && "Expected Load or Store instruction" ) ? void (0) : __assert_fail ("(isa<LoadInst>(I) || isa<StoreInst>(I)) && \"Expected Load or Store instruction\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 5331, __extension__ __PRETTY_FUNCTION__)) | |||
5331 | "Expected Load or Store instruction")(static_cast <bool> ((isa<LoadInst>(I) || isa< StoreInst>(I)) && "Expected Load or Store instruction" ) ? void (0) : __assert_fail ("(isa<LoadInst>(I) || isa<StoreInst>(I)) && \"Expected Load or Store instruction\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 5331, __extension__ __PRETTY_FUNCTION__)); | |||
5332 | if (auto *LI = dyn_cast<LoadInst>(I)) | |||
5333 | return LI->getPointerAddressSpace(); | |||
5334 | return cast<StoreInst>(I)->getPointerAddressSpace(); | |||
5335 | } | |||
5336 | ||||
5337 | /// A helper function that returns the type of a load or store instruction. | |||
5338 | inline Type *getLoadStoreType(Value *I) { | |||
5339 | assert((isa<LoadInst>(I) || isa<StoreInst>(I)) &&(static_cast <bool> ((isa<LoadInst>(I) || isa< StoreInst>(I)) && "Expected Load or Store instruction" ) ? void (0) : __assert_fail ("(isa<LoadInst>(I) || isa<StoreInst>(I)) && \"Expected Load or Store instruction\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 5340, __extension__ __PRETTY_FUNCTION__)) | |||
5340 | "Expected Load or Store instruction")(static_cast <bool> ((isa<LoadInst>(I) || isa< StoreInst>(I)) && "Expected Load or Store instruction" ) ? void (0) : __assert_fail ("(isa<LoadInst>(I) || isa<StoreInst>(I)) && \"Expected Load or Store instruction\"" , "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h" , 5340, __extension__ __PRETTY_FUNCTION__)); | |||
5341 | if (auto *LI = dyn_cast<LoadInst>(I)) | |||
5342 | return LI->getType(); | |||
5343 | return cast<StoreInst>(I)->getValueOperand()->getType(); | |||
5344 | } | |||
5345 | ||||
5346 | //===----------------------------------------------------------------------===// | |||
5347 | // FreezeInst Class | |||
5348 | //===----------------------------------------------------------------------===// | |||
5349 | ||||
5350 | /// This class represents a freeze function that returns random concrete | |||
5351 | /// value if an operand is either a poison value or an undef value | |||
5352 | class FreezeInst : public UnaryInstruction { | |||
5353 | protected: | |||
5354 | // Note: Instruction needs to be a friend here to call cloneImpl. | |||
5355 | friend class Instruction; | |||
5356 | ||||
5357 | /// Clone an identical FreezeInst | |||
5358 | FreezeInst *cloneImpl() const; | |||
5359 | ||||
5360 | public: | |||
5361 | explicit FreezeInst(Value *S, | |||
5362 | const Twine &NameStr = "", | |||
5363 | Instruction *InsertBefore = nullptr); | |||
5364 | FreezeInst(Value *S, const Twine &NameStr, BasicBlock *InsertAtEnd); | |||
5365 | ||||
5366 | // Methods for support type inquiry through isa, cast, and dyn_cast: | |||
5367 | static inline bool classof(const Instruction *I) { | |||
5368 | return I->getOpcode() == Freeze; | |||
5369 | } | |||
5370 | static inline bool classof(const Value *V) { | |||
5371 | return isa<Instruction>(V) && classof(cast<Instruction>(V)); | |||
5372 | } | |||
5373 | }; | |||
5374 | ||||
5375 | } // end namespace llvm | |||
5376 | ||||
5377 | #endif // LLVM_IR_INSTRUCTIONS_H |