Lines Matching defs:LoadSequence

104   LoadEntryVector LoadSequence;
135       LoadEntryVector &LoadSequence,
146   uint64_t getNumLoads() const { return LoadSequence.size(); }
155   LoadEntryVector LoadSequence;
160     if (LoadSequence.size() + NumLoadsForThisSize > MaxNumLoads) {
169         LoadSequence.push_back({LoadSize, Offset});
178   return LoadSequence;
207   LoadEntryVector LoadSequence;
210     LoadSequence.push_back({MaxLoadSize, Offset});
216   LoadSequence.push_back({MaxLoadSize, Offset - (MaxLoadSize - Size)});
218   return LoadSequence;
222     LoadEntryVector &LoadSequence,
225   // This part of code attempts to optimize the LoadSequence by merging allowed
232   while (LoadSequence.size() >= 2) {
233     auto Last = LoadSequence[LoadSequence.size() - 1];
234     auto PreLast = LoadSequence[LoadSequence.size() - 2];
246     LoadSequence.pop_back();
247     LoadSequence.pop_back();
248     LoadSequence.emplace_back(PreLast.Offset, LoadSize);
278   LoadSequence = computeGreedyLoadSequence(Size, LoadSizes, Options.MaxNumLoads,
281   assert(LoadSequence.size() <= Options.MaxNumLoads && "broken invariant");
285       (LoadSequence.empty() || LoadSequence.size() > 2)) {
290         (LoadSequence.empty() ||
291          OverlappingLoads.size() < LoadSequence.size())) {
292       LoadSequence = OverlappingLoads;
296   assert(LoadSequence.size() <= Options.MaxNumLoads && "broken invariant");
297   optimiseLoadSequence(LoadSequence, Options, IsUsedForZeroCmp);
436     const LoadEntry &CurLoadEntry = LoadSequence[LoadIndex];
516   const LoadEntry &CurLoadEntry = LoadSequence[BlockIndex];