/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | BDCE.cpp | 37 /// If an instruction is trivialized (dead), then the chain of users of that 44 // Initialize the worklist with eligible direct users. 47 for (User *JU : I->users()) { 67 // DFS through subsequent users while tracking visits to avoid cycles. 78 for (User *KU : J->users()) {
|
H A D | ConstantProp.cpp | 98 // Add all of the users of this instruction to the worklist, they might 100 for (User *U : I->users()) {
|
H A D | LoopRerollPass.cpp | 502 for (User *U : I->users()) { 520 for (auto *User : IV->users()) { 540 // The users of the IV must be a binary operation or a comparison 545 for (auto *UU : User->users()) { 640 for (User *U : C->users()) { 672 // Collect the set of all users of the provided root instruction. This set of 673 // users contains not only the direct users of the root instruction, but also 674 // all users of those users, an [all...] |
H A D | InstSimplifyPass.cpp | 58 for (User *U : I.users())
|
H A D | Reg2Mem.cpp | 52 for (const User *U : Inst->users()) {
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanValue.h | 104 user_range users() { return user_range(user_begin(), user_end()); } function in class:llvm::VPValue 105 const_user_range users() const { function in class:llvm::VPValue 114 // Check if all users match the first user. 130 /// edges from VPValue's users to their defs.
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | GlobalSplit.cpp | 56 for (User *U : GV.users()) { 116 for (User *U : GV.users()) {
|
H A D | AlwaysInliner.cpp | 54 for (User *U : F.users())
|
H A D | SyntheticCountsPropagation.cpp | 68 for (auto *U : F.users()) {
|
/freebsd-12-stable/usr.sbin/pc-sysinstall/backend/ |
H A D | parseconfig.sh | 51 . ${BACKEND}/functions-users.sh
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/ |
H A D | InstCombineWorklist.h | 88 /// AddUsersToWorkList - When an instruction is simplified, add all users of 93 for (User *U : I.users())
|
/freebsd-12-stable/tests/sys/cddl/zfs/tests/acl/nontrivial/ |
H A D | zfs_acl_chmod_owner_001_pos.ksh | 82 set -A users \ 382 while (( i < ${#users[@]} )); do 383 setup_test_files $TESTDIR/basedir ${users[i]} ${users[((i+1))]} 389 "${users[((i+2))]}" "${users[((i+3))]}" 393 "${users[((i+2))]}" "${users[((i+3))]}"
|
/freebsd-12-stable/lib/libpam/modules/pam_login_access/ |
H A D | login_access.c | 58 char *users; /* becomes list of login names */ local 89 || !(users = strtok((char *) 0, fieldsep)) 102 && list_match(users, user, user_match, login_access_opts));
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | Statepoint.h | 137 // FIXME: Migrate users of this to `getCall` and remove it. 263 for (auto *U : getInstruction()->users()) 414 for (const User *U : StatepointCall->users()) 426 for (const User *LandingPadUser : LandingPad->users()) {
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | TargetFrameLoweringImpl.cpp | 142 for (const User *U : F.users())
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPULowerIntrinsics.cpp | 121 for (auto *U : F.users()) {
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCLowerMASSVEntries.cpp | 135 // Call to lowerMASSVCall() invalidates the iterator over users upon 136 // replacing the users. Precomputing the current list of users allows us to 139 for (auto *User: Func.users())
|
H A D | PPCBoolRetToInt.cpp | 148 const auto &Users = P->users(); 167 const auto &Users = P->users();
|
/freebsd-12-stable/tests/sys/acl/ |
H A D | run | 168 my ($group, $passwd, $gid, $users) = split /:/; 169 foreach my $u (split /,/, $users) {
|
/freebsd-12-stable/crypto/heimdal/kadmin/ |
H A D | Makefile.am | 54 add_random_users_SOURCES = add-random-users.c
|
/freebsd-12-stable/tools/tools/portsinfo/ |
H A D | portsinfo.sh | 22 The FreeBSD Ports Collection offers a simple way for users and
|
/freebsd-12-stable/usr.sbin/lpr/common_source/ |
H A D | lp.h | 146 struct req_user_head users; /* list of users to query/delete */ member in struct:request 177 extern char *user[]; /* users to process */ 178 extern int users; /* # of users in user array */
|
/freebsd-12-stable/lib/libcasper/services/cap_pwd/ |
H A D | cap_pwd.c | 369 nvlist_t *limits, *users; local 379 if (nvlist_exists_nvlist(limits, "users")) 380 nvlist_free_nvlist(limits, "users"); 382 users = nvlist_create(0); 386 nvlist_add_number(users, nvlname, (uint64_t)uids[i]); 391 nvlist_add_string(users, nvlname, names[i]); 393 nvlist_move_nvlist(limits, "users", users); 448 * If no limit was set on allowed users, then all users ar [all...] |
/freebsd-12-stable/usr.sbin/lpr/lpd/ |
H A D | lpd.c | 57 * \3printer [users ...] [jobs ...]\n 59 * \4printer [users ...] [jobs ...]\n 61 * \5printer person [users ...] [jobs ...]\n 455 char *user[MAXUSERS]; /* users to process */ 456 int users; /* # of users in user array */ variable 534 if (users >= MAXUSERS) 535 fatal(0, "Too many users"); 536 user[users++] = cp; 571 if (users > [all...] |
/freebsd-12-stable/contrib/subversion/subversion/libsvn_client/ |
H A D | repos_diff.c | 149 /* Number of users of baton. Its pool will be destroyed 0 */ 150 int users; member in struct:dir_baton 245 dir_baton->users++; 248 parent_baton->users++; 257 assert(db->users > 0); 259 db->users--; 260 if (db->users) 299 parent_baton->users++;
|