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

123456789

/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInferAddressSpaces.cpp36 // from type-qualified variable declarations to its users. For example, it
667 // If any updates are made, grabs its users to the worklist because
672 for (Value *User : V->users()) {
927 // Some users may see the same pointer operand in multiple operands. Skip
H A DNewGVN.cpp1092 // that we're users of the value we simplified to.
1102 // that we're users of the value we simplified to.
1551 // We should not need to add predicate users because the predicate info is
1858 // This condition does not depend on predicates, no need to add users
1867 // comparisons that use renamed operands as users of the earlier comparisons.
1868 // It is *not* enough to just mark predicateinfo renamed operands as users of
1880 // %operands are considered users of the icmp.
1885 // comparisons as users in PredicateInfo.cpp, or you will cause bugs. See if
2073 // Now mark the users as touched.
2074 for (auto *User : V->users()) {
[all...]
H A DSeparateConstOffsetFromGEP.cpp1283 for (User *U : V->users()) {
H A DStructurizeCFG.cpp416 // Third: Check all the users for an invert
418 for (User *U : Condition->users())
H A DGVN.cpp840 for (auto *U : LI->getPointerOperand()->users())
1446 for (User *U : V->users())
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCloneFunction.cpp634 for (const User *U : OrigV->users())
H A DLoopUtils.cpp127 auto Users = Inst.users();
148 // here because users shouldn't directly get them from this header.
603 // Given LCSSA form is satisfied, we should not have users of instructions
606 // We could do it after drop all references (in this case all users in the
H A DSimplifyLibCalls.cpp94 for (User *U : V->users()) {
164 for (User *U : V->users()) {
1307 for (User *U : CI->users()) {
2186 for (User *U : Arg->users())
3466 // Some clang users checked for _chk libcall availability using:
3473 // Until we change clang and/or teach external users to check for availability
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlan.cpp755 for (VPUser *User : users())
H A DSLPVectorizer.cpp162 // The Look-ahead heuristic goes through the users of the bundle to calculate
163 // the users cost in getExternalUsesCost(). To avoid compilation time increase
164 // we limit the number of users visited to this value.
166 "slp-look-ahead-users-budget", cl::init(2), cl::Hidden,
167 cl::desc("The maximum number of users to visit while visiting the "
579 /// Construct a vectorizable tree that starts at \p Roots, ignoring users for
584 /// Construct a vectorizable tree that starts at \p Roots, ignoring users for
878 for (User *U : V->users()) {
1377 /// Checks if all users of \p I are the part of the vectorization tree.
1468 /// have multiple users s
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineInternal.h220 for (User *U : V->users()) {
236 // So far all users were free to invert...
238 return true; // Can freely invert all users!
H A DInstCombineCasts.cpp271 // Point debug users of the dying cast to the new one.
2205 /// Check if all users of CI are StoreInsts.
2207 for (User *U : CI.users()) {
2283 for (User *V : OldPN->users()) {
2295 // rewrite it, the PHI web we're considering won't have any users
2340 // Traverse all accumulated PHI nodes and process its users,
2347 // Replace users of BitCast B->A with NewPHI. These will help
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()) {
4600 for (User *U : MulVal->users()) {
4838 for (const User *U : Op0->users()) {
4870 for (const User *U : DI->users()) {
H A DInstructionCombining.cpp971 for (User *U : PN->users()) {
976 // Otherwise, we can replace *all* users with the new PHI we form.
2226 // Preserve GEP address space to satisfy users
2329 for (User *U : PI->users()) {
3027 // correct too but reordering filters pointlessly might confuse users.
3395 // Push the new instruction and any users onto the worklist.
/freebsd-12-stable/sys/dev/netmap/
H A Dnetmap.c517 * Anyway users looking for the best performance should
584 * to make sure other users get to see it.
1053 /* possibily decrement counter of tx_si/rx_si users */
1952 /* optimization: count the users registered for more than
2021 (kring->users && excl))
2032 kring->users++;
2044 * last users of the involved rings. */
2063 kring->users--;
2064 if (kring->users == 0)
3947 /* give active users
[all...]
H A Dnetmap_kern.h444 #define NKR_NEEDRING 0x8 /* ring needed even if users==0
511 uint32_t users; /* existing bindings for this ring */ member in struct:netmap_kring
751 /* count users of the global wait queues */
942 * if the NIC is owned by a user, only users can share it.
2259 /* Reference counter to track users of backend netmap port: the
/freebsd-12-stable/contrib/llvm-project/llvm/lib/IR/
H A DVerifier.cpp553 // Helper to recursively iterate over indirect users. By
2068 for (const User *U : Call.users()) {
3476 for (const User *U : SwiftErrorVal->users()) {
3805 for (User *U : CurrentPad->users()) {
3856 // to check all direct users of FPI for consistency.
4095 for (User *U : I.users()) {
H A DFunction.cpp1466 for (const User *U : users())
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DMemorySSAUpdater.cpp1128 // Mark MemoryPhi users of What not to be optimized.
1129 for (auto *U : What->users())
1133 // Replace all our users with our defining access.
1145 // Clear dangling pointers. We added all MemoryPhi users, but not all
1302 // Reset optimized on users of this store, and reset the uses.
1307 // flags on users of phi nodes if doing the below makes a phi node have all
1308 // the same arguments. Instead, we prefer users to removeMemoryAccess those
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64TargetTransformInfo.cpp888 for (const User *U : I.users()) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp1574 for (auto *U : F.users()) {
/freebsd-12-stable/sys/ofed/drivers/infiniband/core/
H A Dib_sa_query.c590 atomic_set(&client->users, 1);
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPULibCalls.cpp1316 for (User* U : CArgVal->users()) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGISel.cpp1201 for (const User *U : CPI->users()) {
1226 for (const User *U : CPI->users()) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DAsmPrinter.cpp1263 for (auto *CU : C->users())
1284 // To be a got equivalent, at least one of its users need to be a constant
1286 for (auto *U : GV->users())

Completed in 441 milliseconds

123456789