Lines Matching defs:UNodeList

97                       const NodeList &UNodeList);
99   bool analyzeUses(unsigned DefR, const NodeList &UNodeList,
103                        const NodeList &UNodeList);
105                      unsigned LRExtReg, const NodeList &UNodeList);
106   void getAllRealUses(NodeAddr<StmtNode *> SN, NodeList &UNodeList);
107   bool allValidCandidates(NodeAddr<StmtNode *> SA, NodeList &UNodeList);
164                                          const NodeList &UNodeList) {
181   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
217                                             NodeList &UNodeList) {
218   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
249                                         NodeList &UNodeList) {
278               UNodeList.push_back(phiUA);
283         UNodeList.push_back(UA);
290                                        const NodeList &UNodeList) {
303   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
419                                         const NodeList &UNodeList) {
423   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
452     if (!isSafeToExtLR(AddSN, AddMI, BaseReg, UNodeList))
468   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
510                                      const NodeList &UNodeList,
517   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
690   NodeList UNodeList;
691   getAllRealUses(SA, UNodeList);
693   for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {
785     NodeList UNodeList;
786     getAllRealUses(SA, UNodeList);
788     if (!allValidCandidates(SA, UNodeList))
802       Changed |= processAddUses(SA, MI, UNodeList);
812     if (!analyzeUses(DefR, UNodeList, InstrEvalResult, SizeInc))
819     LLVM_DEBUG(dbgs() << "\t[Total reached uses] : " << UNodeList.size()
822     for (auto I = UNodeList.rbegin(), E = UNodeList.rend(); I != E; ++I) {