reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/ADT/STLExtras.h
  322     while (this->I != End && !Pred(*this->I))
include/llvm/ADT/iterator.h
   91     operator ReferenceT() const { return *I; }
  169   PointerT operator->() { return &static_cast<DerivedT *>(this)->operator*(); }
  171     return &static_cast<const DerivedT *>(this)->operator*();
  271   ReferenceT operator*() const { return *I; }
  323   T &operator*() { return Ptr = &*this->I; }
include/llvm/Analysis/CGSCCPassManager.h
  462     for (LazyCallGraph::Node &N : C)
  589       for (LazyCallGraph::Node &N : C) {
include/llvm/Analysis/LazyCallGraph.h
  457       for (LazyCallGraph::Node &N : C) {
  578       for (LazyCallGraph::SCC &C : RC) {
include/llvm/ExecutionEngine/JITLink/JITLink.h
  808     for (auto &S : sections())
lib/Analysis/CGSCCPassManager.cpp
  166     for (auto &C : RC) {
  257     for (LazyCallGraph::Node &N : C)
  269   for (LazyCallGraph::Node &N : C) {
  330   for (LazyCallGraph::Node &N : C) {
  383   assert(C != &*NewSCCRange.begin() &&
  385   C = &*NewSCCRange.begin();
lib/Analysis/LazyCallGraph.cpp
  254   for (Node &N : *this)
  276     for (Node &N : C)
  336     for (Node &N : SourceSCC)
  356   for (SCC &C : *this)
  357     for (Node &N : C)
  378     for (SCC &C : DescendantRC)
  379       for (Node &N : C)
  574       for (Node &N : C)
  603       for (Node &N : C)
  813             for (Node &N : make_range(OldSCC.begin() + OldSize, OldSCC.end())) {
  863       for (Node &N : *NewSCCs.back()) {
  998       for (SCC &C : RC)
  999         for (Node &N : C)
 1023       for (SCC &C : RC)
 1024         for (Node &N : C)
 1065     for (SCC &InnerC : *RC) {
 1068       for (Node &N : InnerC)
 1083   for (SCC &InnerC : *this)
 1181     for (Node &N : *C)
 1335     for (Node &N : *C) {
 1689         for (Node &N : *RC.SCCs.back()) {
 1757   for (LazyCallGraph::Node &N : C)
 1764   for (LazyCallGraph::SCC &InnerC : C)
lib/CodeGen/MachineInstr.cpp
  442   for (const MachineInstr &MI : make_pointee_range(MIs.slice(1))) {
lib/MC/ELFObjectWriter.cpp
  655   for (const MCSymbol &S : Asm.symbols()) {
 1112   for (MCSection &Sec : Asm) {
lib/MC/MCAssembler.cpp
  766   for (MCSection &Sec : *this) {
  806   for (MCSection &Sec : *this) {
 1114     MCSection &Sec = *it;
lib/MC/MCFragment.cpp
   34   for (MCSection &Sec : Asm)
   37   for (MCSection &Sec : Asm)
lib/MC/MCMachOStreamer.cpp
  482   for (const MCSymbol &Symbol : getAssembler().symbols()) {
  494   for (MCSection &Sec : getAssembler()) {
lib/MC/MachObjectWriter.cpp
  550     SectionIndexMap[&*it] = Index;
  554   for (const MCSymbol &Symbol : Asm.symbols()) {
  567   for (const MCSymbol &Symbol : Asm.symbols()) {
  593   for (const MCSymbol &Symbol : Asm.symbols()) {
  626   for (const MCSection &Section : Asm) {
  819   for (const MCSection &Sec : Asm) {
  851   for (const MCSection &Section : Asm) {
  953   for (const MCSection &Sec : Asm) {
  964   for (const MCSection &Sec : Asm) {
lib/MC/WasmObjectWriter.cpp
  413   for (const MCSymbol &S : Asm.symbols()) {
 1144   for (const MCSymbol &S : Asm.symbols()) {
 1199   for (const MCSymbol &S : Asm.symbols()) {
 1218   for (MCSection &Sec : Asm) {
 1284   for (const MCSymbol &S : Asm.symbols()) {
 1402   for (const MCSymbol &S : Asm.symbols()) {
 1432   for (const MCSymbol &S : Asm.symbols()) {
 1500   for (const MCSection &S : Asm) {
lib/MC/WinCOFFObjectWriter.cpp
  672   for (const auto &Section : Asm)
  675   for (const MCSymbol &Symbol : Asm.symbols())
  899   for (const auto &Section : Asm) {
 1074     writeSection(Asm, Layout, **I, *J);
lib/MC/XCOFFObjectWriter.cpp
  275   for (const auto &S : Asm) {
  294   for (const MCSymbol &S : Asm.symbols()) {
lib/Passes/StandardInstrumentations.cpp
   48     for (const LazyCallGraph::Node &N : *C) {
   86   for (const LazyCallGraph::Node &N : *C) {
lib/ProfileData/GCOV.cpp
  839     for (const GCOVBlock &Block : Func->blocks())
lib/Target/Mips/MCTargetDesc/MipsTargetStreamer.cpp
  914     for (MCSection &S : MCA) {
lib/Transforms/IPO/ArgumentPromotion.cpp
 1030     for (LazyCallGraph::Node &N : C) {
lib/Transforms/IPO/FunctionAttrs.cpp
 1427   for (LazyCallGraph::Node &N : C) {
lib/Transforms/IPO/Inliner.cpp
  922   for (auto &N : InitialC) {
tools/clang/examples/clang-interpreter/main.cpp
  159   if (Jobs.size() != 1 || !isa<driver::Command>(*Jobs.begin())) {
  167   const driver::Command &Cmd = cast<driver::Command>(*Jobs.begin());
tools/clang/include/clang/AST/DeclTemplate.h
  782       return SETraits::getDecl(&*this->I)->getMostRecentDecl();
tools/clang/include/clang/Serialization/ASTReader.h
 1771     for (const auto &M : ModuleMgr)
tools/clang/lib/AST/DeclTemplate.cpp
  457   for (ClassTemplatePartialSpecializationDecl &P : PartialSpecs)
  464   for (ClassTemplatePartialSpecializationDecl &P :
  477   for (ClassTemplatePartialSpecializationDecl &P : getPartialSpecializations()) {
 1073   for (VarTemplatePartialSpecializationDecl &P : PartialSpecs)
 1081   for (VarTemplatePartialSpecializationDecl &P : getPartialSpecializations()) {
tools/clang/lib/Driver/Compilation.cpp
  229   for (const auto &Job : Jobs) {
tools/clang/lib/Driver/Driver.cpp
 1462   for (auto &Job : C.getJobs())
tools/clang/lib/Driver/Job.cpp
  437   for (const auto &Job : *this)
tools/clang/lib/Frontend/CreateInvocationFromCommandLine.cpp
   76   if (Jobs.size() == 0 || !isa<driver::Command>(*Jobs.begin()) ||
   85   const driver::Command &Cmd = cast<driver::Command>(*Jobs.begin());
tools/clang/lib/Frontend/FrontendAction.cpp
  590       for (serialization::ModuleFile &MF : MM)
tools/clang/lib/Serialization/ASTReader.cpp
  541   ModuleFile *TopImport = &*ModuleMgr.rbegin();
 1941   for (ModuleFile &I : llvm::reverse(ModuleMgr)) {
 6162   for (ModuleFile &F : ModuleMgr) {
 8262   for (ModuleFile &M : ModuleMgr)
 8269   for (ModuleFile &I : ModuleMgr) {
tools/clang/lib/Serialization/ASTWriter.cpp
 1565     for (ModuleFile &M : Mgr) {
 5035       for (ModuleFile &M : Chain->ModuleMgr) {
tools/clang/lib/Serialization/ASTWriterDecl.cpp
  226       for (auto &Entry : Common->Specializations)
  228       for (auto &Entry : getPartialSpecializations(Common))
tools/clang/lib/Serialization/ModuleManager.cpp
  252       PCHChain.erase(llvm::find(PCHChain, &*I), PCHChain.end());
  309   for (ModuleFile &M : *this)
  345     for (ModuleFile &M : llvm::reverse(*this)) {
tools/clang/lib/Tooling/CompilationDatabase.cpp
  309   for (const auto &Cmd : Jobs) {
tools/clang/lib/Tooling/Tooling.cpp
  120   if (Jobs.size() == 0 || !isa<driver::Command>(*Jobs.begin()) ||
  131   const auto &Cmd = cast<driver::Command>(*Jobs.begin());
tools/clang/tools/driver/cc1gen_reproducer_main.cpp
  126     for (const auto &J : C->getJobs()) {
tools/clang/tools/driver/driver.cpp
  471       for (const auto &J : C->getJobs())
tools/clang/tools/extra/clangd/index/MemIndex.h
   25     for (const Symbol &S : Symbols)
tools/clang/tools/extra/clangd/index/dex/Dex.h
   48     for (auto &&Sym : Symbols)
tools/dsymutil/MachOUtils.cpp
  551   for (const MCSection &Sec : MCAsm) {
tools/llvm-jitlink/llvm-jitlink-macho.cpp
   90   for (auto &Sec : G.sections()) {
tools/llvm-jitlink/llvm-jitlink.cpp
  168   for (auto &S : G.sections())
tools/llvm-objcopy/ELF/ELFObjcopy.cpp
  286   for (auto &Sec : Obj.sections()) {
  321   for (auto &Sec : Obj.sections())
  333   for (auto &Sec : Obj.sections())
  401     for (SectionBase &Sec : Obj.sections())
  617     for (SectionBase &Sec : Obj.sections()) {
  633     for (SectionBase &Sec : Obj.sections()) {
  674     for (SectionBase &Sec : Obj.sections()) {
  682     for (auto &Sec : Obj.sections()) {
tools/llvm-objcopy/ELF/Object.cpp
 1143   for (SectionBase &Sec : Obj->sections())
 1239   for (Segment &Parent : Obj.segments()) {
 1258   for (const SectionBase &Sec : Obj.sections()) {
 1289     for (SectionBase &Sec : Obj.sections())
 1318   for (Segment &Child : Obj.segments())
 1546     for (auto &Sec : Obj.sections()) {
 1569   for (auto &Sec : Obj.sections()) {
 1744   for (auto &Seg : Obj.segments())
 1773   for (SectionBase &Sec : Obj.sections())
 1778   for (SectionBase &Sec : Obj.sections())
 1787   for (Segment &Seg : Obj.segments()) {
 1795   for (auto &Sec : Obj.removedSections()) {
 1932   for (auto &Sec : Sections) {
 1963   for (Segment &Segment : Obj.segments())
 2073     for (const SectionBase &Sec : Obj.sections())
 2083   for (SectionBase &Sec : Obj.sections()) {
 2096   for (SectionBase &Sec : Obj.sections())
 2110   for (SectionBase &Sec : Obj.sections()) {
 2274   for (const SectionBase &Sec : Obj.sections())
 2280   for (const SectionBase &Sec : Obj.sections())
tools/llvm-readobj/DwarfCFIEHPrinter.h
  199   for (const auto &Entry : EHFrame) {
unittests/ADT/IteratorTest.cpp
   83     EXPECT_EQ(*V[i], *I);
  125     EXPECT_EQ(*V[i], *I);
  155   for (int II : make_pointee_range(V))
  169     EXPECT_EQ(*V[j], *I);
unittests/Analysis/CGSCCPassManagerTest.cpp
  294         for (LazyCallGraph::Node &N : C) {
 1165         auto &H2N = *llvm::find_if(
 1214         auto &H2N = *C.begin();
unittests/Analysis/LazyCallGraphTest.cpp
  325   for (LazyCallGraph::Node &N : *D.begin())
  325   for (LazyCallGraph::Node &N : *D.begin())
  341   for (LazyCallGraph::Node &N : *C.begin())
  341   for (LazyCallGraph::Node &N : *C.begin())
  357   for (LazyCallGraph::Node &N : *B.begin())
  357   for (LazyCallGraph::Node &N : *B.begin())
  375   for (LazyCallGraph::Node &N : *A.begin())
  375   for (LazyCallGraph::Node &N : *A.begin())
  478   LazyCallGraph::SCC &D = *J++;
  479   for (LazyCallGraph::Node &N : D)
  488   LazyCallGraph::SCC &B = *J++;
  489   for (LazyCallGraph::Node &N : B)
  498   LazyCallGraph::SCC &C = *J++;
  499   for (LazyCallGraph::Node &N : C)
  508   LazyCallGraph::SCC &A = *J++;
  509   for (LazyCallGraph::Node &N : A)
  574   LazyCallGraph::SCC &C = *RC.begin();
 1167   LazyCallGraph::SCC &NewDC = *NewCs.begin();
 1248   EXPECT_EQ(&*RC.begin(), CG.lookupSCC(A));
 1249   EXPECT_EQ(&*RC.begin(), CG.lookupSCC(B));
 1250   EXPECT_EQ(&*RC.begin(), CG.lookupSCC(C));
 1259   EXPECT_EQ(&*RC.begin(), CG.lookupSCC(A));
 1260   EXPECT_EQ(&*RC.begin(), CG.lookupSCC(B));
 1261   EXPECT_EQ(&*RC.begin(), CG.lookupSCC(C));
 1274   EXPECT_EQ(&*J++, CG.lookupSCC(B));
 1275   EXPECT_EQ(&*J++, CG.lookupSCC(A));
 1276   EXPECT_EQ(&*J++, CG.lookupSCC(C));
 1297   EXPECT_EQ(&*J++, CG.lookupSCC(B));
 1298   EXPECT_EQ(&*J++, CG.lookupSCC(C));
 1480   LazyCallGraph::SCC &C = *RC.begin();
 1558   LazyCallGraph::SCC &AC = *RC.begin();
 1587   EXPECT_EQ(&AC, &*J);
 1589   EXPECT_EQ(&BC, &*J);
 1604   EXPECT_EQ(&AC, &*J);
 1606   EXPECT_EQ(&BC, &*J);
 1608   EXPECT_EQ(&CC, &*J);
usr/include/c++/7.4.0/bits/predefined_ops.h
  283 	{ return bool(_M_pred(*__it)); }
usr/include/c++/7.4.0/bits/stl_algobase.h
  800 	    if (!(*__first1 == *__first2))
  800 	    if (!(*__first1 == *__first2))
usr/include/c++/7.4.0/bits/stl_iterator.h
  172 	return *--__tmp;
usr/include/c++/7.4.0/bits/stl_uninitialized.h
   83 		std::_Construct(std::__addressof(*__cur), *__first);
utils/TableGen/GICombinerEmitter.cpp
  224   for (const CombineRule &EnumeratedRule : make_pointee_range(Rules)) {