Lines Matching defs:Users
289 bool trackUsesOfI(DenseSet<Value *> &Users,
759 // users of the pair are also paired. This defines a (directed) forest
1176 // Figure out whether or not J uses I and update the users and write-set
1177 // structures associated with I. Specifically, Users represents the set of
1180 // and J uses I, then Users is updated to contain J and WriteSet is updated
1191 bool BBVectorize::trackUsesOfI(DenseSet<Value *> &Users,
1199 if (Users.count(J))
1206 if (I == V || Users.count(V)) {
1227 Users.insert(J);
1254 DenseSet<Value *> Users;
1266 bool UsesI = trackUsesOfI(Users, WriteSet, &*I, &*J, !Config.FastDep);
1366 for (User *UJ : P.second->users()) {
1477 // Iterate through the basic block, recording all users of each
1486 DenseSet<Value *> Users;
1492 (void)trackUsesOfI(Users, WriteSet, &*I, &*J);
1498 for (DenseSet<Value *>::iterator U = Users.begin(), E = Users.end();
1516 // Two pairs are in conflict if they are mutual Users of eachother.
1989 for (User *U : S->first->users()) {
2020 for (User *U : S->second->users()) {
2877 DenseSet<Value *> Users;
2882 (void)trackUsesOfI(Users, WriteSet, I, &*L, true, &LoadMoveSetPairs);
2888 return !trackUsesOfI(Users, WriteSet, I, J, true, &LoadMoveSetPairs);
2899 DenseSet<Value *> Users;
2904 if (trackUsesOfI(Users, WriteSet, I, &*L, true, &LoadMoveSetPairs)) {
2930 DenseSet<Value *> Users;
2938 if (trackUsesOfI(Users, WriteSet, I, &*L)) {
2972 // remaining instructions as needed (users of the first member of the pair
