| /src/external/apache2/llvm/dist/llvm/tools/llvm-reduce/deltas/ |
| ReduceArguments.cpp | 25 const auto &Users = OldF.users();
26 for (auto I = Users.begin(), E = Users.end(); I != E; )
66 for (auto *U : A.users())
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/ |
| Localizer.cpp | 80 // rest of the GISel pipeline generally emits constants close to their users,
92 // Check if all the users of MI are local.
153 // For each already-localized instruction which has multiple users, then we
157 // many users, but this case may be better served by regalloc improvements.
163 SmallPtrSet<MachineInstr *, 32> Users;
166 Users.insert(&UseMI);
168 // If all the users were PHIs then they're not going to be in our block,
170 if (Users.empty())
175 while (II != MBB.end() && !Users.count(&*II))
|
| /src/games/phantasia/ |
| phantglobs.c | 29 int Users; /* number of users currently playing */
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCBoolRetToInt.cpp | 150 const auto &Users = P->users();
152 if (!llvm::all_of(Users, IsValidUser) ||
169 const auto &Users = P->users();
171 if (!llvm::all_of(Users, IsPromotable) ||
|
| /src/usr.sbin/ac/ |
| ac.c | 57 * this is for our list of users that are accumulating time.
81 static struct user_list *Users = NULL;
94 #define AC_U 8 /* specified users only */
256 * not found so add new user unless specified users only
310 Users = update_user(Users, argv[optind], 0L);
353 show_today(struct user_list *users, struct utmp_list *logins, time_t secs)
368 Users = update_user(Users, lp->usr.ut_name, secs);
372 for (up = users; up != NULL; up = up->next)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/MCA/HardwareUnits/ |
| ResourceManager.cpp | 212 uint64_t Users = Resource2Groups[RSID];
213 while (Users) {
215 unsigned GroupIndex = getResourceStateIndex(Users & (-Users));
220 Users &= Users - 1;
235 uint64_t Users = Resource2Groups[RSID];
236 while (Users) {
237 unsigned GroupIndex = getResourceStateIndex(Users & (-Users));
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| VPlanValue.h | 57 SmallVector<VPUser *, 1> Users;
127 unsigned getNumUsers() const { return Users.size(); }
128 void addUser(VPUser &User) { Users.push_back(&User); }
130 /// Remove a single \p User from the list of users.
135 erase_if(Users, [&User, &Found](VPUser *Other) {
151 user_iterator user_begin() { return Users.begin(); }
152 const_user_iterator user_begin() const { return Users.begin(); }
153 user_iterator user_end() { return Users.end(); }
154 const_user_iterator user_end() const { return Users.end(); }
155 user_range users() { return user_range(user_begin(), user_end()); function in class:llvm::VPValue
156 const_user_range users() const { function in class:llvm::VPValue
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| SjLjEHPrepare.cpp | 145 SmallVector<Value *, 8> UseWorkList(LPI->users());
290 // Avoid iterator invalidation by copying users to a temporary vector.
291 SmallVector<Instruction *, 16> Users;
292 for (User *U : Inst.users()) {
295 Users.push_back(UI);
301 while (!Users.empty()) {
302 Instruction *U = Users.pop_back_val();
|
| TypePromotion.cpp | 165 // Should we change the result type of V? It will result in the users of V
423 SmallVector<Instruction*, 4> Users;
436 Users.push_back(User);
439 for (auto *U : Users)
502 // Now, insert extending instructions between the sources and their users.
706 // Insert zext instructions between sources and their users.
850 // Iterate through, and add to, a tree of operands and users in the use-def.
887 // Don't visit users of a node which isn't going to be mutated unless its a
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/MCA/ |
| Instruction.h | 96 /// this class. A WriteState object tracks the dependent users of a
141 // A list of dependent reads. Users is a set of dependent
147 SmallVector<std::pair<ReadState *, int>, 4> Users;
182 unsigned NumUsers = Users.size();
207 assert(Users.empty() && "Write is in an inconsistent state.");
214 // On every cycle, update CyclesLeft and notify dependent users.
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LoopRerollPass.cpp | 424 DenseSet<Instruction *> &Users);
428 DenseSet<Instruction *> &Users);
512 for (User *U : I->users()) {
530 for (auto *User : IV->users()) {
550 // The users of the IV must be a binary operation or a comparison
555 for (auto *UU : User->users()) {
650 for (User *U : C->users()) {
682 // Collect the set of all users of the provided root instruction. This set of
683 // users contains not only the direct users of the root instruction, but als
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| ControlHeightReduction.cpp | 1524 for (User *U : ICmp->users()) {
1533 for (User *U : ICmp->users()) {
1587 SmallVector<Instruction *, 8> Users;
1588 for (User *U : I.users()) {
1595 Users.push_back(UI);
1603 Users.push_back(UI);
1607 if (Users.size() > 0) {
1618 for (Instruction *UI : Users) {
1954 // If Cond is an icmp and all users of V except for BranchOrSelect is a
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| LoopUtils.cpp | 139 auto Users = Inst.users();
140 if (any_of(Users, [&](User *U) {
160 // here because users shouldn't directly get them from this header.
665 // Given LCSSA form is satisfied, we should not have users of instructions
668 // We could do it after drop all references (in this case all users in the
1140 // rewriteLoopExitValues - Optimize IV users outside the loop.
1209 // Otherwise, add all its users to worklist.
1210 for (auto U : Curr->users()) {
|
| SimplifyIndVar.cpp | 37 STATISTIC(NumFoldedUser, "Number of IV users folded into a constant");
75 /// Iteratively perform simplification on a worklist of users of the
77 /// all simplifications to users of an IV.
284 SmallVector<Instruction *, 4> Users;
285 for (auto *U : ICmp->users())
286 Users.push_back(cast<Instruction>(U));
287 const Instruction *CtxI = findCommonDominator(Users, *DT);
480 for (auto *U : WO->users()) {
557 // Collect users of the trunc that look like comparisons against invariants.
560 for (auto *U : TI->users()) {
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/ |
| InstructionCombining.cpp | 876 for (User *U : I->users()) {
1066 for (User *U : PN->users()) {
1071 // Otherwise, we can replace *all* users with the new PHI we form.
1202 for (User *U : make_early_inc_range(PN->users())) {
2414 // Preserve GEP address space to satisfy users
2523 SmallVectorImpl<WeakTrackingVH> &Users,
2530 for (User *U : PI->users()) {
2540 Users.emplace_back(I);
2554 Users.emplace_back(I);
2579 Users.emplace_back(I)
[all...] |
