Searched refs:users (Results 76 - 100 of 205) sorted by relevance

123456789

/freebsd-12-stable/usr.bin/
H A DMakefile291 SUBDIR.${MK_UTMPX}+= users
/freebsd-12-stable/contrib/llvm-project/lldb/source/Plugins/ExpressionParser/Clang/
H A DIRForTarget.cpp883 // Replace the load with the call in all users
1034 // Replace the load with the call in all users
1364 for (llvm::User *u : global_variable->users()) {
1541 SmallVector<User *, 16> users; local
1545 for (llvm::User *u : old_constant->users())
1546 users.push_back(u);
1548 for (size_t i = 0; i < users.size(); ++i) {
1549 User *user = users[i];
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DFunctionLoweringInfo.cpp52 for (const User *U : I->users())
60 // For the users of the source value being used for compare instruction, if
69 for (const User *U : V->users()) {
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DValue.h300 /// values or constant users.
320 /// values or constant users.
420 iterator_range<user_iterator> users() { function
424 iterator_range<const_user_iterator> users() const { function
439 /// Return true if this Value has exactly N users.
442 /// Return true if this value has N users or more.
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DObjCARCContract.cpp722 // Replace bitcast users of Arg that are dominated by Inst.
725 // Add all bitcast users of the function argument first.
726 for (User *U : OrigArg->users())
733 for (User *U : BC->users())
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopRotationUtils.cpp99 // Now fix up users of the instructions in OrigHeader, inserting PHI nodes
134 // The original users in the OrigHeader are already using the
156 // The original users in the OrigHeader are already using the original
191 if (llvm::any_of(Phi.users(), [HeaderExit](const User *U) {
574 for (User *UseI : IVOpnd->users()) {
H A DLoopVersioning.cpp145 for (User *U : Inst->users())
H A DCodeExtractor.cpp149 for (const auto *U : CPI->users())
160 for (const auto *U : CPI->users())
448 for (User *U : Addr->users()) {
532 for (User *U : AI->users()) {
610 for (User *U : II.users())
928 // Rewrite all users of the inputs in the extracted region to use the
H A DInlineFunction.cpp255 for (User *Child : CatchPad->users()) {
289 for (User *U : CleanupPad->users()) {
477 // Assert as we enumerate users that 'UselessPad' doesn't have any unwind
480 // us to get here). Just assert on is direct users here; the checks in
489 for (User *U : CatchPad->users()) {
502 for (User *U : UselessPad->users()) {
1316 for (User *U : V->users())
1333 for (User *U : AI->users()) {
2331 // any users of the original call/invoke instruction.
/freebsd-12-stable/sys/conf/
H A Dkern.opts.mk6 # Define MK_* variables (which are either "yes" or "no") for users
/freebsd-12-stable/crypto/openssl/
H A DNOTES.PERL83 1. for Linux users, the easiest is to install with the use of your
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DSafeStackColoring.cpp77 for (User *U : I->users()) {
H A DCodeGenPrepare.cpp770 for (const User *U : PN.users()) {
1057 for (auto *U : I.users())
1255 // Check the users of the variable operand of the compare looking for an add
1257 for (User *U : A->users()) {
1320 // Walk the users of a variable operand of a compare looking for a subtract or
1325 for (User *U : CmpVariableOperand->users()) {
1449 // If icmp eq has users other than BranchInst and SelectInst, converting it to
1451 for (User *U : Cmp->users()) {
1484 // comparison and swap the direction for all branch/select users.
1490 for (User *U : Cmp->users()) {
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DDependenceGraphBuilder.cpp238 for (User *U : II->users()) {
H A DDivergenceAnalysis.cpp187 // marks all users of loop-carried values of the loop headed by LoopHeader as
196 // Otherwise potential users of loop-carried values could be anywhere in the
224 // taint outside users of values carried by DivLoop
262 for (const auto *User : V.users()) {
337 // Thus all users have to be in the dominance region of the loop header,
399 // propagate value divergence to users
H A DLegacyDivergenceAnalysis.cpp113 // Finds all users of I that are outside the influence region, and add these
114 // users to Worklist.
197 // these users are sync dependent on TI.
261 for (User *U : V->users()) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopUnswitch.cpp1426 // Add users to the worklist which may be simplified now.
1427 for (User *U : I->users())
1471 for (User *U : LIC->users()) {
1488 for (User *U : LIC->users()) {
1499 // all its users.
1502 // the LIC->users() iterator !. However, we can make this instruction
1503 // dead by replacing all its users and push it onto the worklist so that
1635 for (User *U : PN->users())
H A DLoopInterchange.cpp663 // Check V's users to see if it is involved in a reduction in L.
665 for (Value *User : V->users()) {
894 // users are either reduction PHIs or PHIs outside the outer loop (which means
904 if (any_of(PHI.users(), [&Reductions, OuterL](User *U) {
1358 // latch of the new outer loop, and the only possible users can PHI nodes
1374 assert(all_of(P.users(),
1396 // If a PHI node has users outside of InnerExit, it has a use outside the
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZTDC.cpp95 // any and/or/xor i1 users to the queue.
100 for (auto *U : I->users()) {
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DTruncInstCombine.cpp16 // 4. All instructions in the dag must not have users outside the dag.
233 // can't shrink something that has multiple users, unless all users are
242 for (auto *U : I->users())
248 // even if it has multiple users. Thus, update the DesiredBitWidth and
379 // We still need to check that the instruction has no users before we erase
380 // it, because {SExt, ZExt}Inst Instruction might have other users that was
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DStripSymbols.cpp134 for (User *U : V->users())
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombinePHI.cpp108 for (User *U : IIP->users()) {
143 for (User *U : Arg->users()) {
516 for (User *U : AI->users()) {
997 for (User *U : PN->users()) {
1029 // If we have no users, they must be all self uses, just nuke the PHI.
1034 // extracted out of it. First, sort the users by their offset and size.
/freebsd-12-stable/sys/ofed/include/rdma/
H A Dib_sa.h310 atomic_t users; member in struct:ib_sa_client
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/BPF/
H A DBPFAbstractMemberAccess.cpp409 for (User *U : Call->users()) {
441 for (User *U : BitCast->users()) {
471 for (User *U : GEP->users()) {
/freebsd-12-stable/contrib/subversion/subversion/libsvn_wc/
H A Ddiff_editor.c186 int users;
315 parent_baton->users++;
318 db->users = 1;
340 fb->parent_baton->users++;
354 /* Destroy DB when there are no more registered users */
358 db->users--;
360 if (!db->users)
185 int users; member in struct:dir_baton_t

Completed in 343 milliseconds

123456789