Searched refs:InstList (Results 1 – 9 of 9) sorted by relevance
67 InstListType InstList; variable296 inline iterator begin() { return InstList.begin(); } in begin()297 inline const_iterator begin() const { return InstList.begin(); } in begin()298 inline iterator end () { return InstList.end(); } in end()299 inline const_iterator end () const { return InstList.end(); } in end()306 inline size_t size() const { return InstList.size(); } in size()307 inline bool empty() const { return InstList.empty(); } in empty()308 inline const Instruction &front() const { return InstList.front(); } in front()363 const InstListType &getInstList() const { return InstList; } in getInstList()364 InstListType &getInstList() { return InstList; } in getInstList()[all …]
122 InstListTy &InstList; member in __anon9cdc0bf40111::LegalizerWorkListManager130 : InstList(Insts), ArtifactList(Arts) {} in LegalizerWorkListManager()140 InstList.insert(&MI); in createdOrChangedInstr()159 InstList.remove(&MI); in erasingInstr()185 InstListTy InstList; in legalizeMachineFunction() local202 InstList.deferred_insert(&MI); in legalizeMachineFunction()206 InstList.finalize(); in legalizeMachineFunction()230 while (!InstList.empty()) { in legalizeMachineFunction()231 MachineInstr &MI = *InstList.pop_back_val(); in legalizeMachineFunction()311 InstList.insert(&MI); in legalizeMachineFunction()[all …]
109 : DDGNode(NodeKind::SingleInstruction), InstList() { in SimpleDDGNode()110 assert(InstList.empty() && "Expected empty list."); in SimpleDDGNode()111 InstList.push_back(&I); in SimpleDDGNode()115 : DDGNode(N), InstList(N.InstList) { in SimpleDDGNode()116 assert(((getKind() == NodeKind::SingleInstruction && InstList.size() == 1) || in SimpleDDGNode()117 (getKind() == NodeKind::MultiInstruction && InstList.size() > 1)) && in SimpleDDGNode()122 : DDGNode(std::move(N)), InstList(std::move(N.InstList)) { in SimpleDDGNode()123 assert(((getKind() == NodeKind::SingleInstruction && InstList.size() == 1) || in SimpleDDGNode()124 (getKind() == NodeKind::MultiInstruction && InstList.size() > 1)) && in SimpleDDGNode()128 SimpleDDGNode::~SimpleDDGNode() { InstList.clear(); } in ~SimpleDDGNode()
90 InstList.clear(); in ~BasicBlock()95 InstList.setSymTabObject(&Parent, parent); in setParent()149 if (InstList.empty() || !InstList.back().isTerminator()) in getTerminator()151 return &InstList.back(); in getTerminator()155 if (InstList.empty()) in getTerminatingMustTailCall()158 if (!RI || RI == &InstList.front()) in getTerminatingMustTailCall()186 if (InstList.empty()) in getTerminatingDeoptimizeCall()188 auto *RI = dyn_cast<ReturnInst>(&InstList.back()); in getTerminatingDeoptimizeCall()189 if (!RI || RI == &InstList.front()) in getTerminatingDeoptimizeCall()387 assert(I != InstList.end() && in splitBasicBlock()[all …]
118 InstList = N.InstList;124 InstList = std::move(N.InstList);130 assert(!InstList.empty() && "Instruction List is empty."); in getInstructions()131 return InstList; in getInstructions()152 setKind((InstList.size() == 0 && Input.size() == 1) in appendInstructions()155 llvm::append_range(InstList, Input); in appendInstructions()162 SmallVector<Instruction *, 2> InstList; variable
185 auto &InstList = BB->getInstList(); in prepareThrows() local186 InstList.erase(std::next(BasicBlock::iterator(ThrowI)), InstList.end()); in prepareThrows()
501 std::vector<std::string> &InstList = IE->second; in run() local503 for (int i = 0, N = InstList.size(); i < N; i++) { in run()505 o << " case " << InstList[i] << ":"; in run()
679 InstListTy &InstList; member in __anon1db1c1880111::InstManager682 InstManager(InstListTy &Insts) : InstList(Insts) {} in InstManager()684 void createdInstr(MachineInstr &MI) override { InstList.insert(&MI); } in createdInstr()
138 using InstList = std::vector<Instruction *>; typedef in __anonf8b19ccd0111::AlignVectors175 InstList Main; // Main group of instructions.176 InstList Deps; // List of dependencies.