Lines Matching defs:RR

411 void RefNode::setRegRef(RegisterRef RR, DataFlowGraph &G) {
414   RefData.PR = G.pack(RR);
586 // For a given instruction, check if there are any bits of RR that can remain
593 // Check if the definition of RR produces an unspecified value.
808 PhiUse DataFlowGraph::newPhiUse(Phi Owner, RegisterRef RR, Block PredB,
812   PUA.Addr->setRegRef(RR, *this);
823 Def DataFlowGraph::newDef(Instr Owner, RegisterRef RR, uint16_t Flags) {
826   DA.Addr->setRegRef(RR, *this);
923   for (RegisterRef RR : LiveIns.refs()) {
924     if (RR.isReg() && !isTracked(RR)) // isReg is likely guaranteed
928     Def DA = newDef(PA, RR, PhiFlags);
950       for (RegisterRef RR : EHRegs.refs()) {
951         if (RR.isReg() && !isTracked(RR))
956         Def DA = newDef(PA, RR, PhiFlags);
960           PhiUse PUA = newPhiUse(PA, RR, PBA);
1057     RegisterRef RR = PDA.Addr->getRegRef(*this);
1061     DefM[RR.Reg].push(DA);
1062     Defined.insert(RR.Reg);
1063     for (RegisterId A : getPRI().getAliasSet(RR.Reg)) {
1067       assert(A != RR.Reg);
1105     RegisterRef RR = PDA.Addr->getRegRef(*this);
1109     if (!Defined.insert(RR.Reg).second) {
1111       dbgs() << "Multiple definitions of register: " << Print(RR, *this)
1119     DefM[RR.Reg].push(DA);
1120     for (RegisterId A : getPRI().getAliasSet(RR.Reg)) {
1124       assert(A != RR.Reg);
1175   RegisterRef RR = RA.Addr->getRegRef(*this);
1180     return RA.Addr->getNextRef(RR, Cond, true, *this);
1193   return RA.Addr->getNextRef(RR, Cond, true, *this);
1340     RegisterRef RR = makeRegRef(Op);
1345       if (isDefUndef(In, RR))
1399       RegisterRef RR = RA.Addr->getRegRef(*this);
1400       if (RR.isReg() && isTracked(RR))
1401         Defs.insert(RR);
1440   for (RegisterRef RR : Defs.refs()) {
1442     PA.Addr->addMember(newDef(PA, RR, PhiFlags), *this);
1446       PA.Addr->addMember(newPhiUse(PA, RR, PBA), *this);
1509   RegisterRef RR = TA.Addr->getRegRef(*this);
1519     // If this completes a cover of RR, stop the stack traversal.
1524     bool Cover = Defs.insert(QR).hasCoverOf(RR);
1557     RegisterRef RR = RA.Addr->getRegRef(*this);
1560     assert(Kind != NodeAttrs::Def || !Defs.count(RR));
1561     Defs.insert(RR);
1564     auto F = DefM.find(RR.Reg);
1645         RegisterRef RR = PUA.Addr->getRegRef(*this);
1646         linkRefUp<UseNode *>(IA, PUA, DefM[RR.Reg]);
1772 bool DataFlowGraph::isTracked(RegisterRef RR) const {
1773   return !disjoint(getPRI().getUnits(RR), TrackedUnits);
1781     RegisterRef RR = R.Addr->getRegRef(*this);
1782     if (IgnoreReserved && RR.isReg() && ReservedRegs[RR.idx()])
1784     if (!isTracked(RR))