Lines Matching refs:End
181 // bit-field; since we otherwise expect exclusive ends, the end is the
196 CharUnits begin, CharUnits end) {
198 assert(getTypeStoreSize(CGM, type) == end - begin);
203 legalizeVectorType(CGM, end - begin, vecTy, componentTys);
210 assert(componentSize < end - begin);
215 return addLegalTypedData(componentTys.back(), begin, end);
221 return addOpaqueData(begin, end);
225 return addLegalTypedData(type, begin, end);
229 CharUnits begin, CharUnits end) {
235 auto split = splitLegalVectorType(CGM, end - begin, vecTy);
239 auto eltSize = (end - begin) / numElts;
245 assert(begin == end);
249 return addOpaqueData(begin, end);
252 addEntry(type, begin, end);
256 CharUnits begin, CharUnits end) {
262 // Fast path: we can just add entries to the end.
263 if (Entries.empty() || Entries.back().End <= begin) {
264 Entries.push_back({begin, end, type});
272 if (Entries[index - 1].End <= begin) break;
277 // If the entry starts after the end of the new data, there's no conflict.
278 if (Entries[index].Begin >= end) {
282 Entries.insert(Entries.begin() + index, {begin, end, type});
291 if (Entries[index].Begin == begin && Entries[index].End == end) {
320 CharUnits eltSize = (end - begin) / vecTy->getNumElements();
326 assert(begin == end);
343 assert(index == 0 || begin >= Entries[index - 1].End);
346 // Stretch the end of the entry to the end of the range; but if we run
348 while (end > Entries[index].End) {
352 if (index == Entries.size() - 1 || end <= Entries[index + 1].Begin) {
353 Entries[index].End = end;
358 Entries[index].End = Entries[index + 1].Begin;
369 end < Entries[index].End) {
393 Entries[index].End = begin + eltSize;
428 if (areBytesInSameUnit(Entries[i - 1].End - CharUnits::One(),
432 Entries[i - 1].End = Entries[i].Begin;
462 auto end = orig[i].End;
465 end == orig[i + 1].Begin) {
466 end = orig[i + 1].End;
478 CharUnits localEnd = std::min(end, chunkEnd);
498 } while (begin != end);
545 lastEnd = entry.End;
576 CharUnits totalSize = Entries.back().End;
