Searched refs:users (Results 151 - 175 of 208) sorted by relevance

123456789

/freebsd-13-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
1105 // If all of the blockaddress' users are instructions within the
1107 if (llvm::all_of(BA->users(), [&](User *U) {
/freebsd-13-stable/sys/dev/netmap/
H A Dnetmap.c519 * Anyway users looking for the best performance should
587 * to make sure other users get to see it.
1056 /* possibily decrement counter of tx_si/rx_si users */
1962 /* optimization: count the users registered for more than
2031 (kring->users && excl))
2042 kring->users++;
2054 * last users of the involved rings. */
2073 kring->users--;
2074 if (kring->users == 0)
3957 /* give active users
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/IR/
H A DValue.cpp92 for (auto *U : users())
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DInliner.cpp216 for (User *U : MDV->users())
602 // If the only remaining users of the function are dead constants, remove
H A DFunctionAttrs.cpp1573 for (auto *U : F.users()) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGVNHoist.cpp938 for (User *U : NewMemAcc->users())
H A DInferAddressSpaces.cpp36 // from type-qualified variable declarations to its users. For example, it
786 // If any updates are made, grabs its users to the worklist because
791 for (Value *User : V->users()) {
1051 // Some users may see the same pointer operand in multiple operands. Skip
H A DNewGVN.cpp1094 // that we're users of the value we simplified to.
1104 // that we're users of the value we simplified to.
1552 // We should not need to add predicate users because the predicate info is
1859 // This condition does not depend on predicates, no need to add users
1868 // comparisons that use renamed operands as users of the earlier comparisons.
1869 // It is *not* enough to just mark predicateinfo renamed operands as users of
1881 // %operands are considered users of the icmp.
1886 // comparisons as users in PredicateInfo.cpp, or you will cause bugs. See if
2076 // Now mark the users as touched.
2077 for (auto *User : V->users()) {
[all...]
H A DSeparateConstOffsetFromGEP.cpp1317 for (User *U : V->users()) {
H A DGVN.cpp861 for (auto *U : LI->getPointerOperand()->users())
1471 for (User *U : V->users())
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCloneFunction.cpp632 for (const User *U : OrigV->users())
H A DSimplifyLibCalls.cpp94 for (User *U : V->users()) {
142 for (User *U : V->users()) {
1282 for (User *U : CI->users()) {
2163 for (User *U : Arg->users())
3408 // Some clang users checked for _chk libcall availability using:
3415 // Until we change clang and/or teach external users to check for availability
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlan.cpp859 for (VPUser *User : users())
H A DVectorCombine.cpp423 for (User *U : I.users())
H A DSLPVectorizer.cpp163 // The Look-ahead heuristic goes through the users of the bundle to calculate
164 // the users cost in getExternalUsesCost(). To avoid compilation time increase
165 // we limit the number of users visited to this value.
167 "slp-look-ahead-users-budget", cl::init(2), cl::Hidden,
168 cl::desc("The maximum number of users to visit while visiting the "
580 /// Construct a vectorizable tree that starts at \p Roots, ignoring users for
585 /// Construct a vectorizable tree that starts at \p Roots, ignoring users for
888 for (User *U : V->users()) {
1387 /// Checks if all users of \p I are the part of the vectorization tree.
1479 /// have multiple users s
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DGlobalsModRef.cpp52 // re-enable them for users of LLVM that have a particular performance
285 /// AnalyzeGlobals - Scan through the users of all of the internal
342 /// AnalyzeUsesOfPointer - Look at all of the users of the specified pointer.
420 for (User *U : GV->users()) {
H A DIVDescriptors.cpp209 // This includes users of the reduction, variables (which form a cycle
215 // We start with the PHI node and scan for all of the users of this
216 // instruction. All users must be instructions that can be used as reduction
267 // * One value may have several outside users, but all outside
278 // If the instruction has no users then this is a broken chain and can't be
334 // Process users of current instruction. Push non-PHI nodes after PHI nodes
339 for (User *U : Cur->users()) {
444 // only have a single instruction with out-of-loop users.
446 // The ExitInstruction(Instruction which is allowed to have out-of-loop users)
509 /// Returns true if the select instruction has users i
[all...]
H A DLoopInfo.cpp346 for (User *U : AuxIndVar.users())
H A DMemorySSAUpdater.cpp1130 // Mark MemoryPhi users of What not to be optimized.
1131 for (auto *U : What->users())
1135 // Replace all our users with our defining access.
1147 // Clear dangling pointers. We added all MemoryPhi users, but not all
1304 // Reset optimized on users of this store, and reset the uses.
1309 // flags on users of phi nodes if doing the below makes a phi node have all
1310 // the same arguments. Instead, we prefer users to removeMemoryAccess those
/freebsd-13-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-13-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp856 llvm::any_of(I->users(),
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineCompares.cpp66 for (auto *U : I.users())
598 // we have PHI node users of transformed instructions.
734 // Depending on the type, for external users we have to emit
1297 for (User *U : OrigAdd->users()) {
4615 for (User *U : MulVal->users()) {
4840 for (const User *U : Op0->users()) {
4872 for (const User *U : DI->users()) {
5276 /// all the users, invert the predicate and adjust all the users.
5283 // Can all users b
[all...]
/freebsd-13-stable/targets/pseudo/userland/
H A DMakefile.depend380 usr.bin/users \
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64TargetTransformInfo.cpp960 for (const User *U : I.users()) {
/freebsd-13-stable/sys/ofed/drivers/infiniband/core/
H A Dib_sa_query.c590 atomic_set(&client->users, 1);

Completed in 232 milliseconds

123456789