|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/DepthFirstIterator.h 131 NodeRef Next = *(*Opt)++;
include/llvm/ADT/PostOrderIterator.h 128 NodeRef BB = *VisitStack.back().second++;
include/llvm/ADT/SCCIterator.h 159 NodeRef childN = *VisitStack.back().NextChild++;
include/llvm/ADT/STLExtras.h 473 return *(this->I)++;
1350 *ContIt++ = *ValIt++;
include/llvm/Analysis/CGSCCPassManager.h 783 RCWorklist.insert(&*RCI++);
lib/Analysis/CFG.cpp 47 BB = *I++;
lib/DebugInfo/PDB/Native/NativeEnumInjectedSources.cpp 115 return std::make_unique<NativeInjectedSource>((Cur++)->second, File, Strings);
lib/Transforms/ObjCARC/ObjCARCOpts.cpp 1478 BasicBlock *SuccBB = *SuccStack.back().second++;
lib/Transforms/Utils/LoopSimplify.cpp 641 Instruction *Inst = &*I++;
lib/Transforms/Utils/SimplifyCFG.cpp 2595 Instruction *Curr = &*I++;
tools/clang/include/clang/Sema/Lookup.h 645 return *I++;
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/SMTConstraintManager.h 316 llvm::SMTExprRef Constraint = I++->second;
318 Constraint = Solver->mkAnd(Constraint, I++->second);
tools/clang/lib/AST/DeclObjC.cpp 1059 it++;
tools/lldb/source/Plugins/SymbolFile/NativePDB/PdbAstBuilder.cpp 1044 CVSymbol sym = *begin++;
tools/polly/lib/CodeGen/BlockGenerators.cpp 1532 for (auto SI = succ_begin(BB), SE = succ_end(BB); SI != SE; SI++)
unittests/ADT/BumpPtrListTest.cpp 58 EXPECT_EQ(N, *I++);
79 EXPECT_EQ(N, *I++);
159 EXPECT_EQ(N, *I++);
167 EXPECT_EQ(N, *I++);
unittests/ADT/ImmutableSetTest.cpp 196 for (ImmutableSet<long>::iterator I = S3.begin(), E = S3.end(); I != E; I++) {
unittests/ADT/IteratorTest.cpp 102 test_iterator K = I++;
144 test_iterator K = I++;
unittests/Analysis/LazyCallGraphTest.cpp 236 LazyCallGraph::Node &A1 = (I++)->getNode();
238 LazyCallGraph::Node &A2 = (I++)->getNode();
240 LazyCallGraph::Node &A3 = (I++)->getNode();
242 LazyCallGraph::Node &B1 = (I++)->getNode();
244 LazyCallGraph::Node &B2 = (I++)->getNode();
246 LazyCallGraph::Node &B3 = (I++)->getNode();
248 LazyCallGraph::Node &C1 = (I++)->getNode();
250 LazyCallGraph::Node &C2 = (I++)->getNode();
252 LazyCallGraph::Node &C3 = (I++)->getNode();
254 LazyCallGraph::Node &D1 = (I++)->getNode();
256 LazyCallGraph::Node &D2 = (I++)->getNode();
258 LazyCallGraph::Node &D3 = (I++)->getNode();
323 LazyCallGraph::RefSCC &D = *J++;
339 LazyCallGraph::RefSCC &C = *J++;
355 LazyCallGraph::RefSCC &B = *J++;
373 LazyCallGraph::RefSCC &A = *J++;
473 LazyCallGraph::RefSCC &RC = *I++;
478 LazyCallGraph::SCC &D = *J++;
488 LazyCallGraph::SCC &B = *J++;
498 LazyCallGraph::SCC &C = *J++;
508 LazyCallGraph::SCC &A = *J++;
558 LazyCallGraph::RefSCC &RC = *I++;
1238 LazyCallGraph::RefSCC &RC = *I++;
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));
1554 LazyCallGraph::RefSCC &RC = *I++;
1647 LazyCallGraph::RefSCC &RC = *I++;
1759 LazyCallGraph::RefSCC &RC = *I++;
1889 LazyCallGraph::RefSCC &RC = *I++;
1971 LazyCallGraph::RefSCC &FRC = *I++;
1972 LazyCallGraph::RefSCC &GRC = *I++;
1999 LazyCallGraph::RefSCC &GRC = *I++;
2000 LazyCallGraph::RefSCC &FRC = *I++;
2049 LazyCallGraph::RefSCC &RC1 = *I++;
2050 LazyCallGraph::RefSCC &RC2 = *I++;
2143 LazyCallGraph::RefSCC &DeadRC = *I++;
2144 LazyCallGraph::RefSCC &RC1 = *I++;
2145 LazyCallGraph::RefSCC &RC2 = *I++;
2168 EXPECT_EQ(&RC1, &*I++);
2169 EXPECT_EQ(&RC2, &*I++);
unittests/IR/UserTest.cpp 106 I++;
115 CI++;
unittests/Support/BinaryStreamTest.cpp 427 ASSERT_EQ(Ints[0], *Iter++);
428 ASSERT_EQ(Ints[1], *Iter++);
429 ASSERT_EQ(Ints[2], *Iter++);
430 ASSERT_EQ(Ints[3], *Iter++);
493 ASSERT_EQ("1. Test", *Iter++);
494 ASSERT_EQ("2. Longer Test", *Iter++);
495 ASSERT_EQ("3. Really Long Test", *Iter++);
496 ASSERT_EQ("4. Super Extra Longest Test Of All", *Iter++);