|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/AllocatorList.h 170 iterator end() { return iterator(List.end()); }
214 void pop_back() { List.eraseAndDispose(--List.end(), Disposer(*this)); }
include/llvm/ADT/ilist.h 307 void clear() { erase(begin(), end()); }
311 void push_back(pointer val) { insert(end(), val); }
318 iterator t = end(); erase(--t);
329 transfer(where, L2, L2.begin(), L2.end());
include/llvm/ADT/simple_ilist.h 110 simple_ilist(simple_ilist &&X) { splice(end(), X); }
113 splice(end(), X);
147 void push_back(reference Node) { insert(end(), Node); }
153 void pop_back() { erase(--end()); }
197 assert(I != end() && "Cannot remove end of list!");
234 eraseAndDispose(begin(), end(), dispose);
239 splice(I, L2, L2.begin(), L2.end());
273 iterator LI = begin(), LE = end();
274 iterator RI = RHS.begin(), RE = RHS.end();
294 if (empty() || std::next(begin()) == end())
299 while (End != end() && ++End != end()) {
299 while (End != end() && ++End != end()) {
304 RHS.splice(RHS.end(), *this, Center, end());
304 RHS.splice(RHS.end(), *this, Center, end());
include/llvm/Analysis/AliasSetTracker.h 422 iterator end() { return AliasSets.end(); }
include/llvm/Analysis/IVUsers.h 117 for (IVStrideUse &U : IVUses)
145 iterator end() { return IVUses.end(); }
include/llvm/CodeGen/MachineBasicBlock.h 202 instr_iterator instr_end() { return Insts.end(); }
include/llvm/CodeGen/MachineFunction.h 653 iterator end () { return BasicBlocks.end(); }
include/llvm/CodeGen/SelectionDAG.h 460 allnodes_iterator allnodes_end() { return AllNodes.end(); }
include/llvm/CodeGen/SlotIndexes.h 414 IndexList::iterator E = indexList.end();
include/llvm/IR/BasicBlock.h 275 inline iterator end () { return InstList.end(); }
include/llvm/IR/Function.h 687 iterator end () { return BasicBlocks.end(); }
include/llvm/IR/InstIterator.h 62 if (BB != BBs->end()) {
69 : BBs(&m.getBasicBlockList()), BB(BBs->end()) { // end ctor
80 return BB == y.BB && (BB == BBs->end() || BI == y.BI);
96 while (BB == BBs->end() || BI == BB->begin()) {
115 if (BB == BBs->end()) break;
include/llvm/IR/Module.h 584 global_iterator global_end () { return GlobalList.end(); }
601 iterator end () { return FunctionList.end(); }
623 alias_iterator alias_end () { return AliasList.end(); }
641 ifunc_iterator ifunc_end () { return IFuncList.end(); }
716 named_metadata_iterator named_metadata_end() { return NamedMDList.end(); }
include/llvm/MC/MCSection.h 166 iterator end() { return Fragments.end(); }
lib/Analysis/CFLGraph.h 637 for (auto &Bb : Fn.getBasicBlockList())
638 for (auto &Inst : Bb.getInstList())
lib/Analysis/DDG.cpp 138 for (auto &BB : F.getBasicBlockList())
lib/Analysis/MemorySSA.cpp 1119 for (MemoryAccess &L : *Accesses) {
1212 for (auto AI = Accesses->begin(), AE = Accesses->end(); AI != AE;) {
1244 for (MemoryAccess &MA : *Pair.second)
1348 for (MemoryAccess &MA : *Accesses) {
1628 bool WasEnd = InsertPt == Accesses->end();
1641 while (InsertPt != Accesses->end() && !isa<MemoryDef>(InsertPt))
1644 if (InsertPt == Accesses->end())
lib/Analysis/MemorySSAUpdater.cpp 468 if (++DefIter != Defs->end()) {
828 return &*(--Defs->end());
1092 for (auto &DefToReplaceUses : *DefsList) {
1182 MemoryUseOrDef *NextMUD = (!Accs || NextIt == Accs->end())
1353 for (MemoryAccess &MA : *Acc)
1362 for (auto AB = Acc->begin(), AE = Acc->end(); AB != AE;) {
lib/CodeGen/AsmPrinter/AsmPrinter.cpp 333 for (auto &F: M.getFunctionList()) {
lib/CodeGen/SelectionDAG/SelectionDAG.cpp 8545 assert(SortedPos != AllNodes.end() && "Overran node list");
8571 assert(SortedPos != AllNodes.end() && "Overran node list");
8591 assert(SortedPos == AllNodes.end() &&
lib/CodeGen/SlotIndexes.cpp 159 } while (curItr != indexList.end() && curItr->getIndex() <= index);
lib/CodeGen/WasmEHPrepare.cpp 192 InstList.erase(std::next(BasicBlock::iterator(ThrowI)), InstList.end());
lib/ExecutionEngine/Orc/Speculation.cpp 86 for (auto &Fn : M.getFunctionList()) {
lib/IR/BasicBlock.cpp 416 assert(I != InstList.end() &&
lib/IR/DebugInfo.cpp 666 for (auto &NMD : M.getNamedMDList()) {
lib/IR/Module.cpp 477 for (Function &F : FunctionList)
lib/IR/SymbolTableListTraitsImpl.h 48 for (auto I = ItemList.begin(); I != ItemList.end(); ++I)
55 for (auto I = ItemList.begin(); I != ItemList.end(); ++I)
lib/Target/AMDGPU/GCNILPSched.cpp 245 for (auto I = std::next(AvailQueue.begin()), E = AvailQueue.end(); I != E; ++I) {
258 for(auto I = PendingQueue.begin(), E = PendingQueue.end(); I != E;) {
318 PendingQueue.begin(), PendingQueue.end(),
330 : AvailQueue) dbgs()
lib/Target/AMDGPU/GCNMinRegStrategy.cpp 211 for (auto &C : RQ) {
252 : RQ) dbgs()
lib/Target/ARM/ARMCodeGenPrepare.cpp 1024 for (auto &I : Insts) {
lib/Target/Hexagon/MCTargetDesc/HexagonAsmBackend.cpp 710 for (auto &J : Fragments) {
lib/Target/NVPTX/NVPTXAsmPrinter.cpp 909 for (Module::global_iterator I = global_list.begin(), E = global_list.end();
922 global_list.insert(global_list.end(), gv_array[i]);
lib/Transforms/CFGuard/CFGuard.cpp 267 for (BasicBlock &BB : F.getBasicBlockList()) {
268 for (Instruction &I : BB.getInstList()) {
lib/Transforms/IPO/SampleProfile.cpp 920 for (auto &I : BB.getInstList()) {
1424 for (auto &I : BB->getInstList()) {
lib/Transforms/Instrumentation/AddressSanitizer.cpp 1771 for (auto &BB : GlobalInit.getBasicBlockList())
lib/Transforms/Utils/AddDiscriminators.cpp 189 for (auto &I : B.getInstList()) {
233 for (auto &I : B.getInstList()) {
lib/Transforms/Utils/FunctionComparator.cpp 369 for(BasicBlock &BB : F->getBasicBlockList()) {
lib/Transforms/Vectorize/VPlan.cpp 199 for (VPRecipeBase &Recipe : Recipes)
lib/Transforms/Vectorize/VPlan.h 1014 inline iterator end() { return Recipes.end(); }
tools/clang/lib/CodeGen/CGVTables.cpp 128 for (auto &BB : Fn->getBasicBlockList()) {
tools/lld/include/lld/Core/Simple.h 185 reinterpret_cast<const void *>(_references.end().getNodePtr());
215 for (SimpleReference &node : _references) {
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileBinaryWriter.cpp 1263 for (TrieEdge &edge : _children) {
1290 bNode->_children.insert(bNode->_children.end(), bcEdge);
1305 _children.insert(_children.end(), newEdge);
1327 for (TrieEdge &edge : _children) {
1355 for (TrieEdge &edge : _children) {
1420 for (TrieEdge &edge : _children) {
tools/lldb/source/Expression/IRExecutionUnit.cpp 385 for (llvm::GlobalVariable &global_var : m_module->getGlobalList()) {
389 for (llvm::GlobalAlias &global_alias : m_module->getAliasList()) {
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangExpressionParser.cpp 1154 for (const auto &func : module->getFunctionList()) {
tools/lldb/source/Plugins/LanguageRuntime/RenderScript/RenderScriptRuntime/RenderScriptx86ABIFixups.cpp 131 for (auto &func : module.getFunctionList())
132 for (auto &block : func.getBasicBlockList())
unittests/ADT/IListIteratorTest.cpp 43 EXPECT_EQ(L.begin(), L.end());
47 EXPECT_EQ(L.end(), L.rend().getReverse());
48 EXPECT_EQ(L.rend(), L.end().getReverse());
54 EXPECT_NE(I, L.end());
62 L.insert(L.end(), A);
72 EXPECT_EQ(L.end(), ++L.begin());
73 EXPECT_EQ(L.begin(), --L.end());
85 L.insert(L.end(), A);
86 L.insert(L.end(), B);
91 EXPECT_EQ(L.end(), ++++L.begin());
106 L.insert(L.end(), A);
107 L.insert(L.end(), B);
115 EXPECT_EQ(L.end(), I);
121 L.insert(L.end(), A);
122 L.insert(L.end(), B);
137 L.insert(L.end(), A);
138 L.insert(L.end(), B);
149 EXPECT_EQ(L.end(), iterator(L.rbegin()));
150 EXPECT_EQ(L.rbegin(), reverse_iterator(L.end()));
157 EXPECT_EQ(CL.rbegin(), const_reverse_iterator(L.end()));
unittests/ADT/IListTest.cpp 85 EXPECT_TRUE(std::next(List.begin()) == List.end());
101 L.insert(L.end(), &N0);
102 L.insert(L.end(), &N1);
117 L.insert(L.end(), &N0);
118 L.insert(L.end(), &N1);
122 L.splice(L.end(), L, L.begin());
137 ilist<Node>::iterator E = List.end();
141 EXPECT_TRUE(E == List.end());
245 L2.splice(L2.end(), L1);
263 L1.insert(L1.end(), &N1);
264 L1.insert(L1.end(), &N2);
272 L1.splice(L1.begin(), L1, std::next(L1.begin()), L1.end());
298 (void)(L.begin() == L.end());
301 L2.splice(L2.end(), L);
unittests/ADT/SimpleIListTest.cpp 25 EXPECT_EQ(L.begin(), L.end());
85 L.insert(L.end(), A);
86 L.insert(L.end(), B);
246 EXPECT_EQ(L.end(), I);
270 EXPECT_EQ(L.end(), I);
295 EXPECT_EQ(L.end(), I);
350 L1.splice(--L1.end(), L2);
358 EXPECT_EQ(L1.end(), I);
375 L1.splice(--L1.end(), L2, ++L2.begin());
380 EXPECT_EQ(L1.end(), I);
385 EXPECT_EQ(L2.end(), I);
403 L1.splice(--L1.end(), L2, ++L2.begin(), --L2.end());
403 L1.splice(--L1.end(), L2, ++L2.begin(), --L2.end());
409 EXPECT_EQ(L1.end(), I);
414 EXPECT_EQ(L2.end(), I);
439 EXPECT_TRUE(std::is_sorted(L1.begin(), L1.end()));
440 EXPECT_TRUE(std::is_sorted(L2.begin(), L2.end()));
448 EXPECT_TRUE(std::is_sorted(LHS.begin(), LHS.end()));
452 EXPECT_EQ(LHS.end(), I);
476 EXPECT_TRUE(std::is_sorted(L1.begin(), L1.end(), makeFalse));
477 EXPECT_TRUE(std::is_sorted(L2.begin(), L2.end(), makeFalse));
485 EXPECT_TRUE(std::is_sorted(L1.begin(), L1.end(), makeFalse));
492 EXPECT_EQ(L1.end(), I);
500 EXPECT_TRUE(std::is_sorted(L2.begin(), L2.end(), makeFalse));
507 EXPECT_EQ(L2.end(), I);
524 EXPECT_TRUE(std::is_sorted(L1.begin(), L1.end()));
532 EXPECT_TRUE(std::is_sorted(LHS.begin(), LHS.end()));
536 EXPECT_EQ(LHS.end(), I);
557 EXPECT_FALSE(std::is_sorted(L.begin(), L.end()));
561 EXPECT_TRUE(std::is_sorted(L.begin(), L.end()));
565 EXPECT_EQ(L.end(), I);
584 EXPECT_FALSE(std::is_sorted(L.begin(), L.end(), compare));
588 EXPECT_TRUE(std::is_sorted(L.begin(), L.end(), compare));
594 EXPECT_EQ(L.end(), I);
642 EXPECT_EQ(L1.end(), I1);
650 EXPECT_EQ(L2.end(), I2);
unittests/CodeGen/MachineInstrBundleIteratorTest.cpp 149 L.insert(L.end(), A);
150 L.insert(L.end(), B);
161 auto end = [&]() -> iterator { return L.end(); };
usr/include/c++/7.4.0/bits/range_access.h 68 end(_Container& __cont) -> decltype(__cont.end())
69 { return __cont.end(); }