Lines Matching refs:Users
284 bool trackUsesOfI(DenseSet<Value *> &Users,
750 // users of the pair are also paired. This defines a (directed) forest
1172 // Figure out whether or not J uses I and update the users and write-set
1173 // structures associated with I. Specifically, Users represents the set of
1176 // and J uses I, then Users is updated to contain J and WriteSet is updated
1187 bool BBVectorize::trackUsesOfI(DenseSet<Value *> &Users,
1195 if (Users.count(J))
1202 if (I == V || Users.count(V)) {
1223 Users.insert(J);
1249 DenseSet<Value *> Users;
1259 bool UsesI = trackUsesOfI(Users, WriteSet, I, J, !Config.FastDep);
1358 for (User *UJ : P.second->users()) {
1469 // Iterate through the basic block, recording all users of each
1477 DenseSet<Value *> Users;
1482 (void) trackUsesOfI(Users, WriteSet, I, J);
1488 for (DenseSet<Value *>::iterator U = Users.begin(), E = Users.end();
1506 // Two pairs are in conflict if they are mutual Users of eachother.
1979 for (User *U : S->first->users()) {
2010 for (User *U : S->second->users()) {
2874 DenseSet<Value *> Users;
2879 (void) trackUsesOfI(Users, WriteSet, I, L, true, &LoadMoveSetPairs);
2885 return !trackUsesOfI(Users, WriteSet, I, J, true, &LoadMoveSetPairs);
2896 DenseSet<Value *> Users;
2901 if (trackUsesOfI(Users, WriteSet, I, L, true, &LoadMoveSetPairs)) {
2927 DenseSet<Value *> Users;
2935 if (trackUsesOfI(Users, WriteSet, I, L)) {
2994 // remaining instructions as needed (users of the first member of the pair
