/openbsd/gnu/llvm/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanValue.h | 145 user_iterator user_end() { return Users.end(); } in user_end() function 146 const_user_iterator user_end() const { return Users.end(); } in user_end() function 147 user_range users() { return user_range(user_begin(), user_end()); } in users() 149 return const_user_range(user_begin(), user_end()); in users() 159 while (Current != user_end() && *user_begin() == *Current) in hasMoreThanOneUniqueUser() 161 return Current != user_end(); in hasMoreThanOneUniqueUser()
|
H A D | VPlanSLP.cpp | 372 while (UI != V->user_end()) { in buildGraph()
|
H A D | VPlanTransforms.cpp | 457 SetVector<VPUser *> Users(WideIV->user_begin(), WideIV->user_end()); in optimizeInductions()
|
/openbsd/gnu/llvm/llvm/include/llvm/IR/ |
H A D | Value.h | 405 user_iterator user_end() { return user_iterator(); } in user_end() function 406 const_user_iterator user_end() const { return const_user_iterator(); } in user_end() function 416 return make_range(materialized_user_begin(), user_end()); in materialized_users() 419 return make_range(materialized_user_begin(), user_end()); in materialized_users()
|
H A D | CFG.h | 70 inline PredIterator(Ptr *bb, bool) : It(bb->user_end()) {} in PredIterator()
|
/openbsd/gnu/llvm/llvm/lib/Target/Hexagon/ |
H A D | HexagonOptimizeSZextends.cpp | 128 for (auto UI = Ashr->user_begin(), UE = Ashr->user_end(); in runOnFunction()
|
H A D | HexagonCommonGEP.cpp | 368 for (Value::user_iterator UI = GepI->user_begin(), UE = GepI->user_end(); in processGepInst()
|
H A D | HexagonLoopIdiomRecognition.cpp | 674 for (auto UI = I->user_begin(), UE = I->user_end(); UI != UE;) { in replaceAllUsesOfWithIn()
|
/openbsd/gnu/llvm/llvm/lib/IR/ |
H A D | Value.cpp | 161 return std::equal(++user_begin(), user_end(), user_begin()); in hasOneUser() 191 return hasNItems(user_begin(), user_end(), N, isUnDroppableUser); in hasNUndroppableUses() 195 return hasNItemsOrMore(user_begin(), user_end(), N, isUnDroppableUser); in hasNUndroppableUsesOrMore() 241 const_user_iterator UI = user_begin(), UE = user_end(); in isUsedInBasicBlock()
|
H A D | Constants.cpp | 684 Value::const_user_iterator I = C->user_begin(), E = C->user_end(); in constantIsDead() 711 Value::const_user_iterator I = user_begin(), E = user_end(); in removeDeadConstantUsers()
|
H A D | DebugInfo.cpp | 1697 return make_range(IDAsValue->user_begin(), IDAsValue->user_end()); in getAssignmentMarkers()
|
/openbsd/gnu/llvm/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUPromoteKernelArguments.cpp | 88 PtrUsers.append(U->user_begin(), U->user_end()); in enqueueUsers()
|
/openbsd/gnu/llvm/compiler-rt/lib/memprof/ |
H A D | memprof_allocator.cpp | 400 uptr user_end = user_beg + size; in Allocate() local 401 CHECK_LE(user_end, alloc_end); in Allocate()
|
/openbsd/gnu/llvm/llvm/lib/Transforms/Utils/ |
H A D | SplitModule.cpp | 84 Worklist.append(UU->user_begin(), UU->user_end()); in addAllGlobalValueUsers()
|
H A D | CodeExtractor.cpp | 1026 std::vector<User *> Users(inputs[i]->user_begin(), inputs[i]->user_end()); in constructFunction() 1047 std::vector<User *> Users(header->user_begin(), header->user_end()); in constructFunction() 1260 std::vector<User *> Users(outputs[i]->user_begin(), outputs[i]->user_end()); in emitCallAndSwitchStatement()
|
H A D | PredicateInfo.cpp | 780 assert(F->user_begin() == F->user_end() && in ~PredicateInfo()
|
H A D | Local.cpp | 628 Value::user_iterator UE = I->user_end(); in areAllUsesEqual()
|
/openbsd/gnu/llvm/compiler-rt/lib/asan/ |
H A D | asan_allocator.cpp | 553 uptr user_end = user_beg + size; in Allocate() local 554 CHECK_LE(user_end, alloc_end); in Allocate()
|
/openbsd/gnu/llvm/llvm/lib/Transforms/IPO/ |
H A D | PartialInlining.cpp | 951 DuplicateFunction->user_end()); in computeCallsiteToProfCountMap() 1401 Cloner.ClonedFunc->user_end()); in tryPartialInline()
|
H A D | GlobalOpt.cpp | 705 for (auto UI = V->user_begin(), E = V->user_end(); UI != E; ) { in OptimizeAwayTrappingUsesOfValue() 840 for (Value::user_iterator UI = V->user_begin(), E = V->user_end(); UI != E; ) in ConstantPropUsersOf()
|
/openbsd/gnu/llvm/llvm/lib/Transforms/Scalar/ |
H A D | LICM.cpp | 1612 for (Value::user_iterator UI = I.user_begin(), UE = I.user_end(); UI != UE;) { in sink() 1653 UE = I.user_end(); in sink() 1684 SmallSetVector<User*, 8> Users(I.user_begin(), I.user_end()); in sink()
|
H A D | IndVarSimplify.cpp | 242 if (IncrUse == Incr->user_end()) return false; in handleFloatingPointIV() 244 if (IncrUse != Incr->user_end()) return false; in handleFloatingPointIV()
|
/openbsd/gnu/llvm/llvm/include/llvm/Analysis/ |
H A D | MemorySSA.h | 1210 static ChildIteratorType child_end(NodeRef N) { return N->user_end(); }
|
/openbsd/gnu/llvm/llvm/lib/CodeGen/ |
H A D | CodeGenPrepare.cpp | 1034 for (Value::user_iterator UI = OldI->user_begin(), E = OldI->user_end(); in replaceAllUsesWith() 1314 for (Value::user_iterator UI = CI->user_begin(), E = CI->user_end(); in SinkCast() 1693 for (Value::user_iterator UI = Cmp->user_begin(), E = Cmp->user_end(); in sinkCmpExpression() 1890 for (Value::user_iterator UI = AndI->user_begin(), E = AndI->user_end(); in sinkAndCmp0Expression() 1950 TruncE = TruncI->user_end(); in SinkShiftAndTruncate() 2041 for (Value::user_iterator UI = ShiftI->user_begin(), E = ShiftI->user_end(); in OptimizeExtractBits()
|
/openbsd/gnu/llvm/llvm/lib/Analysis/ |
H A D | MemorySSAUpdater.cpp | 190 std::copy(Phi->user_begin(), Phi->user_end(), std::back_inserter(Uses)); in recursePhi()
|