Home
last modified time | relevance | path

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

/external/llvm/lib/Target/Hexagon/
DHexagonCommonGEP.cpp57 typedef std::set<Use*> UseSet; typedef
58 typedef std::map<GepNode*,UseSet> NodeToUsesMap;
265 const UseSet &Us = I->second; in operator <<()
267 for (UseSet::const_iterator J = Us.begin(), F = Us.end(); J != F; ++J) { in operator <<()
342 UseSet Us; in processGepInst()
588 UseSet &MinUs = Uses[Min]; in common()
755 UseSet &Us = UF->second; in recalculatePlacement()
756 for (UseSet::iterator I = Us.begin(), E = Us.end(); I != E; ++I) { in recalculatePlacement()
971 UseSet &Us = UF->second; in separateChainForNode()
972 UseSet NewUs; in separateChainForNode()
[all …]
DHexagonOptAddrMode.cpp219 auto UseSet = LV->getAllReachedUses(DR, DA); in getAllRealUses() local
221 for (auto UI : UseSet) { in getAllRealUses()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DHexagonCommonGEP.cpp75 using UseSet = SetVector<Use *>; typedef
76 using NodeToUsesMap = std::map<GepNode *, UseSet>;
292 const UseSet &Us = I->second; in operator <<()
294 for (UseSet::const_iterator J = Us.begin(), F = Us.end(); J != F; ++J) { in operator <<()
365 UseSet Us; in processGepInst()
609 UseSet &MinUs = Uses[Min]; in common()
773 UseSet &Us = UF->second; in recalculatePlacement()
774 for (UseSet::iterator I = Us.begin(), E = Us.end(); I != E; ++I) { in recalculatePlacement()
982 UseSet &Us = UF->second; in separateChainForNode()
983 UseSet NewUs; in separateChainForNode()
[all …]
DHexagonOptAddrMode.cpp251 auto UseSet = LV->getAllReachedUses(DR, DA); in getAllRealUses() local
253 for (auto UI : UseSet) { in getAllRealUses()
/external/swiftshader/third_party/subzero/src/
DIceTargetLowering.cpp178 std::vector<SmallBitVector> UseSet(TypeToRegisterSetSize, in filterTypeToRegisterSet() local
217 processRegList(getFlags().getUseRestrictedRegisters(), UseSet); in filterTypeToRegisterSet()
232 SmallBitVector *UseBitSet = &UseSet[TypeIndex]; in filterTypeToRegisterSet()