/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | CodeExtractor.cpp | 152 for (const auto *U : CPI->users()) 163 for (const auto *U : CPI->users()) 451 for (User *U : Addr->users()) { 541 for (User *U : AI->users()) { 619 for (User *U : II.users()) 943 // Rewrite all users of the inputs in the extracted region to use the
|
H A D | InlineFunction.cpp | 262 for (User *Child : CatchPad->users()) { 296 for (User *U : CleanupPad->users()) { 484 // Assert as we enumerate users that 'UselessPad' doesn't have any unwind 487 // us to get here). Just assert on is direct users here; the checks in 496 for (User *U : CatchPad->users()) { 509 for (User *U : UselessPad->users()) { 1412 for (User *U : V->users()) 1429 for (User *U : AI->users()) { 1792 // TODO: Remove this when users have been updated to the assume bundles. 2389 // any users o [all...] |
H A D | PredicateInfo.cpp | 349 // Make phi node users appear last in the incoming block 614 if (IF->users().empty()) 628 if (IF->users().empty())
|
H A D | PromoteMemoryToRegister.cpp | 70 for (const User *U : AI->users()) { 326 // The only users of this bitcast/GEP instruction are lifetime intrinsics. 458 for (User *U : AI->users()) 659 // tree. Just delete the users now.
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | CodeGenPrepare.cpp | 814 for (const User *U : PN.users()) { 1100 for (auto *U : I.users()) 1303 // Check the users of the variable operand of the compare looking for an add 1305 for (User *U : A->users()) { 1374 // Walk the users of a variable operand of a compare looking for a subtract or 1379 for (User *U : CmpVariableOperand->users()) { 1505 // If icmp eq has users other than BranchInst and SelectInst, converting it to 1507 for (User *U : Cmp->users()) { 1540 // comparison and swap the direction for all branch/select users. 1546 for (User *U : Cmp->users()) { [all...] |
H A D | StackProtector.cpp | 168 for (const User *U : AI->users()) {
|
/freebsd-13-stable/contrib/subversion/subversion/libsvn_wc/ |
H A D | diff_editor.c | 186 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
|
/freebsd-13-stable/sys/dev/netmap/ |
H A D | netmap_bdg.c | 1316 NMR(hwna, t)[i]->users++; 1357 NMR(hwna, t)[i]->users--; 1379 NMR(hwna, t)[i]->users--;
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | PartialInlining.cpp | 1240 // users (function pointers, etc.) back to the original function. 1268 if (F->users().empty()) 1374 assert(Cloner.OrigFunc->users().empty() && 1375 "F's users should all be replaced!"); 1467 for (User *U : CurrFunc->users())
|
H A D | MergeFunctions.cpp | 583 LLVM_DEBUG(dbgs() << " Processing alloca users: "); 585 for (User *U : AI->users()) { 950 for (User *U : V->users())
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopInterchange.cpp | 668 // Check V's users to see if it is involved in a reduction in L. 670 for (Value *User : V->users()) { 899 // users are either reduction PHIs or PHIs outside the outer loop (which means 909 if (any_of(PHI.users(), [&Reductions, OuterL](User *U) { 1380 // latch of the new outer loop, and the only possible users can PHI nodes 1396 assert(all_of(P.users(), 1418 // If a PHI node has users outside of InnerExit, it has a use outside the
|
H A D | Float2Int.cpp | 371 // We need to ensure I has no users that have not been seen. 379 for (User *U : I->users()) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | LoadStoreVectorizer.cpp | 825 // Make sure all the users of a vector are constant-index extracts. 826 if (isa<VectorType>(Ty) && !llvm::all_of(LI->users(), [](const User *U) { 872 if (isa<VectorType>(Ty) && !llvm::all_of(SI->users(), [](const User *U) { 1251 for (auto Use : Chain[I]->users()) { 1252 // All users of vector loads are ExtractElement instructions with
|
H A D | LoopVectorizationLegality.cpp | 392 /// Check that the instruction has outside loop users and is not an 396 // Reductions, Inductions and non-header phis are allowed to have exit users. All 397 // other instructions must not have external users. 399 // Check that all of the users of the loop are inside the BB. 400 for (User *U : Inst->users()) { 533 // back into the PHI node may have external users. 808 // Reduction instructions are allowed to have exit users. 809 // All other instructions must not have external users. 844 // the latch) to check if it dominates all users of the recurrence. Bail out 1239 // TODO: handle non-reduction outside users whe [all...] |
H A D | LoopVectorize.cpp | 776 // so we can later fix-up the external users of the induction variables. 1788 return llvm::any_of(IV->users(), isScalarInst); 1917 // All IV users are scalar instructions, so only emit a scalar IV, not a 3168 // Fix up external users of the induction variable. At this point, we are 3188 for (User *U : PostInc->users()) { 3199 for (User *U : OrigPhi->users()) { 3512 // Fix-up external users of the induction variables. 3720 // Finally, fix users of the recurrence outside the loop. The users will need 3825 for (User *U : VecLoopExitInst->users()) { [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | SparsePropagation.h | 479 // users are both live and in need of updating. 480 for (User *U : V->users())
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineLoadStoreAlloca.cpp | 252 for (auto U : I.users()) { 371 // If this is the case, we can change all users to use the constant global 569 if (all_of(LI.users(), [&LI](User *U) { 583 assert(LI.use_empty() && "Failed to remove all users of the load!"); 1296 if (!all_of(LI->users(), [LI, LoadAddr](User *U) { 1307 for (auto *UI : LI->users()) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonTargetObjectFile.cpp | 432 for (auto U : GO->users()) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/ |
H A D | NVPTXAsmPrinter.cpp | 624 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-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DependenceGraphBuilder.cpp | 239 for (User *U : II->users()) {
|
H A D | StackLifetime.cpp | 87 for (const User *U : I->users()) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86PartialReduction.cpp | 325 // If this isn't the first add, then it should only have 2 users, the 414 for (auto *U : Root->users())
|
/freebsd-13-stable/crypto/openssh/regress/ |
H A D | Makefile | 86 allow-deny-users \
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyLowerEmscriptenEHSjLj.cpp | 714 for (User *U : SetjmpF->users()) { 941 for (User *U : SetjmpF->users()) {
|
/freebsd-13-stable/usr.sbin/crunch/examples/ |
H A D | really-big.conf | 52 progs tty ul uname unexpand unifdef uniq units unvis users uudecode uuencode
|