Home
last modified time | relevance | path

Searched refs:ToI (Results 1 – 5 of 5) sorted by relevance

/external/llvm/lib/Object/
DArchiveWriter.cpp164 auto ToI = sys::path::begin(To); in computeRelativePath() local
165 while (*FromI == *ToI) { in computeRelativePath()
167 ++ToI; in computeRelativePath()
174 for (auto ToE = sys::path::end(To); ToI != ToE; ++ToI) in computeRelativePath()
175 sys::path::append(Relative, *ToI); in computeRelativePath()
/external/llvm/lib/Target/Hexagon/
DHexagonExpandCondsets.cpp167 bool canMoveMemTo(MachineInstr *MI, MachineInstr *ToI, bool IsDown);
851 bool HexagonExpandCondsets::canMoveMemTo(MachineInstr *TheI, MachineInstr *ToI, in canMoveMemTo() argument
856 if (HII->areMemAccessesTriviallyDisjoint(TheI, ToI)) in canMoveMemTo()
861 MachineBasicBlock::iterator StartI = IsDown ? TheI : ToI; in canMoveMemTo()
862 MachineBasicBlock::iterator EndI = IsDown ? ToI : TheI; in canMoveMemTo()
DHexagonGenInsert.cpp500 MachineBasicBlock::const_iterator ToI, const UnsignedMap &RPO,
747 MachineBasicBlock::const_iterator ToI, const UnsignedMap &RPO, in distance() argument
749 const MachineBasicBlock *FB = FromI->getParent(), *TB = ToI->getParent(); in distance()
751 return std::distance(FromI, ToI); in distance()
752 unsigned D1 = std::distance(TB->begin(), ToI); in distance()
/external/clang/lib/StaticAnalyzer/Checkers/
DDynamicTypePropagation.cpp370 const ObjCInterfaceDecl *ToI = NewTy->getInterfaceDecl(); in getBetterObjCType() local
372 if (ToI && FromI && FromI->isSuperClassOf(ToI)) in getBetterObjCType()
/external/llvm/lib/Transforms/Vectorize/
DSLPVectorizer.cpp835 void initScheduleData(Instruction *FromI, Instruction *ToI,
2912 Instruction *ToI, in initScheduleData() argument
2916 for (Instruction *I = FromI; I != ToI; I = I->getNextNode()) { in initScheduleData()