Lines Matching defs:Offsets
801 const SmallVectorImpl<int64_t> &Offsets,
891 const SmallVectorImpl<int64_t> &Offsets,
922 for (SmallVectorImpl<int64_t>::const_iterator I = Offsets.begin(),
923 E = Offsets.end(); I != E; ++I) {
1004 /// offsets, for example in an unrolled loop.
1119 SmallVector<int64_t, 8> Offsets;
1238 OS << ", Offsets={";
1239 for (SmallVectorImpl<int64_t>::const_iterator I = Offsets.begin(),
1240 E = Offsets.end(); I != E; ++I) {
2073 if (NewOffset != LU.Offsets.back())
2074 LU.Offsets.push_back(NewOffset);
2110 // We don't need to track redundant offsets, but we don't need to go out
2112 if (LU.Offsets.empty() || Offset != LU.Offsets.back())
2113 LU.Offsets.push_back(Offset);
2141 // GenerateICmpZeroScales, in which case adding fixup offsets may
2319 /// increment will be an offset relative to the same base. We allow such offsets
3126 /// GenerateSymbolicOffsets - Generate reuse formulae using symbolic offsets.
3147 /// GenerateConstantOffsets - Generate reuse formulae using symbolic offsets.
3421 DEBUG(dbgs() << "Generating cross-use offsets for " << *Reg << ':';
3441 // Conservatively examine offsets between this orig reg a few selected
3622 CostF.RateFormula(F, Regs, VisitedRegs, L, LU.Offsets, SE, DT,
3658 CostBest.RateFormula(Best, Regs, VisitedRegs, L, LU.Offsets, SE, DT);
3813 if (LUThatHas->Offsets.back() != Fixup.Offset) {
3814 LUThatHas->Offsets.push_back(Fixup.Offset);
4012 NewCost.RateFormula(F, NewRegs, VisitedRegs, L, LU.Offsets, SE, DT);
