Lines Matching refs:Entries
199 std::vector<LineEntry> &Entries = LineEntries[FID];
201 assert((Entries.empty() || Entries.back().FileOffset < Offset) &&
202 "Adding line entries out of order!");
207 if (!Entries.empty()) {
211 FilenameID = Entries.back().FilenameID;
215 Kind = Entries.back().FileKind;
216 IncludeOffset = Entries.back().IncludeOffset;
219 Entries.push_back(LineEntry::get(Offset, LineNo, FilenameID, Kind,
234 std::vector<LineEntry> &Entries = LineEntries[FID];
236 assert((Entries.empty() || Entries.back().FileOffset < Offset) &&
237 "Adding line entries out of order!");
241 IncludeOffset = Entries.empty() ? 0 : Entries.back().IncludeOffset;
245 assert(!Entries.empty() && Entries.back().IncludeOffset &&
248 // Get the include loc of the last entries' include loc as our include loc.
251 FindNearestLineEntry(FID, Entries.back().IncludeOffset))
255 Entries.push_back(LineEntry::get(Offset, LineNo, FilenameID, FileKind,
264 const std::vector<LineEntry> &Entries = LineEntries[FID];
265 assert(!Entries.empty() && "No #line entries for this FID after all!");
269 if (Entries.back().FileOffset <= Offset)
270 return &Entries.back();
274 std::upper_bound(Entries.begin(), Entries.end(), Offset);
275 if (I == Entries.begin()) return 0;
282 const std::vector<LineEntry> &Entries) {
283 LineEntries[FID] = Entries;
1462 assert(LineTable && "Can't have linetable entries without a LineTable!");
1528 assert(LineTable && "Can't have linetable entries without a LineTable!");
1856 // consecutive FileID entries. Go through each entry contained in the
1881 return; // we covered all FileID entries in the spelling range.
