|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/AllocatorList.h 169 iterator begin() { return iterator(List.begin()); }
215 void pop_front() { List.eraseAndDispose(List.begin(), Disposer(*this)); }
include/llvm/ADT/ilist.h 237 return insert(begin(), New);
307 void clear() { erase(begin(), end()); }
310 void push_front(pointer val) { insert(begin(), val); }
314 erase(begin());
329 transfer(where, L2, L2.begin(), L2.end());
include/llvm/ADT/simple_ilist.h 138 reference front() { return *begin(); }
144 void push_front(reference Node) { insert(begin(), Node); }
150 void pop_front() { erase(begin()); }
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())
298 iterator Center = begin(), End = begin();
298 iterator Center = begin(), End = begin();
include/llvm/Analysis/AliasSetTracker.h 421 iterator begin() { return AliasSets.begin(); }
include/llvm/Analysis/IVUsers.h 117 for (IVStrideUse &U : IVUses)
144 iterator begin() { return IVUses.begin(); }
include/llvm/CodeGen/MachineBasicBlock.h 200 instr_iterator instr_begin() { return Insts.begin(); }
include/llvm/CodeGen/MachineFunction.h 651 iterator begin() { return BasicBlocks.begin(); }
include/llvm/CodeGen/SelectionDAG.h 459 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }
include/llvm/IR/BasicBlock.h 273 inline iterator begin() { return InstList.begin(); }
include/llvm/IR/Function.h 685 iterator begin() { return BasicBlocks.begin(); }
include/llvm/IR/InstIterator.h 61 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor
include/llvm/IR/Module.h 582 global_iterator global_begin() { return GlobalList.begin(); }
599 iterator begin() { return FunctionList.begin(); }
621 alias_iterator alias_begin() { return AliasList.begin(); }
639 ifunc_iterator ifunc_begin() { return IFuncList.begin(); }
711 named_metadata_iterator named_metadata_begin() { return NamedMDList.begin(); }
include/llvm/MC/MCSection.h 163 iterator begin() { return Fragments.begin(); }
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) {
lib/Analysis/MemorySSAUpdater.cpp 272 MemoryAccess *FirstDef = &*Defs->begin();
435 MemoryAccess *FirstDef = &*MSSA->getWritableBlockDefs(StartBlock)->begin();
489 auto *FirstDef = &*Defs->begin();
1092 for (auto &DefToReplaceUses : *DefsList) {
1197 if (auto *Phi = dyn_cast<MemoryPhi>(&*Defs->begin()))
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 752 assert(N->getIterator() != AllNodes.begin() &&
1027 assert(&*AllNodes.begin() == &EntryNode);
1028 AllNodes.remove(AllNodes.begin());
lib/ExecutionEngine/Orc/Speculation.cpp 86 for (auto &Fn : M.getFunctionList()) {
lib/IR/DebugInfo.cpp 666 for (auto &NMD : M.getNamedMDList()) {
lib/IR/Function.cpp 368 BasicBlocks.begin()->eraseFromParent();
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/MC/MCObjectStreamer.cpp 140 if (CurInsertionPoint != getCurrentSectionOnly()->getFragmentList().begin())
lib/Target/AMDGPU/GCNILPSched.cpp 244 auto Best = AvailQueue.begin();
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 117 using T = decltype(C(*RQ.begin())) ;
121 for (auto I = RQ.begin(); Num; --Num) {
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) {
717 K != Fragments.begin() && Size >= HEXAGON_PACKET_SIZE;) {
lib/Target/NVPTX/NVPTXAsmPrinter.cpp 909 for (Module::global_iterator I = global_list.begin(), E = global_list.end();
915 global_list.remove(global_list.begin());
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/Scalar/LoopInterchange.cpp 1314 ToList.splice(InsertBefore->getIterator(), FromList, FromList.begin(),
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/Utils/Local.cpp 1219 if (PrevI != I->getParent()->getInstList().begin()) {
lib/Transforms/Vectorize/VPlan.cpp 199 for (VPRecipeBase &Recipe : Recipes)
lib/Transforms/Vectorize/VPlan.h 1012 inline iterator begin() { return Recipes.begin(); }
tools/clang/lib/CodeGen/CGVTables.cpp 128 for (auto &BB : Fn->getBasicBlockList()) {
tools/lld/include/lld/Core/Simple.h 179 reinterpret_cast<const void *>(_references.begin().getNodePtr());
215 for (SimpleReference &node : _references) {
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileBinaryWriter.cpp 1263 for (TrieEdge &edge : _children) {
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());
53 EXPECT_NE(I, L.begin());
65 EXPECT_EQ(&A, &*L.begin());
69 EXPECT_EQ(L.rbegin().getNodePtr(), L.begin().getNodePtr());
72 EXPECT_EQ(L.end(), ++L.begin());
73 EXPECT_EQ(L.begin(), --L.end());
78 EXPECT_EQ(L.rbegin(), L.begin().getReverse());
79 EXPECT_EQ(L.begin(), L.rbegin().getReverse());
89 EXPECT_EQ(&A, &*L.begin());
90 EXPECT_EQ(&B, &*++L.begin());
91 EXPECT_EQ(L.end(), ++++L.begin());
97 EXPECT_EQ(++L.rbegin(), L.begin().getReverse());
98 EXPECT_EQ(L.rbegin(), (++L.begin()).getReverse());
99 EXPECT_EQ(++L.begin(), L.rbegin().getReverse());
100 EXPECT_EQ(L.begin(), (++L.rbegin()).getReverse());
110 auto I = L.begin();
147 EXPECT_EQ(L.begin(), iterator(L.rend()));
148 EXPECT_EQ(++L.begin(), iterator(++L.rbegin()));
151 EXPECT_EQ(++L.rbegin(), reverse_iterator(++L.begin()));
152 EXPECT_EQ(L.rend(), reverse_iterator(L.begin()));
unittests/ADT/IListTest.cpp 82 List.splice(List.begin(), List, List.begin());
82 List.splice(List.begin(), List, List.begin());
85 EXPECT_TRUE(std::next(List.begin()) == List.end());
90 List.splice(std::next(List.begin()), List, List.begin());
90 List.splice(std::next(List.begin()), List, List.begin());
93 EXPECT_EQ(2, std::next(List.begin())->Value);
106 L.splice(L.begin(), L, ++L.begin());
106 L.splice(L.begin(), L, ++L.begin());
122 L.splice(L.end(), L, L.begin());
146 Node *N = &*List.begin();
239 L1.insert(L1.begin(), &N);
272 L1.splice(L1.begin(), L1, std::next(L1.begin()), L1.end());
272 L1.splice(L1.begin(), L1, std::next(L1.begin()), L1.end());
295 L.insert(L.begin(), &N);
296 ++L.begin();
297 (void)*L.begin();
298 (void)(L.begin() == L.end());
unittests/ADT/SimpleIListTest.cpp 25 EXPECT_EQ(L.begin(), L.end());
96 L.insert(L.begin(), B);
97 L.insert(L.begin(), A);
111 EXPECT_EQ(&B, &*++L.begin());
136 EXPECT_EQ(B, &*++L.begin());
153 EXPECT_EQ(&B, &*++L.begin());
170 EXPECT_EQ(&B, &*++L.begin());
205 EXPECT_EQ(B, &*++L.begin());
222 EXPECT_EQ(&B, &*++L.begin());
240 auto I = L.begin();
264 auto I = L.begin();
289 auto I = L.begin();
353 auto I = L1.begin();
375 L1.splice(--L1.end(), L2, ++L2.begin());
376 auto I = L1.begin();
382 I = L2.begin();
403 L1.splice(--L1.end(), L2, ++L2.begin(), --L2.end());
404 auto I = L1.begin();
411 I = L2.begin();
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()));
449 auto I = LHS.begin();
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));
486 auto I = L1.begin();
500 EXPECT_TRUE(std::is_sorted(L2.begin(), L2.end(), makeFalse));
501 I = L2.begin();
524 EXPECT_TRUE(std::is_sorted(L1.begin(), L1.end()));
532 EXPECT_TRUE(std::is_sorted(LHS.begin(), LHS.end()));
533 auto I = LHS.begin();
557 EXPECT_FALSE(std::is_sorted(L.begin(), L.end()));
561 EXPECT_TRUE(std::is_sorted(L.begin(), L.end()));
562 auto I = L.begin();
584 EXPECT_FALSE(std::is_sorted(L.begin(), L.end(), compare));
588 EXPECT_TRUE(std::is_sorted(L.begin(), L.end(), compare));
589 auto I = L.begin();
637 auto I1 = L1.begin();
645 auto I2 = L2.begin();
unittests/CodeGen/MachineInstrBundleIteratorTest.cpp 160 auto begin = [&]() -> iterator { return L.begin(); };
unittests/IR/InstructionsTest.cpp 1090 auto BBs = Foo->getBasicBlockList().begin();
usr/include/c++/7.4.0/bits/range_access.h 48 begin(_Container& __cont) -> decltype(__cont.begin())
49 { return __cont.begin(); }