| /external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
| mismatch.pass.cpp | 70 typedef random_access_iterator<const int*> RAI;
75 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib))
76 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
82 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib+sb)
[all...] |
| mismatch_pred.pass.cpp | 80 typedef random_access_iterator<const int*> RAI;
85 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), EQ())
86 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3))));
89 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), std::ref(bcp)
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.special/ |
| copy.pass.cpp | 51 typedef random_access_iterator<I> RAI;
60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
62 assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
|
| copy_backward.pass.cpp | 51 typedef random_access_iterator<I> RAI;
59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
61 assert(std::copy_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin()));
|
| move.pass.cpp | 51 typedef random_access_iterator<I> RAI;
59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
61 assert(std::move(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
|
| move_backward.pass.cpp | 51 typedef random_access_iterator<I> RAI;
59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
61 assert(std::move_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin()));
|
| /external/llvm/lib/Target/Hexagon/ |
| RDFLiveness.h | 38 RAI(g.getRAI()), MRI(mri), Empty(), Trace(false) {}
68 const RegisterAliasInfo &RAI;
|
| RDFLiveness.cpp | 112 if (RAI.covers(RR, RefRR)) {
130 if (!IsPhi && !RAI.alias(RefRR, TA.Addr->getRegRef()))
200 if (!FullChain && RAI.covers(RRs, RefRR))
215 if (FullChain || IsPhi || !RAI.covers(RRs, QR))
287 if (RAI.covers(DefRRs, RefRR))
295 if (RAI.alias(RefRR, UR) && !RAI.covers(DefRRs, UR))
307 if (RAI.covers(DefRRs, DR) || !RAI.alias(RefRR, DR))
489 if (!RAI.covers(MidDefs, T.first)
[all...] |
| RDFGraph.cpp | 729 const MachineDominanceFrontier &mdf, const RegisterAliasInfo &rai,
731 : TimeG("rdf"), MF(mf), TII(tii), TRI(tri), MDT(mdt), MDF(mdf), RAI(rai),
1043 for (auto A : RAI.getAliasSet(RR)) {
[all...] |
| HexagonOptAddrMode.cpp | 625 RegisterAliasInfo RAI(TRI);
626 DataFlowGraph G(MF, *HII, TRI, *MDT, MDF, RAI, TOI);
|
| RDFGraph.h | 599 const MachineDominanceFrontier &mdf, const RegisterAliasInfo &rai,
631 return RAI;
795 const RegisterAliasInfo &RAI;
|
| /external/llvm/lib/CodeGen/ |
| GCRootLowering.cpp | 282 MachineBasicBlock::iterator RAI = CI;
283 ++RAI;
291 MCSymbol *Label = InsertLabel(*CI->getParent(), RAI, CI->getDebugLoc());
|
| LiveDebugValues.cpp | 315 for (MCRegAliasIterator RAI(MO.getReg(), TRI, true); RAI.isValid(); ++RAI)
317 if (VarLocIDs[ID].isDescribedByReg() == *RAI)
|
| MachineBasicBlock.cpp | [all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| GCStrategy.cpp | 361 MachineBasicBlock::iterator RAI = CI;
362 ++RAI;
370 MCSymbol* Label = InsertLabel(*CI->getParent(), RAI, CI->getDebugLoc());
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| GCRootLowering.cpp | 281 MachineBasicBlock::iterator RAI = CI;
282 ++RAI;
290 MCSymbol *Label = InsertLabel(*CI->getParent(), RAI, CI->getDebugLoc());
|
| LiveDebugValues.cpp | 444 for (MCRegAliasIterator RAI(MO.getReg(), TRI, true); RAI.isValid(); ++RAI)
446 if (VarLocIDs[ID].isDescribedByReg() == *RAI)
560 for (MCRegAliasIterator RAI(Reg, TRI, true); RAI.isValid(); ++RAI)
561 if (CalleeSavedRegs.test(*RAI))
|
| MachineBasicBlock.cpp | [all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenSchedule.cpp | [all...] |
