| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| CGSCCPassManager.h | 226 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
235 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
244 /// in \c RCWorklist.
325 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
333 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
341 assert(RCWorklist.empty() &&
354 RCWorklist.insert(&*RCI++);
357 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
438 } while (!RCWorklist.empty());
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| CGSCCPassManager.h | 226 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
235 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
244 /// in \c RCWorklist.
325 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
333 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
341 assert(RCWorklist.empty() &&
354 RCWorklist.insert(&*RCI++);
357 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
438 } while (!RCWorklist.empty());
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| CGSCCPassManager.h | 226 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
235 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
244 /// in \c RCWorklist.
325 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
333 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
341 assert(RCWorklist.empty() &&
354 RCWorklist.insert(&*RCI++);
357 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
438 } while (!RCWorklist.empty());
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| CGSCCPassManager.h | 242 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
251 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
260 /// in \c RCWorklist.
352 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
363 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
372 assert(RCWorklist.empty() &&
385 RCWorklist.insert(&*RCI++);
388 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
481 } while (!RCWorklist.empty());
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| CGSCCPassManager.h | 242 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
251 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
260 /// in \c RCWorklist.
352 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
363 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
372 assert(RCWorklist.empty() &&
385 RCWorklist.insert(&*RCI++);
388 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
481 } while (!RCWorklist.empty());
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| CGSCCPassManager.h | 242 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
251 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
260 /// in \c RCWorklist.
352 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
363 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
372 assert(RCWorklist.empty() &&
385 RCWorklist.insert(&*RCI++);
388 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
481 } while (!RCWorklist.empty());
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| CGSCCPassManager.h | 242 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
251 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
260 /// in \c RCWorklist.
352 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
363 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
372 assert(RCWorklist.empty() &&
385 RCWorklist.insert(&*RCI++);
388 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
481 } while (!RCWorklist.empty());
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| CGSCCPassManager.h | 226 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
235 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
244 /// in \c RCWorklist.
325 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
333 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
341 assert(RCWorklist.empty() &&
354 RCWorklist.insert(&*RCI++);
357 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
438 } while (!RCWorklist.empty());
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| CGSCCPassManager.h | 226 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
235 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
244 /// in \c RCWorklist.
325 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
333 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
341 assert(RCWorklist.empty() &&
354 RCWorklist.insert(&*RCI++);
357 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
438 } while (!RCWorklist.empty());
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| CGSCCPassManager.h | 226 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
235 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
244 /// in \c RCWorklist.
325 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
333 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
341 assert(RCWorklist.empty() &&
354 RCWorklist.insert(&*RCI++);
357 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
438 } while (!RCWorklist.empty());
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| CGSCCPassManager.h | 242 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
251 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
260 /// in \c RCWorklist.
352 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
363 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
372 assert(RCWorklist.empty() &&
385 RCWorklist.insert(&*RCI++);
388 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
481 } while (!RCWorklist.empty());
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| CGSCCPassManager.h | 242 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
251 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
260 /// in \c RCWorklist.
352 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
363 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
372 assert(RCWorklist.empty() &&
385 RCWorklist.insert(&*RCI++);
388 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
481 } while (!RCWorklist.empty());
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| CGSCCPassManager.h | 242 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
251 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
260 /// in \c RCWorklist.
352 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
363 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
372 assert(RCWorklist.empty() &&
385 RCWorklist.insert(&*RCI++);
388 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
481 } while (!RCWorklist.empty());
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
| CGSCCPassManager.h | 242 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
251 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
260 /// in \c RCWorklist.
352 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
363 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
372 assert(RCWorklist.empty() &&
385 RCWorklist.insert(&*RCI++);
388 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
481 } while (!RCWorklist.empty());
[all...] |
