Searched refs:users (Results 126 - 150 of 205) sorted by relevance

123456789

/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXAsmPrinter.cpp624 for (const User *U : C->users())
649 for (const User *UU : U->users())
683 for (const User *U : C->users()) {
719 for (const User *U : F->users()) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLICM.cpp540 // of the loop. We can do this if the all users of the instruction are
1008 for (auto *U : Addr->users()) {
1009 // Avoid traversing for Load operand with high number of users.
1313 // regardless of its users.
1315 for (const User *U : GEP->users()) {
1327 /// Return true if the only users of this instruction are outside of
1338 for (const User *U : I.users()) {
1589 // Iterate over users to be ready for actual sinking. Replace users via
1626 // Split predecessors of the PHI so that we can make users triviall
[all...]
H A DMemCpyOptimizer.cpp817 for (User *UU : U->users())
825 for (User *UU : U->users())
H A DReassociate.cpp857 for (User *U : V->users()) {
2130 // If the negate was simplified, revisit the users to see if we can
2132 for (User *U : NI->users()) {
2156 // If the negate was simplified, revisit the users to see if we can
2159 for (User *U : NI->users()) {
H A DRewriteStatepointsForGC.cpp1599 // WARNING: Does not do any fixup to adjust users of the original live
1748 insertRelocationStores(Statepoint->users(), AllocaMap, VisitedLiveValues);
1753 insertRelocationStores(Info.UnwindToken->users(), AllocaMap,
1810 for (User *U : Def->users()) {
H A DSROA.cpp279 /// Access the dead users for this alloca.
984 for (User *U : I->users())
1047 /// Disable SROA entirely if there are unhandled users of the alloca.
1200 // TODO: Allow recursive phi users.
1207 for (User *U : PN.users()) {
1336 for (User *U : SI.users()) {
2308 // Track post-rewrite users which are PHI nodes and Selects.
3138 for (User *U : I->users())
3246 /// Enqueue all the users of the given instruction for further processing.
3247 /// This uses a set to de-duplicate users
[all...]
H A DSCCP.cpp433 // the users of the instruction are updated later.
456 // work list so that the users of the instruction are updated later.
576 // OperandChangedState - This method is invoked on all of the users of an
590 // Mark I's users as changed, including AdditionalUsers.
592 for (User *U : I->users())
1381 // since all of its users will have already been marked as overdefined
1382 // Update all of the users of this instruction's value.
1397 // since all of its users will have already been marked as overdefined.
1398 // Update all of the users of this instruction's value.
1429 /// constraints on the condition of the branch, as that would impact other users
[all...]
H A DGVNHoist.cpp940 for (User *U : NewMemAcc->users())
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroutines.cpp169 for (User *U : CoroId->users())
/freebsd-12-stable/sys/dev/netmap/
H A Dnetmap_mem2.c169 int active; /* active users */
1866 if (ring == NULL || kring->users > 0 || (kring->nr_kflags & NKR_NEEDRING)) {
1868 nm_prinf("NOT deleting ring %s (ring %p, users %d neekring %d)",
1869 kring->name, ring, kring->users, kring->nr_kflags & NKR_NEEDRING);
1906 if (ring || (!kring->users && !(kring->nr_kflags & NKR_NEEDRING))) {
1909 nm_prinf("NOT creating ring %s (ring %p, users %d neekring %d)",
1910 kring->name, ring, kring->users, kring->nr_kflags & NKR_NEEDRING);
1963 /* we cannot actually cleanup here, since we don't own kring->users
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DVectorUtils.cpp172 for (User *U : Ptr->users()) {
465 // any users we didn't see. If there are, we can't optimize that
468 for (auto *U : I.first->users())
H A DValueTracking.cpp216 for (const User *U : CxtI->users()) {
473 // non-ephemeral users). See r246696's test case for an example.
483 if (llvm::all_of(V->users(), [&](const User *U) {
1789 // There's no point in looking through other users of ConstantData for
1999 for (auto *U : V->users()) {
2032 for (auto *CmpU : U->users()) {
2040 // If a user is an AND, add all its users to the work list. We only
2047 for (auto *BOU : BO->users())
4033 /// Return true if the only users of this pointer are lifetime markers.
4035 for (const User *U : V->users()) {
[all...]
H A DGlobalsModRef.cpp50 // re-enable them for users of LLVM that have a particular performance
283 /// AnalyzeGlobals - Scan through the users of all of the internal
340 /// AnalyzeUsesOfPointer - Look at all of the users of the specified pointer.
418 for (User *U : GV->users()) {
H A DIVDescriptors.cpp208 // This includes users of the reduction, variables (which form a cycle
214 // We start with the PHI node and scan for all of the users of this
215 // instruction. All users must be instructions that can be used as reduction
266 // * One value may have several outside users, but all outside
277 // If the instruction has no users then this is a broken chain and can't be
333 // Process users of current instruction. Push non-PHI nodes after PHI nodes
338 for (User *U : Cur->users()) {
443 // only have a single instruction with out-of-loop users.
445 // The ExitInstruction(Instruction which is allowed to have out-of-loop users)
508 /// Returns true if the select instruction has users i
[all...]
H A DLoopInfo.cpp346 for (User *U : AuxIndVar.users())
/freebsd-12-stable/crypto/heimdal/kadmin/
H A DMakefile.in107 am_add_random_users_OBJECTS = add-random-users.$(OBJEXT)
469 add_random_users_SOURCES = add-random-users.c
664 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/add-random-users.Po@am__quote@
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonLoopIdiomRecognition.cpp1124 for (auto U : Out->users()) {
1325 // cycled values, and (recursively) all their users.
1338 // Skip users from outside of the loop. They will be handled later.
1445 // Update the users outside of the loop to account for having left
1807 for (const Value *U : V->users()) {
2338 for (auto K : In.users()) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp111 for (const User *U : Arg->users())
715 // If the argument is ConstantPointerNull or UndefValue, its other users
729 for (const User *U : Ptr->users()) {
2020 // Delete objc_loadWeak calls with no users.
2116 // the alloca and all its users can be zapped.
2126 for (User *U : Alloca->users()) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineVectorOps.cpp86 // The users we want the PHI to have are:
91 for (auto U : PN->users()) {
296 /// Find union of elements of V demanded by all its users.
586 for (User *U : ExtVecOp->users()) {
1136 // Two users may expect different orders of the elements. Don't try it.
2008 for (User *U : SVI.users())
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DControlHeightReduction.cpp1532 for (User *U : ICmp->users()) {
1541 for (User *U : ICmp->users()) {
1598 for (User *U : I.users()) {
1965 // If Cond is an icmp and all users of V except for BranchOrSelect is a
/freebsd-12-stable/share/mk/
H A Dsrc.opts.mk36 # Define MK_* variables (which are either "yes" or "no") for users
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DInterleavedLoadCombinePass.cpp1169 // If there are users outside the set to be eliminated, we abort the
1171 for (auto *U : I->users()) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/IR/
H A DValue.cpp88 for (auto *U : users())
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h405 /// formal Function object but directly move the body and users from one to
787 /// implementation for details, but that use case might impact users.
868 /// This should be used when moving the body and users of a function to
1095 // If all of the blockaddress' users are instructions within the
1097 if (llvm::all_of(BA->users(), [&](User *U) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp856 llvm::any_of(I->users(),

Completed in 268 milliseconds

123456789