Lines Matching defs:User
5672 SDNode *User = *UI;
5675 RemoveNodeFromCSEMaps(User);
5685 } while (UI != UE && *UI == User);
5687 // Now that we have modified User, add it back to the CSE maps. If it
5689 AddModifiedNodeToCSEMaps(User);
5720 SDNode *User = *UI;
5723 RemoveNodeFromCSEMaps(User);
5733 } while (UI != UE && *UI == User);
5735 // Now that we have modified User, add it back to the CSE maps. If it
5737 AddModifiedNodeToCSEMaps(User);
5759 SDNode *User = *UI;
5762 RemoveNodeFromCSEMaps(User);
5773 } while (UI != UE && *UI == User);
5775 // Now that we have modified User, add it back to the CSE maps. If it
5777 AddModifiedNodeToCSEMaps(User);
5804 SDNode *User = *UI;
5823 RemoveNodeFromCSEMaps(User);
5829 } while (UI != UE && *UI == User);
5836 // Now that we have modified User, add it back to the CSE maps. If it
5838 AddModifiedNodeToCSEMaps(User);
5850 SDNode *User;
5855 /// operator< - Sort Memos by User.
5857 return (intptr_t)L.User < (intptr_t)R.User;
5889 // Sort the uses, so that all the uses from a given User are together.
5896 SDNode *User = Uses[UseIndex].User;
5899 RemoveNodeFromCSEMaps(User);
5901 // The Uses array is sorted, so all the uses for a given User
5911 } while (UseIndex != UseIndexEnd && Uses[UseIndex].User == User);
5913 // Now that we have modified User, add it back to the CSE maps. If it
5915 AddModifiedNodeToCSEMaps(User);
6154 SDNode *User = *I;
6155 if (User == this)