Searched refs:users (Results 176 - 200 of 208) sorted by relevance

123456789

/freebsd-13-stable/contrib/llvm-project/llvm/lib/IR/
H A DVerifier.cpp556 // Helper to recursively iterate over indirect users. By
2142 for (const User *U : Call.users()) {
3591 for (const User *U : SwiftErrorVal->users()) {
3920 for (User *U : CurrentPad->users()) {
3971 // to check all direct users of FPI for consistency.
4215 for (User *U : I.users()) {
4554 for (User *U : Call.users()) {
H A DFunction.cpp1525 for (const User *U : users())
/freebsd-13-stable/sys/dev/netmap/
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-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMTargetTransformInfo.cpp1086 const User *Us = *I->users().begin();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyValueInfo.cpp1911 for (auto *U : I->users())
H A DMemorySSA.cpp1217 // users with live on entry.
1509 // arguments or users of globals, where the memory they use is defined before
2066 assert(is_contained(Def->users(), Use) &&
H A DInstructionSimplify.cpp5659 /// instruction simplified to itself. Make life easier for users by
5671 /// InstructionSimplify. Recursively visited users which could not be
5688 for (User *U : I->users())
5721 for (User *U : I->users())
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPULibCalls.cpp1312 for (User* U : CArgVal->users()) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGISel.cpp1174 for (const User *U : CPI->users()) {
1199 for (const User *U : CPI->users()) {
H A DSelectionDAGBuilder.cpp3152 // Check if the condition of the select has one use or two users that are both
3155 return llvm::all_of(Cond->users(), [](const Value *V) {
5624 for (auto *U : PreallocatedSetup->users()) {
9468 for (const User *U : A->users())
9632 for (const Value *U : Arg.users()) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineCasts.cpp270 // Point debug users of the dying cast to the new one.
2306 /// Check if all users of CI are StoreInsts.
2308 for (User *U : CI.users()) {
2384 for (User *V : OldPN->users()) {
2396 // rewrite it, the PHI web we're considering won't have any users
2441 // Traverse all accumulated PHI nodes and process its users,
2448 // Replace users of BitCast B->A with NewPHI. These will help
H A DInstructionCombining.cpp991 for (User *U : PN->users()) {
996 // Otherwise, we can replace *all* users with the new PHI we form.
2332 // Preserve GEP address space to satisfy users
2440 for (User *U : PI->users()) {
3185 // correct too but reordering filters pointlessly might confuse users.
3563 // Push the new instruction and any users onto the worklist.
H A DInstCombineAddSub.cpp1653 // multiple users. If zero non-constant index, the result is a constant and
1657 // users. If more than one non-constant indices combined, as long as the GEP
1658 // with at least one non-constant index doesn't have multiple users, there
1745 if (!IsNegation || none_of(I.users(), [&I, Op1](const User *U) {
H A DInstCombineCalls.cpp4453 for (User *U : TrampMem->users()) {
4788 for (User *U : II->users())
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DAsmPrinter.cpp1320 for (auto *CU : C->users())
1341 // To be a got equivalent, at least one of its users need to be a constant
1343 for (auto *U : GV->users())
/freebsd-13-stable/contrib/llvm-project/clang/lib/CodeGen/
H A DCGException.cpp291 for (llvm::User *U : Fn->users()) {
H A DCGStmt.cpp521 for (llvm::User *u : block->users()) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DLowerTypeTests.cpp343 // The users of this class want to replace all function references except
351 // indirect) users", so what we do is save the list of globals referenced by
1293 for (auto *U : C->users()){
1750 // Save unique users to avoid processing operand replacement
H A DAttributor.cpp627 // uses. Note that this requires users of `checkForAllUses` to not recurse but
628 // instead use the `follow` callback argument to look at transitive users,
743 // BlockAddress users are allowed.
1540 for (User *U : OldFn->users())
1666 // initialize the cache eagerly which would look the same to the users.
1889 // users. The return value might be dead if there are no live users.
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DDataFlowSanitizer.cpp1506 for (User *U : I.users()) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DScalarEvolutionExpander.cpp61 for (User *U : V->users())
1017 // its existing users.
1430 // changing the way postinc users are tracked, the only remedy is
H A DSimplifyCFG.cpp1602 // The only checking we need to do now is that all users of all instructions
2209 for (User *U : I.users()) {
5617 for (auto *User : PHI->users()) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DAtomicExpandPass.cpp1316 // Look for any users of the cmpxchg that are just comparing the loaded value
1319 for (auto User : CI->users()) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp20 // "post-inc" users. This is not talking about post-increment addressing modes;
33 // case of post-increment users is users outside the loop.
42 // TODO: When truncation is free, truncate ICmp users' operands to make it a
131 /// bail out. This threshold is far beyond the number of users that LSR can
961 for (User *UR : UVal->users()) {
994 /// still return true. Therefore, users still need to account for
1121 /// users of the same expression in common?
1843 /// chain collection, before LSR replaces IV users. During chain generation,
1916 /// dominate all the in-loop post-increment users
[all...]
/freebsd-13-stable/contrib/wpa/wpa_supplicant/
H A Dinterworking.c2620 other->anqp->users++;

Completed in 380 milliseconds

123456789