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

References

include/llvm/Analysis/CGSCCPassManager.h
  462     for (LazyCallGraph::Node &N : C)
  589       for (LazyCallGraph::Node &N : C) {
  631       assert(C->begin() != C->end() && "Cannot have an empty SCC!");
  850           assert(C->begin() != C->end() && "Cannot have an empty SCC!");
  881           assert(C->begin() != C->end() && "Cannot have an empty SCC!");
include/llvm/Analysis/LazyCallGraph.h
  457       for (LazyCallGraph::Node &N : C) {
lib/Analysis/CGSCCPassManager.cpp
   96     assert(C->begin() != C->end() && "Cannot have an empty SCC!");
  257     for (LazyCallGraph::Node &N : C)
  269   for (LazyCallGraph::Node &N : C) {
  330   for (LazyCallGraph::Node &N : C) {
lib/Analysis/LazyCallGraph.cpp
  254   for (Node &N : *this)
  276     for (Node &N : C)
  336     for (Node &N : SourceSCC)
  357     for (Node &N : C)
  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()) {
  999         for (Node &N : C)
 1024         for (Node &N : C)
 1068       for (Node &N : InnerC)
 1181     for (Node &N : *C)
 1335     for (Node &N : *C) {
 1689         for (Node &N : *RC.SCCs.back()) {
 1757   for (LazyCallGraph::Node &N : C)
lib/Passes/StandardInstrumentations.cpp
   48     for (const LazyCallGraph::Node &N : *C) {
   86   for (const LazyCallGraph::Node &N : *C) {
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) {
unittests/Analysis/CGSCCPassManagerTest.cpp
  294         for (LazyCallGraph::Node &N : C) {
unittests/Analysis/LazyCallGraphTest.cpp
  325   for (LazyCallGraph::Node &N : *D.begin())
  341   for (LazyCallGraph::Node &N : *C.begin())
  357   for (LazyCallGraph::Node &N : *B.begin())
  375   for (LazyCallGraph::Node &N : *A.begin())
  479   for (LazyCallGraph::Node &N : D)
  489   for (LazyCallGraph::Node &N : B)
  499   for (LazyCallGraph::Node &N : C)
  509   for (LazyCallGraph::Node &N : A)
usr/include/c++/7.4.0/bits/range_access.h
   68     end(_Container& __cont) -> decltype(__cont.end())
   69     { return __cont.end(); }
   78     end(const _Container& __cont) -> decltype(__cont.end())