153     NodeToUsesMap Uses;  member in __anonb53772a60111::HexagonCommonGEP
407     Uses[PN].insert(Us.begin(), Us.end());  in processGepInst()
617     UseSet &MinUs = Uses[Min];  in common()
624         MinUs.insert(Uses[N].begin(), Uses[N].end());  in common()
628       Uses.erase(Min);  in common()
778     NodeToUsesMap::iterator UF = Uses.find(Node);  in recalculatePlacement()
779     assert(UF != Uses.end() && "Used node with no use information");  in recalculatePlacement()
989   NodeToUsesMap::iterator UF = Uses.find(Node);  in separateChainForNode()
990   assert(UF != Uses.end());  in separateChainForNode()
1002     Uses.erase(UF);  in separateChainForNode()
1009   Uses[NewNode] = NewUs;  in separateChainForNode()
1026     NodeToUsesMap::iterator UF = Uses.find(N);  in separateConstantChains()
1027     assert(UF != Uses.end());  in separateConstantChains()
1090   LLVM_DEBUG(dbgs() << "Node use information:\n" << Uses);  in computeNodePlacement()
1156       NodeToUsesMap::iterator UF = Uses.find(N);  in getAllUsersForNode()
1157       assert(UF != Uses.end() && "No use information for used node");  in getAllUsersForNode()
1241       NodeToUsesMap::iterator UF = Uses.find(Last);  in materialize()
1242       assert(UF != Uses.end() && "No use information found");  in materialize()
1296   Uses.clear();  in runOnFunction()