reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
291 Entries.insert(Entries.end(), VEntries.begin(), VEntries.end()); 291 Entries.insert(Entries.end(), VEntries.begin(), VEntries.end()); 310 assert(NewLength <= Entries.size() && "not a truncation"); 312 if (NewLength == Entries.size()) 314 Entries.resize(NewLength); 319 Ctx, Base, Entries, MostDerivedArraySize, MostDerivedType, IsArray, 327 Entries.clear(); 334 return Entries.size() == 1 && FirstEntryIsAnUnsizedArray; 350 Entries[MostDerivedPathLength - 1].getAsArrayIndex() == 366 bool IsArray = MostDerivedPathLength == Entries.size() && 368 uint64_t ArrayIndex = IsArray ? Entries.back().getAsArrayIndex() 388 return MostDerivedPathLength == Entries.size() 390 : Ctx.getRecordType(getAsBaseClass(Entries.back())); 395 Entries.push_back(PathEntry::ArrayIndex(0)); 401 MostDerivedPathLength = Entries.size(); 406 Entries.push_back(PathEntry::ArrayIndex(0)); 414 MostDerivedPathLength = Entries.size(); 419 Entries.push_back(APValue::BaseOrMemberType(D, Virtual)); 426 MostDerivedPathLength = Entries.size(); 431 Entries.push_back(PathEntry::ArrayIndex(Imag)); 438 MostDerivedPathLength = Entries.size(); 452 Entries.back() = PathEntry::ArrayIndex( 453 Entries.back().getAsArrayIndex() + TruncatedN); 460 bool IsArray = MostDerivedPathLength == Entries.size() && 462 uint64_t ArrayIndex = IsArray ? Entries.back().getAsArrayIndex() 483 Entries.back() = PathEntry::ArrayIndex(ArrayIndex); 1365 if (MostDerivedPathLength == Entries.size() && MostDerivedIsArrayElement) 1484 V = APValue(Base, Offset, Designator.Entries, 1576 if (!Designator.Entries.empty()) { 2016 << IsReferenceType << !Designator.Entries.empty() 2031 << IsReferenceType << !Designator.Entries.empty(); 2100 << !Designator.Entries.empty() << !!VD << VD; 2630 if (TruncatedElements == D.Entries.size()) 2639 for (unsigned I = TruncatedElements, N = D.Entries.size(); I != N; ++I) { 2642 const CXXRecordDecl *Base = getAsBaseClass(D.Entries[I]); 2643 if (isVirtualBaseClass(D.Entries[I])) 2649 D.Entries.resize(TruncatedElements); 3179 for (unsigned I = 0, N = Sub.Entries.size(); /**/; ++I) { 3197 Obj.Base, llvm::makeArrayRef(Sub.Entries.begin(), 3198 Sub.Entries.begin() + I)) != 3263 uint64_t Index = Sub.Entries[I].getAsArrayIndex(); 3286 uint64_t Index = Sub.Entries[I].getAsArrayIndex(); 3308 } else if (const FieldDecl *Field = getAsField(Sub.Entries[I])) { 3347 const CXXRecordDecl *Base = getAsBaseClass(Sub.Entries[I]); 3454 unsigned I = 0, N = std::min(A.Entries.size(), B.Entries.size()); 3454 unsigned I = 0, N = std::min(A.Entries.size(), B.Entries.size()); 3459 if (A.Entries[I].getAsArrayIndex() != B.Entries[I].getAsArrayIndex()) { 3459 if (A.Entries[I].getAsArrayIndex() != B.Entries[I].getAsArrayIndex()) { 3468 if (A.Entries[I].getAsBaseOrMember() != 3469 B.Entries[I].getAsBaseOrMember()) { 3473 if (const FieldDecl *FD = getAsField(A.Entries[I])) 3490 if (A.Entries.size() != B.Entries.size()) 3490 if (A.Entries.size() != B.Entries.size()) 3494 if (IsArray && A.MostDerivedPathLength != A.Entries.size()) 3503 return CommonLength >= A.Entries.size() - IsArray; 3756 assert(LVal.Designator.Entries.size() <= 1 && 3758 if (LVal.Designator.Entries.empty()) { 3772 uint64_t CharIndex = LVal.Designator.Entries[0].getAsArrayIndex(); 4117 LV.Designator.Entries.size()) { 4122 LV.Designator.Entries.size() - MemPtr.Path.size(); 4125 LV.Designator.Entries[PathLengthToMember + I]); 4139 LV.Designator.Entries.reserve(LV.Designator.Entries.size() + 4139 LV.Designator.Entries.reserve(LV.Designator.Entries.size() + 4208 if (D.MostDerivedPathLength + E->path_size() > D.Entries.size()) { 4216 unsigned NewEntriesSize = D.Entries.size() - E->path_size(); 4222 FinalType = getAsBaseClass(D.Entries[NewEntriesSize - 1]); 5019 Designator.Entries.size() && "invalid path length"); 5022 : getAsBaseClass(Designator.Entries[PathLength - 1]); 5051 ArrayRef<APValue::LValuePathEntry> Path = This.Designator.Entries; 5095 for (/**/; PathLength <= This.Designator.Entries.size(); ++PathLength) { 5120 CovariantPathLength != This.Designator.Entries.size(); 5248 for (int PathLength = Ptr.Designator.Entries.size(); 5326 unsigned PathLength = LHS.Designator.Entries.size(); 5350 LHS.Designator.Entries[PathLength] 5377 LHS.Designator.Entries[PathLength] 5551 ObjectUnderConstruction{This.getLValueBase(), This.Designator.Entries}, 5844 ObjectUnderConstruction{This.getLValueBase(), This.Designator.Entries}); 6076 Subobject = Pointer.Designator.Entries.size() != 1 || 6077 Pointer.Designator.Entries[0].getAsArrayIndex() != 0; 8906 ObjectUnderConstruction{This.getLValueBase(), This.Designator.Entries}, 10273 for (unsigned E = LVal.Designator.Entries.size(); I != E; ++I) { 10274 const auto &Entry = LVal.Designator.Entries[I]; 10312 if (!LVal.Designator.Entries.empty()) 10340 Designator.Entries.size() == Designator.MostDerivedPathLength && 10427 Designator.Entries.size() == Designator.MostDerivedPathLength) { 10429 uint64_t ArrayIndex = Designator.Entries.back().getAsArrayIndex(); 11639 if (!WasArrayIndex && Mismatch < LHSDesignator.Entries.size() && 11640 Mismatch < RHSDesignator.Entries.size()) { 11641 const FieldDecl *LF = getAsField(LHSDesignator.Entries[Mismatch]); 11642 const FieldDecl *RF = getAsField(RHSDesignator.Entries[Mismatch]); 11647 << getAsBaseClass(LHSDesignator.Entries[Mismatch]) 11651 << getAsBaseClass(RHSDesignator.Entries[Mismatch]) 13229 if (!E->isArrayForm() && Pointer.Designator.Entries.size() != 0 &&