Lines Matching defs:UNodeList

109                       const NodeList &UNodeList);
111   bool analyzeUses(unsigned DefR, const NodeList &UNodeList,
115                        const NodeList &UNodeList);
117                      unsigned LRExtReg, const NodeList &UNodeList);
118   void getAllRealUses(NodeAddr<StmtNode *> SN, NodeList &UNodeList);
119   bool allValidCandidates(NodeAddr<StmtNode *> SA, NodeList &UNodeList);
176                                          const NodeList &UNodeList) {
193   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
238                                             NodeList &UNodeList) {
239   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
270                                         NodeList &UNodeList) {
299               UNodeList.push_back(phiUA);
304         UNodeList.push_back(UA);
311                                        const NodeList &UNodeList) {
324   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
712                                         const NodeList &UNodeList) {
716   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
745     if (!isSafeToExtLR(AddSN, AddMI, BaseReg, UNodeList))
761   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
803                                      const NodeList &UNodeList,
810   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
983   NodeList UNodeList;
984   getAllRealUses(SA, UNodeList);
986   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
1079     NodeList UNodeList;
1080     getAllRealUses(SA, UNodeList);
1082     if (!allValidCandidates(SA, UNodeList))
1096       Changed |= processAddUses(SA, MI, UNodeList);
1106     if (!analyzeUses(DefR, UNodeList, InstrEvalResult, SizeInc))
1113     LLVM_DEBUG(dbgs() << "\t[Total reached uses] : " << UNodeList.size()
1116     for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {