| /external/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
| D | mismatch_pred.pass.cpp | 79 typedef random_access_iterator<const int*> RAI; in main() typedef
84 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), EQ()) in main()
85 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
88 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), std::ref(bcp)) in main()
89 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
96 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib + sb), EQ()) in main()
97 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
|
| D | mismatch.pass.cpp | 69 typedef random_access_iterator<const int*> RAI; in main() typedef
74 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib)) in main()
75 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
81 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib+sb)) in main()
82 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
| D | mismatch_pred.pass.cpp | 80 typedef random_access_iterator<const int*> RAI; in main() typedef
85 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), EQ()) in main()
86 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
89 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), std::ref(bcp)) in main()
90 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
97 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib + sb), EQ()) in main()
98 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
|
| D | mismatch.pass.cpp | 70 typedef random_access_iterator<const int*> RAI; in main() typedef
75 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib)) in main()
76 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
82 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib+sb)) in main()
83 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
|
| /external/llvm-project/libcxx/test/std/containers/sequences/deque/deque.special/ |
| D | move_backward.pass.cpp | 51 typedef random_access_iterator<I> RAI; in testN() typedef
59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); in testN()
61 assert(std::move_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin())); in testN()
|
| D | copy_backward.pass.cpp | 51 typedef random_access_iterator<I> RAI; in testN() typedef
59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); in testN()
61 assert(std::copy_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin())); in testN()
|
| D | copy.pass.cpp | 51 typedef random_access_iterator<I> RAI; in testN() typedef
60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); in testN()
62 assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end())); in testN()
|
| D | move.pass.cpp | 51 typedef random_access_iterator<I> RAI; in testN() typedef
59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); in testN()
61 assert(std::move(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end())); in testN()
|
| /external/libcxx/test/std/containers/sequences/deque/deque.special/ |
| D | copy.pass.cpp | 51 typedef random_access_iterator<I> RAI; in testN() typedef
60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); in testN()
62 assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end())); in testN()
|
| D | copy_backward.pass.cpp | 51 typedef random_access_iterator<I> RAI; in testN() typedef
59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); in testN()
61 assert(std::copy_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin())); in testN()
|
| D | move.pass.cpp | 51 typedef random_access_iterator<I> RAI; in testN() typedef
59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); in testN()
61 assert(std::move(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end())); in testN()
|
| D | move_backward.pass.cpp | 51 typedef random_access_iterator<I> RAI; in testN() typedef
59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); in testN()
61 assert(std::move_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin())); in testN()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | RDFLiveness.cpp | 112 if (RAI.covers(RR, RefRR)) { in getAllReachingDefs()
130 if (!IsPhi && !RAI.alias(RefRR, TA.Addr->getRegRef())) in getAllReachingDefs()
200 if (!FullChain && RAI.covers(RRs, RefRR)) in getAllReachingDefs()
215 if (FullChain || IsPhi || !RAI.covers(RRs, QR)) in getAllReachingDefs()
287 if (RAI.covers(DefRRs, RefRR)) in getAllReachedUses()
295 if (RAI.alias(RefRR, UR) && !RAI.covers(DefRRs, UR)) in getAllReachedUses()
307 if (RAI.covers(DefRRs, DR) || !RAI.alias(RefRR, DR)) in getAllReachedUses()
489 if (!RAI.covers(MidDefs, T.first)) in computePhiInfo()
610 if (!RAI.alias(R.first, RR)) in computeLiveIns()
740 if (RAI.alias(RR, DFG.addr<DefNode*>(RD).Addr->getRegRef())) in isRestricted()
[all …]
|
| D | RDFLiveness.h | 38 RAI(g.getRAI()), MRI(mri), Empty(), Trace(false) {} in Liveness()
68 const RegisterAliasInfo &RAI; member
|
| D | RDFGraph.cpp | 731 : TimeG("rdf"), MF(mf), TII(tii), TRI(tri), MDT(mdt), MDF(mdf), RAI(rai), in DataFlowGraph()
1043 for (auto A : RAI.getAliasSet(RR)) { in pushDefs()
1359 if (I != RR && RAI.covers(I, RR)) in buildPhis()
1386 if (RAI.alias(RR, MaxRefs[I])) in buildPhis()
1505 return RAI.alias(QR, RR); in linkRefUp()
1507 bool PrecUp = RAI.covers(QR, RR); in linkRefUp()
|
| D | RDFGraph.h | 631 return RAI; in getRAI()
795 const RegisterAliasInfo &RAI; member
|
| /external/llvm-project/llvm/lib/CodeGen/LiveDebugValues/ |
| D | InstrRefBasedImpl.cpp | 1048 for (MCRegAliasIterator RAI(Reg, &TRI, true); RAI.isValid(); ++RAI) in loadInlocs() local
1049 if (CalleeSavedRegs.test(*RAI)) in loadInlocs()
1541 for (MCRegAliasIterator RAI(Reg, TRI, true); RAI.isValid(); ++RAI) in isCalleeSaved() local
1542 if (CalleeSavedRegs.test(*RAI)) in isCalleeSaved()
1786 for (MCRegAliasIterator RAI(MO.getReg(), TRI, true); RAI.isValid(); ++RAI) in transferRegisterDef() local
1788 DeadRegs.insert(*RAI); in transferRegisterDef()
1982 for (MCRegAliasIterator RAI(Reg, TRI, true); RAI.isValid(); ++RAI) in transferSpillOrRestoreInst() local
1983 MTracker->defReg(*RAI, CurBB, CurInst); in transferSpillOrRestoreInst()
1995 for (MCRegAliasIterator RAI(Reg, TRI, true); RAI.isValid(); ++RAI) in transferSpillOrRestoreInst() local
1996 MTracker->defReg(*RAI, CurBB, CurInst); in transferSpillOrRestoreInst()
[all …]
|
| D | VarLocBasedImpl.cpp | 1225 for (MCRegAliasIterator RAI(MO.getReg(), TRI, true); RAI.isValid(); ++RAI) in transferRegisterDef() local
1227 DeadRegs.insert(*RAI); in transferRegisterDef()
1450 for (MCRegAliasIterator RAI(Reg, TRI, true); RAI.isValid(); ++RAI) in transferRegisterCopy() local
1451 if (CalleeSavedRegs.test(*RAI)) in transferRegisterCopy()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | GCRootLowering.cpp | 268 MachineBasicBlock::iterator RAI = CI; in VisitCallPoint() local
269 ++RAI; in VisitCallPoint()
271 MCSymbol *Label = InsertLabel(*CI->getParent(), RAI, CI->getDebugLoc()); in VisitCallPoint()
|
| D | LiveDebugValues.cpp | 937 for (MCRegAliasIterator RAI(MO.getReg(), TRI, true); RAI.isValid(); ++RAI) in transferRegisterDef() local
939 if (VarLocIDs[ID].isDescribedByReg() == *RAI) in transferRegisterDef()
1128 for (MCRegAliasIterator RAI(Reg, TRI, true); RAI.isValid(); ++RAI) in transferRegisterCopy() local
1129 if (CalleeSavedRegs.test(*RAI)) in transferRegisterCopy()
|
| /external/llvm-project/llvm/lib/CodeGen/ |
| D | GCRootLowering.cpp | 265 MachineBasicBlock::iterator RAI = CI; in VisitCallPoint() local
266 ++RAI; in VisitCallPoint()
268 MCSymbol *Label = InsertLabel(*CI->getParent(), RAI, CI->getDebugLoc()); in VisitCallPoint()
|
| /external/llvm/lib/CodeGen/ |
| D | GCRootLowering.cpp | 282 MachineBasicBlock::iterator RAI = CI; in VisitCallPoint() local
283 ++RAI; in VisitCallPoint()
291 MCSymbol *Label = InsertLabel(*CI->getParent(), RAI, CI->getDebugLoc()); in VisitCallPoint()
|
| D | LiveDebugValues.cpp | 315 for (MCRegAliasIterator RAI(MO.getReg(), TRI, true); RAI.isValid(); ++RAI) in transferRegisterDef() local
317 if (VarLocIDs[ID].isDescribedByReg() == *RAI) in transferRegisterDef()
|
| D | MachineBasicBlock.cpp | 1246 for (MCRegAliasIterator RAI(Reg, TRI, /*IncludeSelf=*/true); RAI.isValid(); in computeRegisterLiveness() local
1247 ++RAI) in computeRegisterLiveness()
1248 if (isLiveIn(*RAI)) in computeRegisterLiveness()
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenSchedule.cpp | 1484 for (RecIter RAI = RADefs.begin(), RAE = RADefs.end(); RAI != RAE; ++RAI) { in collectProcResources() local
1485 Record *ModelDef = (*RAI)->getValueAsDef("SchedModel"); in collectProcResources()
1486 addReadAdvance(*RAI, getProcModel(ModelDef).Index); in collectProcResources()
1489 for (RecIter RAI = SRADefs.begin(), RAE = SRADefs.end(); RAI != RAE; ++RAI) { in collectProcResources() local
1490 if ((*RAI)->getValueInit("SchedModel")->isComplete()) { in collectProcResources()
1491 Record *ModelDef = (*RAI)->getValueAsDef("SchedModel"); in collectProcResources()
1492 addReadAdvance(*RAI, getProcModel(ModelDef).Index); in collectProcResources()
|