|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/SparseBitVector.h 344 Iter = BitVector->Elements.begin();
398 Iter = BitVector->Elements.begin();
545 ElementListConstIter Iter1 = Elements.begin();
546 ElementListConstIter Iter2 = RHS.Elements.begin();
563 ElementListConstIter Iter2 = RHS.Elements.begin();
593 ElementListConstIter Iter2 = RHS.Elements.begin();
647 ElementListConstIter Iter2 = RHS.Elements.begin();
701 ElementListConstIter Iter1 = RHS1.Elements.begin();
702 ElementListConstIter Iter2 = RHS2.Elements.begin();
744 ElementListConstIter Iter1 = Elements.begin();
745 ElementListConstIter Iter2 = RHS.Elements.begin();
782 const SparseBitVectorElement<ElementSize> &First = *(Elements.begin());
801 for (ElementListConstIter Iter = Elements.begin();
include/llvm/ProfileData/InstrProf.h 907 for (auto V : getValueSitesForKind(ValueKind)[Site].ValueData) {
include/llvm/XRay/Profile.h 141 const_iterator begin() const { return Blocks.begin(); }
lib/Target/Mips/MCTargetDesc/MipsELFObjectWriter.cpp 208 for (const auto &R : Relocs)
lib/Transforms/Scalar/LoopDistribute.cpp 539 for (const auto &P : PartitionContainer) {
557 for (const auto &P : PartitionContainer) {
tools/clang/include/clang/AST/CXXInheritance.h 193 const_paths_iterator begin() const { return Paths.begin(); }
tools/clang/include/clang/Rewrite/Core/TokenRewriter.h 58 token_iterator token_begin() const { return TokenList.begin(); }
tools/clang/lib/ARCMigrate/ARCMT.cpp 63 ListTy::const_iterator I = List.begin();
81 for (ListTy::const_iterator I = List.begin(), E = List.end(); I != E; ++I)
86 for (ListTy::const_iterator I = List.begin(), E = List.end(); I != E; ++I)
tools/clang/lib/ARCMigrate/Internals.h 39 iterator begin() const { return List.begin(); }
tools/clang/lib/Analysis/PathDiagnostic.cpp 83 for (auto &Piece : *this) {
168 for (const auto &I : path) {
316 PathPieces::const_iterator X_I = X.begin(), X_end = X.end();
317 PathPieces::const_iterator Y_I = Y.begin(), Y_end = Y.end();
1050 for (const auto &I : pieces) {
1089 for (const auto &I : path)
1106 for (const auto &I : subPieces)
1127 for (const auto &I : path)
1135 for (PathPieces::const_iterator I = begin(), E = end(); I != E; ++I) {
tools/clang/lib/Format/TokenAnnotator.h 55 for (std::list<UnwrappedLineNode>::const_iterator I = ++Line.Tokens.begin(),
tools/clang/lib/Format/UnwrappedLineParser.cpp 599 auto I = Line.Tokens.begin();
620 auto I = Line.Tokens.begin();
2450 for (std::list<UnwrappedLineNode>::const_iterator I = Line.Tokens.begin(),
2457 for (std::list<UnwrappedLineNode>::const_iterator I = Line.Tokens.begin(),
2585 for (const UnwrappedLineNode &Node : Line.Tokens) {
tools/clang/lib/StaticAnalyzer/Core/HTMLDiagnostics.cpp 275 for (auto I : path) {
481 for (const auto &Piece : path) {
662 path.begin(), path.end(), [](const PathDiagnosticPieceRef &p) {
666 path.begin(), path.end(), [](const PathDiagnosticPieceRef &p) {
973 for (const auto &subPiece : P.subPieces) {
tools/clang/lib/StaticAnalyzer/Core/PlistDiagnostics.cpp 365 for (PathPieces::const_iterator I = P.path.begin(), E = P.path.end();I!=E;++I)
382 for (PathPieces::const_iterator I = P.subPieces.begin(),
528 assert(std::is_partitioned(Path.begin(), Path.end(),
535 Path.begin(), Path.end(), [](const PathDiagnosticPieceRef &E) {
539 PathPieces::const_iterator I = Path.begin();
541 if (FirstNonNote != Path.begin()) {
625 for (const auto &Iter : Path) {
tools/clang/lib/StaticAnalyzer/Core/SarifDiagnostics.cpp 220 for (const auto &Piece : Pieces) {
tools/clang/lib/StaticAnalyzer/Frontend/AnalysisConsumer.cpp 146 for (const auto &Piece : PD->path) {
tools/lldb/source/Breakpoint/WatchpointList.cpp 48 for (pos = m_watchpoints.begin(); pos != end; ++pos)
58 for (pos = m_watchpoints.begin(); pos != end; ++pos) {
76 for (pos = m_watchpoints.begin(); pos != end; ++pos)
107 return std::find_if(m_watchpoints.begin(),
153 wp_collection::const_iterator pos = m_watchpoints.begin();
163 for (pos = m_watchpoints.begin(); pos != end; ++pos)
191 for (pos = m_watchpoints.begin(); pos != end; ++pos)
tools/lldb/source/Plugins/DynamicLoader/Hexagon-DYLD/HexagonDYLDRendezvous.h 170 iterator begin() const { return m_soentries.begin(); }
175 iterator loaded_begin() const { return m_added_soentries.begin(); }
180 iterator unloaded_begin() const { return m_removed_soentries.begin(); }
tools/lldb/source/Plugins/DynamicLoader/POSIX-DYLD/DYLDRendezvous.h 161 iterator begin() const { return m_soentries.begin(); }
166 iterator loaded_begin() const { return m_added_soentries.begin(); }
171 iterator unloaded_begin() const { return m_removed_soentries.begin(); }
tools/polly/include/polly/ScopInfo.h 2451 const_iterator begin() const { return Stmts.begin(); }
unittests/ADT/HashingTest.cpp 144 EXPECT_EQ(arr1_hash, hash_combine_range(list.begin(), list.end()));
usr/include/c++/7.4.0/bits/list.tcc 184 __i = begin();
285 _M_assign_dispatch(__x.begin(), __x.end(), __false_type());
usr/include/c++/7.4.0/bits/range_access.h 58 begin(const _Container& __cont) -> decltype(__cont.begin())
usr/include/c++/7.4.0/bits/stl_list.h 655 { _M_initialize_dispatch(__x.begin(), __x.end(), __false_type()); }
915 { return const_reverse_iterator(begin()); }
1029 { return *begin(); }
utils/TableGen/RegisterInfoEmitter.cpp 146 for (const auto &RC : RegisterClasses)
203 for (const auto &RC : RegBank.getRegClasses()) {
1037 for (const auto &RC : RegisterClasses) {
1075 for (const auto &RC : RegisterClasses) {
1184 for (const auto &RC : RegisterClasses) {
1221 for (const auto &RC : RegisterClasses) {
1234 for (const auto &RC : RegisterClasses) {
1278 for (const auto &RC : RegisterClasses) {
1321 for (const auto &RC : RegisterClasses) {
1349 for (const auto &RC : RegisterClasses) {
1364 for (const auto &RC : RegisterClasses) {
1399 for (const auto &RC : RegisterClasses) {
1427 for (const auto &RC : RegisterClasses)
1472 for (const auto &RC : RegisterClasses) {