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

123456789

/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopIdiomRecognize.cpp1350 for (User *U : Inst->users()) {
1505 for (User *U : CntPhi->users())
1511 for (User *U : CntInst->users())
H A DSCCP.cpp386 // the users of the instruction are updated later.
403 // work list so that the users of the instruction are updated later.
511 // OperandChangedState - This method is invoked on all of the users of an
525 // Mark I's users as changed, including AdditionalUsers.
532 for (User *U : I->users()) {
537 for (User *U : I->users())
1405 // since all of its users will have already been marked as overdefined
1406 // Update all of the users of this instruction's value.
1421 // since all of its users will have already been marked as overdefined.
1422 // Update all of the users o
[all...]
H A DIndVarSimplify.cpp642 /// the wider type and redirects all users, either removing extends or inserting
1287 // of the new users, because their parent IV will be processed later as a
1361 /// Add eligible users of NarrowDef to NarrowIVUsers.
1367 for (User *U : NarrowDef->users()) {
1389 /// def-use chain. After widenIVUse has processed all interesting IV users, the
1600 // Simplification of IV users based on SCEV evaluation.
1627 /// Iteratively perform simplification on a worklist of IV users. Each
1628 /// successive simplification may push more users which may themselves be
1798 // through all users we can easily track, and then check whether any of those
1799 // users ar
[all...]
H A DLICM.cpp495 // of the loop. We can do this if the all users of the instruction are
963 for (auto *U : Addr->users()) {
964 // Avoid traversing for Load operand with high number of users.
1269 // regardless of its users.
1271 for (const User *U : GEP->users()) {
1284 /// Return true if the only users of this instruction are outside of
1295 for (const User *U : I.users()) {
1546 // Iterate over users to be ready for actual sinking. Replace users via
1583 // Split predecessors of the PHI so that we can make users triviall
[all...]
H A DMemCpyOptimizer.cpp786 for (User *UU : U->users())
794 for (User *UU : U->users())
H A DLowerMatrixIntrinsics.cpp387 /// users of a lowered instruction, if shape information is available and
518 /// Propagate the shape information of instructions to their users.
526 // operand shapes. Add the shape for this and then add users to the work
575 for (auto *User : Inst->users())
648 // worklist, we use their users as seeds for the next round of forward
651 for (User *U : WorkList[I]->users())
986 /// users with shape information, there's nothing to do: the will use the
987 /// cached value when they are lowered. For other users, \p Matrix is
1693 // users (like stores) in the current subprogram.
1711 /// instructions in Inst2Matrix returning void or without any users i
[all...]
H A DReassociate.cpp858 for (User *U : V->users()) {
2134 // If the negate was simplified, revisit the users to see if we can
2136 for (User *U : NI->users()) {
2160 // If the negate was simplified, revisit the users to see if we can
2163 for (User *U : NI->users()) {
H A DRewriteStatepointsForGC.cpp1657 // WARNING: Does not do any fixup to adjust users of the original live
1806 insertRelocationStores(Statepoint->users(), AllocaMap, VisitedLiveValues);
1811 insertRelocationStores(Info.UnwindToken->users(), AllocaMap,
1867 for (User *U : Def->users()) {
H A DSROA.cpp268 /// Access the dead users for this alloca.
976 for (User *U : I->users())
1039 /// Disable SROA entirely if there are unhandled users of the alloca.
1184 // TODO: Allow recursive phi users.
1191 for (User *U : PN.users()) {
1319 for (User *U : SI.users()) {
2305 // Track post-rewrite users which are PHI nodes and Selects.
3137 for (User *U : I->users())
3245 /// Enqueue all the users of the given instruction for further processing.
3246 /// This uses a set to de-duplicate users
[all...]
/freebsd-13-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-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DSjLjEHPrepare.cpp290 // Avoid iterator invalidation by copying users to a temporary vector.
292 for (User *U : Inst.users()) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUPrintfRuntimeBinding.cpp166 for (auto Use : Op->users()) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroutines.cpp168 for (User *U : CoroId->users())
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVEGatherScatterLowering.cpp409 Extend = cast<Instruction>(*I->users().begin());
632 // change the phi which does affect other users of the gep (which will still
814 for (User *U : I->users()) {
925 // No other users -> reuse existing phi (One user is the instruction
928 // If the incrementing instruction does have more users than
937 // There are other users -> create a new phi
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DVectorUtils.cpp173 for (User *U : Ptr->users()) {
574 // any users we didn't see. If there are, we can't optimize that
577 for (auto *U : I.first->users())
H A DValueTracking.cpp292 for (const User *U : CxtI->users()) {
566 // non-ephemeral users). See r246696's test case for an example.
576 if (llvm::all_of(V->users(), [&](const User *U) {
1981 // There's no point in looking through other users of ConstantData for
2190 for (auto *U : V->users()) {
2223 for (auto *CmpU : U->users()) {
2231 // If a user is an AND, add all its users to the work list. We only
2238 for (auto *BOU : BO->users())
4298 /// Return true if the only users of this pointer are lifetime markers.
4300 for (const User *U : V->users()) {
[all...]
H A DInlineCost.cpp2084 for (User *U : Caller->users()) {
2154 for (User *U : BlockAddress::get(&*BB)->users())
2430 for (User *U : BlockAddress::get(&*BI)->users())
/freebsd-13-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-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLocal.cpp331 // Also zap the blockaddress constant if there are no users remaining,
610 // Add the users to the worklist. CAREFUL: an instruction can use itself,
612 for (User *U : I->users()) {
1426 if (llvm::any_of(AI->users(), [](User *U) -> bool {
1532 for (User *U : MDV->users()) {
1556 for (User *U : MDV->users())
1569 for (User *U : MDV->users())
1776 /// Point debug users of \p From to \p To using exprs given by \p RewriteExpr,
1777 /// possibly moving/undefing users to prevent use-before-def. Returns true if
1782 // Find debug users o
[all...]
H A DLoopUtils.cpp143 auto Users = Inst.users();
164 // here because users shouldn't directly get them from this header.
638 // Given LCSSA form is satisfied, we should not have users of instructions
641 // We could do it after drop all references (in this case all users in the
1131 // rewriteLoopExitValues - Optimize IV users outside the loop.
1200 // Otherwise, add all its users to worklist.
1201 for (auto U : Curr->users()) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineVectorOps.cpp90 // The users we want the PHI to have are:
95 for (auto U : PN->users()) {
301 /// Find union of elements of V demanded by all its users.
595 for (User *U : ExtVecOp->users()) {
1178 // Two users may expect different orders of the elements. Don't try it.
2116 for (User *U : SVI.users())
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DControlHeightReduction.cpp1525 for (User *U : ICmp->users()) {
1534 for (User *U : ICmp->users()) {
1589 for (User *U : I.users()) {
1957 // If Cond is an icmp and all users of V except for BranchOrSelect is a
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp110 for (const User *U : Arg->users())
714 // If the argument is ConstantPointerNull or UndefValue, its other users
728 for (const User *U : Ptr->users()) {
2054 // Delete objc_loadWeak calls with no users.
2151 // the alloca and all its users can be zapped.
2161 for (User *U : Alloca->users()) {
/freebsd-13-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-13-stable/share/mk/
H A Dsrc.opts.mk36 # Define MK_* variables (which are either "yes" or "no") for users

Completed in 228 milliseconds

123456789