HomeSort by relevance Sort by last modified time
    Searched refs:Overlaps (Results 1 - 5 of 5) sorted by null

  /external/llvm/lib/CodeGen/
LiveIntervalUnion.cpp 27 // Merge a LiveInterval's segments. Guarantee no overlaps.
186 // overlaps.
188 Overlaps(LiveUnion->getMap(), Loop->getMap());
189 if (!Overlaps.valid())
193 LiveInterval::iterator VRI = VirtReg->find(Overlaps.start());
198 if (VRI->start < Overlaps.stop())
201 Overlaps.advanceTo(VRI->start);
202 if (!Overlaps.valid())
204 if (Overlaps.start() < VRI->end)
207 VRI = VirtReg->advanceTo(VRI, Overlaps.start())
    [all...]
RegisterCoalescer.cpp 496 if (LIS->hasInterval(*AS) && IntA.overlaps(LIS->getInterval(*AS))) {
727 // If ALR and BLR overlaps and end of BLR extends beyond end of ALR, e.g.
    [all...]
  /external/llvm/include/llvm/MC/
MCRegisterInfo.h 108 /// a particular register. The Overlaps field contains a pointer to a zero
119 const unsigned *Overlaps; // Overlapping registers, described above
216 // The Overlaps set always begins with Reg itself.
217 return get(RegNo).Overlaps + 1;
226 return get(RegNo).Overlaps;
  /external/llvm/utils/TableGen/
CodeGenRegisters.cpp 699 // Collect overlaps that don't follow from rule 2.
702 CodeGenRegister::Set &Overlaps = Map[Reg];
704 // Reg overlaps itself.
705 Overlaps.insert(Reg);
709 Overlaps.insert(Supers.begin(), Supers.end());
717 // Reg overlaps Reg2 which implies it overlaps supers(Reg2).
718 Overlaps.insert(Reg2);
719 Overlaps.insert(Supers2.begin(), Supers2.end());
725 // Apply rule 2. and inherit all sub-register overlaps
    [all...]
RegisterInfoEmitter.cpp 249 std::map<const CodeGenRegister*, CodeGenRegister::Set> Overlaps;
250 RegBank.computeOverlaps(Overlaps);
267 const CodeGenRegister::Set &O = Overlaps[Reg];

Completed in 275 milliseconds