|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/STLExtras.h 244 static yes& test(Inner *I, decltype(I->rbegin()) * = nullptr);
263 nullptr) -> decltype(make_range(C.rbegin(), C.rend())) {
264 return make_range(C.rbegin(), C.rend());
include/llvm/Option/ArgList.h 200 const_reverse_iterator rbegin() const { return {Args.rbegin(), Args.rend()}; }
include/llvm/Support/VirtualFileSystem.h 351 const_iterator overlays_begin() const { return FSList.rbegin(); }
lib/CodeGen/ScheduleDAG.cpp 581 : make_range(SU->Succs.rbegin(), SU->Succs.rend())) {
lib/Target/AMDGPU/GCNSchedStrategy.cpp 508 auto I = Regions.rbegin(), E = Regions.rend();
lib/Target/Hexagon/HexagonOptAddrMode.cpp 176 for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
298 for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
352 for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
392 for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
438 for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
tools/clang/include/clang/AST/ASTImporter.h 196 return Cycle(Nodes.rbegin(),
197 std::find(Nodes.rbegin() + 1, Nodes.rend(), Nodes.back()) +
tools/clang/lib/AST/VTableBuilder.cpp 600 const_iterator components_begin() const { return Components.rbegin(); }
2882 VirtualMethods.append(Group.rbegin(), Group.rend());
3054 llvm::make_range(Path.rbegin(), Path.rend())) {
tools/clang/lib/Format/ContinuationIndenter.cpp 1239 I = Current.FakeLParens.rbegin(),
tools/clang/lib/Format/FormatToken.cpp 293 I = Formats.rbegin(),
tools/clang/lib/Sema/SemaInit.cpp 3452 for (auto I = Steps.rbegin(); I != Steps.rend(); ++I) {
tools/clang/lib/Sema/SemaOpenMP.cpp 184 : Stack.back().first.rbegin() + IgnoredStackElements;
tools/clang/lib/Sema/SemaTemplateInstantiate.cpp 726 Active = CodeSynthesisContexts.rbegin(),
tools/clang/tools/extra/clang-doc/Serialize.cpp 48 for (auto R = Namespaces.rbegin(), E = Namespaces.rend(); R != E; ++R)
utils/TableGen/SequenceToOffsetTable.h 42 return std::lexicographical_compare(A.rbegin(), A.rend(),
43 B.rbegin(), B.rend(), L);
59 return A.size() <= B.size() && std::equal(A.rbegin(), A.rend(), B.rbegin());
59 return A.size() <= B.size() && std::equal(A.rbegin(), A.rend(), B.rbegin());