Searched refs:users (Results 51 - 75 of 141) sorted by relevance

123456

/freebsd-11.0-release/share/mk/
H A Dbsd.opts.mk35 # Define MK_* variables (which are either "yes" or "no") for users
/freebsd-11.0-release/contrib/llvm/lib/Transforms/IPO/
H A DGlobalOpt.cpp184 /// This GV is a pointer root. Loop over all users of the global and clean up
270 /// We just marked GV constant. Loop over all users of the global, cleaning up
384 for (User *U : GEPI->users())
450 for (User *UU : U->users())
460 for (User *U : GV->users())
616 /// Return true if all users of the specified value will trap if the value is
621 for (const User *U : V->users())
663 for (const User *U : GV->users())
849 // If there are bitcast users of the malloc (which is typical, usually we have
851 // other users t
[all...]
H A DArgumentPromotion.cpp352 for (User *U : Callee->users()) {
532 // Ensure that the only users of the GEP are load instructions.
533 for (User *GEPU : GEP->users())
567 if (Loads.empty()) return true; // No users, this is a dead argument.
674 for (User *U : I->users()) {
899 // If this is an unmodified argument, move the name and users over to the
934 for (User *U : TheAlloca->users()) {
946 // Otherwise, if we promoted this argument, then all users are load
947 // instructions (or GEPs with only load users), and all loads should be
H A DInliner.cpp204 for (User *U : MDV->users())
370 for (User *U : Caller->users()) {
672 // If the only remaining users of the function are dead constants, remove
H A DStripSymbols.cpp135 for (User *U : V->users())
/freebsd-11.0-release/contrib/llvm/lib/Target/XCore/
H A DXCoreLowerThreadLocal.cpp163 for (User *U : GV->users())
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/
H A DGlobalStatus.cpp41 for (const User *U : C->users())
H A DInlineFunction.cpp220 for (User *Child : CatchPad->users()) {
254 for (User *U : CleanupPad->users()) {
398 for (User *U : HandlerBlock->getFirstNonPHI()->users())
403 for (User *U : UselessPad->users())
1196 for (User *U : V->users()) {
1219 for (User *U : AI->users()) {
1902 // any users of the original call/invoke instruction.
H A DLoopUtils.cpp171 // This includes users of the reduction, variables (which form a cycle
177 // We start with the PHI node and scan for all of the users of this
178 // instruction. All users must be instructions that can be used as reduction
235 // If the instruction has no users then this is a broken chain and can't be
280 // Process users of current instruction. Push non-PHI nodes after PHI nodes
285 for (User *U : Cur->users()) {
291 // Exit if you find multiple outside users or if the header phi node is
349 // only have a single instruction with out-of-loop users.
351 // The ExitInstruction(Instruction which is allowed to have out-of-loop users)
720 auto Users = Inst.users();
[all...]
H A DSimplifyIndVar.cpp65 /// Iteratively perform simplification on a worklist of users of the
67 /// all simplifications to users of an IV.
425 for (User *U : II->users()) {
442 // Check if all users of the add are provably NSW.
480 for (User *U : Def->users()) {
484 // Also ensure unique worklist users.
513 /// Iteratively perform simplification on a worklist of users
515 /// more users which may themselves be candidates for simplification.
519 /// variables bottom-up from their users, it transforms a chain of IVUsers
532 // Use-def pairs if IV users waitin
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Target/NVPTX/
H A DNVVMReflect.cpp161 for (User *U : ReflectFunction->users()) {
/freebsd-11.0-release/usr.bin/
H A DMakefile296 .if ${MACHINE_CPUARCH} != "riscv" # RISCVTODO users does not build
297 SUBDIR.${MK_UTMPX}+= users
/freebsd-11.0-release/contrib/llvm/tools/lldb/source/Plugins/ExpressionParser/Clang/
H A DIRForTarget.cpp284 for (llvm::User *user : function_ptr->users())
356 for (auto u : fun->users()) {
1136 // Replace the load with the call in all users
1634 for (llvm::User *u : global_variable->users())
1857 for (llvm::User *u : gv->users())
2106 SmallVector<User*, 16> users; local
2110 for (llvm::User *u : old_constant->users())
2111 users.push_back(u);
2114 i < users.size();
2117 User *user = users[
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DVectorUtils.cpp275 for (User *U : Ptr->users()) {
538 // any users we didn't see. If there are, we can't optimize that
541 for (auto *U : I.first->users())
H A DSparsePropagation.cpp306 // users are both live and in need of updating.
307 for (User *U : I->users()) {
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DFunctionLoweringInfo.cpp54 for (const User *U : I->users())
62 // For the users of the source value being used for compare instruction, if
71 for (const User *U : V->users()) {
/freebsd-11.0-release/sys/conf/
H A Dkern.opts.mk6 # Define MK_* variables (which are either "yes" or "no") for users
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DStackProtector.cpp156 for (const User *U : AI->users()) {
/freebsd-11.0-release/sys/ofed/include/rdma/
H A Dib_sa.h280 atomic_t users; member in struct:ib_sa_client
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DScalarReplAggregates.cpp477 for (User *U : V->users()) {
597 /// ConvertUsesToScalar - Convert all of the users of Ptr to use the new alloca
1065 for (User *U : DINode->users())
1147 for (User *U : SI->users()) {
1185 // TODO: Allow recursive phi users.
1189 for (User *U : PN->users()) {
1250 for (User *U : AI->users()) {
1446 for (User *U : AI->users())
1518 // all its users can be transformed, then split up the aggregate into its
1679 for (User *U : I->users()) {
[all...]
H A DLoopUnswitch.cpp1135 // Add users to the worklist which may be simplified now.
1136 for (User *U : I->users())
1176 for (User *U : LIC->users()) {
1194 for (User *U : LIC->users()) {
H A DFloat2Int.cpp378 // We need to ensure I has no users that have not been seen.
386 for (User *U : I->users()) {
H A DLICM.cpp344 // of the loop. We can do this if the all users of the instruction are
539 /// Return true if the only users of this instruction are outside of
546 for (const User *U : I.users()) {
673 // If this instruction is only used outside of the loop, then all users are
938 for (User *U : ASIV->users()) {
/freebsd-11.0-release/contrib/subversion/subversion/libsvn_wc/
H A Ddiff_editor.c183 int users;
312 parent_baton->users++;
315 db->users = 1;
337 fb->parent_baton->users++;
351 /* Destroy DB when there are no more registered users */
355 db->users--;
357 if (!db->users)
182 int users; member in struct:dir_baton_t
/freebsd-11.0-release/contrib/llvm/lib/Transforms/InstCombine/
H A DInstCombinePHI.cpp259 for (User *U : AI->users()) {
742 for (User *U : PN->users()) {
769 // If we have no users, they must be all self uses, just nuke the PHI.
774 // extracted out of it. First, sort the users by their offset and size.

Completed in 182 milliseconds

123456