Lines Matching refs:Entries
154 /// The entries on the path from the glvalue to the designated subobject.
155 SmallVector<PathEntry, 8> Entries;
169 Entries.insert(Entries.end(), VEntries.begin(), VEntries.end());
180 Entries.clear();
188 Entries[MostDerivedPathLength - 1].ArrayIndex == MostDerivedArraySize)
207 Entries.push_back(Entry);
212 MostDerivedPathLength = Entries.size();
220 Entries.push_back(Entry);
226 MostDerivedPathLength = Entries.size();
233 Entries.push_back(Entry);
239 MostDerivedPathLength = Entries.size();
245 if (MostDerivedPathLength == Entries.size() && MostDerivedArraySize) {
246 Entries.back().ArrayIndex += N;
247 if (Entries.back().ArrayIndex > MostDerivedArraySize) {
248 diagnosePointerArithmetic(Info, E, Entries.back().ArrayIndex);
572 if (MostDerivedPathLength == Entries.size() && MostDerivedArraySize)
711 V = APValue(Base, Offset, Designator.Entries,
986 << IsReferenceType << !Designator.Entries.empty()
1015 << !Designator.Entries.empty() << !!VD << VD;
1275 if (TruncatedElements == D.Entries.size())
1284 for (unsigned I = TruncatedElements, N = D.Entries.size(); I != N; ++I) {
1286 const CXXRecordDecl *Base = getAsBaseClass(D.Entries[I]);
1287 if (isVirtualBaseClass(D.Entries[I]))
1293 D.Entries.resize(TruncatedElements);
1526 if (Sub.Entries.empty())
1534 for (unsigned I = 0, N = Sub.Entries.size(); I != N; ++I) {
1539 uint64_t Index = Sub.Entries[I].ArrayIndex;
1563 uint64_t Index = Sub.Entries[I].ArrayIndex;
1580 } else if (const FieldDecl *Field = getAsField(Sub.Entries[I])) {
1617 const CXXRecordDecl *Base = getAsBaseClass(Sub.Entries[I]);
1645 unsigned I = 0, N = std::min(A.Entries.size(), B.Entries.size());
1650 if (A.Entries[I].ArrayIndex != B.Entries[I].ArrayIndex) {
1659 if (A.Entries[I].BaseOrMember != B.Entries[I].BaseOrMember) {
1663 if (const FieldDecl *FD = getAsField(A.Entries[I]))
1680 if (A.Entries.size() != B.Entries.size())
1684 if (IsArray && A.MostDerivedPathLength != A.Entries.size())
1693 return CommonLength >= A.Entries.size() - IsArray;
1925 LV.Designator.Entries.size())
1928 LV.Designator.Entries.size() - MemPtr.Path.size();
1931 LV.Designator.Entries[PathLengthToMember + I]);
1943 LV.Designator.Entries.reserve(LV.Designator.Entries.size() +
1989 if (D.MostDerivedPathLength + E->path_size() > D.Entries.size()) {
1997 unsigned NewEntriesSize = D.Entries.size() - E->path_size();
2003 FinalType = getAsBaseClass(D.Entries[NewEntriesSize - 1]);
5069 if (!WasArrayIndex && Mismatch < LHSDesignator.Entries.size() &&
5070 Mismatch < RHSDesignator.Entries.size()) {
5071 const FieldDecl *LF = getAsField(LHSDesignator.Entries[Mismatch]);
5072 const FieldDecl *RF = getAsField(RHSDesignator.Entries[Mismatch]);
5077 << getAsBaseClass(LHSDesignator.Entries[Mismatch])
5081 << getAsBaseClass(RHSDesignator.Entries[Mismatch])
