/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | LoadStoreVectorizer.cpp | 787 // Make sure all the users of a vector are constant-index extracts. 788 if (isa<VectorType>(Ty) && !llvm::all_of(LI->users(), [](const User *U) { 834 if (isa<VectorType>(Ty) && !llvm::all_of(SI->users(), [](const User *U) { 1205 for (auto Use : Chain[I]->users()) { 1206 // All users of vector loads are ExtractElement instructions with
|
H A D | LoopVectorizationLegality.cpp | 389 /// Check that the instruction has outside loop users and is not an 393 // Reductions, Inductions and non-header phis are allowed to have exit users. All 394 // other instructions must not have external users. 396 // Check that all of the users of the loop are inside the BB. 397 for (User *U : Inst->users()) { 530 // back into the PHI node may have external users. 783 // Reduction instructions are allowed to have exit users. 784 // All other instructions must not have external users. 819 // the latch) to check if it dominates all users of the recurrence. Bail out 1215 // TODO: handle non-reduction outside users whe [all...] |
H A D | LoopVectorize.cpp | 771 // so we can later fix-up the external users of the induction variables. 1774 return llvm::any_of(IV->users(), isScalarInst); 3138 // Fix up external users of the induction variable. At this point, we are 3158 for (User *U : PostInc->users()) { 3169 for (User *U : OrigPhi->users()) { 3473 // Fix-up external users of the induction variables. 3669 // Finally, fix users of the recurrence outside the loop. The users will need 3774 for (User *U : VecLoopExitInst->users()) { 3861 // Now, we need to fix the users o [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | PartialInlining.cpp | 1244 // users (function pointers, etc.) back to the original function. 1272 if (F->users().empty()) 1378 assert(Cloner.OrigFunc->users().empty() && 1379 "F's users should all be replaced!"); 1470 for (User *U : CurrFunc->users())
|
H A D | Inliner.cpp | 226 for (User *U : MDV->users()) 342 for (User *U : Caller->users()) { 816 // If the only remaining users of the function are dead constants, remove
|
H A D | MergeFunctions.cpp | 584 LLVM_DEBUG(dbgs() << " Processing alloca users: "); 586 for (User *U : AI->users()) { 951 for (User *U : V->users())
|
/freebsd-12-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-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | StackProtector.cpp | 165 for (const User *U : AI->users()) {
|
H A D | SjLjEHPrepare.cpp | 281 // Avoid iterator invalidation by copying users to a temporary vector. 283 for (User *U : Inst.users()) {
|
/freebsd-12-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-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonTargetObjectFile.cpp | 430 for (auto U : GO->users()) {
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | Float2Int.cpp | 372 // We need to ensure I has no users that have not been seen. 380 for (User *U : I->users()) {
|
H A D | LowerMatrixIntrinsics.cpp | 209 /// users of a lowered instruction, if shape information is available and 320 /// Propagate the shape information of instructions to their users. 328 // operand shapes. Add the shape for this and then add users to the work 377 for (auto *User : Inst->users()) 450 // worklist, we use their users as seeds for the next round of forward 453 for (User *U : WorkList[I]->users()) 682 /// users with shape information, there's nothing to do: the will use the 683 /// cached value when they are lowered. For other users, \p Matrix is
|
H A D | IndVarSimplify.cpp | 548 // rewriteLoopExitValues - Optimize IV users outside the loop. 565 // Otherwise, add all its users to worklist. 566 for (auto U : Curr->users()) { 990 /// the wider type and redirects all users, either removing extends or inserting 1645 // of the new users, because their parent IV will be processed later as a 1719 /// Add eligible users of NarrowDef to NarrowIVUsers. 1725 for (User *U : NarrowDef->users()) { 1747 /// def-use chain. After widenIVUse has processed all interesting IV users, the 1958 // Simplification of IV users based on SCEV evaluation. 1985 /// Iteratively perform simplification on a worklist of IV users [all...] |
H A D | LoopIdiomRecognize.cpp | 1299 for (User *U : Inst->users()) { 1454 for (User *U : CntPhi->users()) 1460 for (User *U : CntInst->users())
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineLoadStoreAlloca.cpp | 268 for (auto U : I.users()) { 398 // allocation. If this is the case, we can change all users to use 605 if (all_of(LI.users(), [&LI](User *U) { 619 assert(LI.use_empty() && "Failed to remove all users of the load!"); 1350 if (!all_of(LI->users(), [LI, LoadAddr](User *U) { 1361 for (auto *UI : LI->users()) {
|
/freebsd-12-stable/crypto/openssh/regress/ |
H A D | Makefile | 86 allow-deny-users \
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | PredicateInfo.cpp | 301 // Make phi node users appear last in the incoming block 560 if (IF->users().empty()) 572 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()) 664 // tree. Just delete the users now.
|
H A D | Local.cpp | 330 // Also zap the blockaddress constant if there are no users remaining, 574 // Add the users to the worklist. CAREFUL: an instruction can use itself, 576 for (User *U : I->users()) { 1415 if (llvm::any_of(AI->users(), [](User *U) -> bool { 1515 for (User *U : MDV->users()) { 1531 for (User *U : MDV->users()) 1544 for (User *U : MDV->users()) 1756 /// Point debug users of \p From to \p To using exprs given by \p RewriteExpr, 1757 /// possibly moving/undefing users to prevent use-before-def. Returns true if 1762 // Find debug users o [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyLowerEmscriptenEHSjLj.cpp | 713 for (User *U : SetjmpF->users()) { 910 for (User *U : SetjmpF->users()) {
|
/freebsd-12-stable/usr.sbin/crunch/examples/ |
H A D | really-big.conf | 52 progs tty ul uname unexpand unifdef uniq units unvis users uudecode uuencode
|
/freebsd-12-stable/contrib/binutils/opcodes/ |
H A D | ia64-gen.c | 707 int *users = *usersp; 760 users = (int *) 761 xrealloc ((void *) users,(count + 1) * sizeof (int)); 765 users[count++] = iclass; 772 *usersp = users; 705 int *users = *usersp; local
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | InlineCost.cpp | 1915 for (User *U : Caller->users()) { 1984 for (User *U : BlockAddress::get(&*BB)->users()) 2203 for (User *U : BlockAddress::get(&*BI)->users())
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUPrintfRuntimeBinding.cpp | 166 for (auto Use : Op->users()) {
|