| /llvm-project/llvm/unittests/IR/ |
| H A D | UserTest.cpp | 140 EXPECT_NE(X.user_begin() ,X.user_end()); in TEST()
141 EXPECT_EQ(I0.user_begin() ,I0.user_end()); in TEST()
145 EXPECT_NE(XUser, X.user_end()); in TEST()
148 EXPECT_EQ(X.user_begin(), X.user_end()); in TEST()
149 EXPECT_NE(I0.user_begin(), I0.user_end()); in TEST()
170 EXPECT_EQ(++PersonalityUsers, PersonalityF->user_end()); in TEST()
|
| /llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanValue.h | 136 user_iterator user_end() { return Users.end(); } in users()
137 const_user_iterator user_end() const { return Users.end(); }
138 user_range users() { return user_range(user_begin(), user_end()); }
140 return const_user_range(user_begin(), user_end()); in hasMoreThanOneUniqueUser()
150 while (Current != user_end() && *user_begin() == *Current)
152 return Current != user_end();
131 user_iterator user_end() { return Users.end(); } user_end() function
132 const_user_iterator user_end() const { return Users.end(); } user_end() function
|
| H A D | VPlanSLP.cpp | 372 while (UI != V->user_end()) { in buildGraph()
|
| H A D | VPlanTransforms.cpp | 567 SetVector<VPUser *> Users(V->user_begin(), V->user_end());
573 Users.insert(V->user_begin(), V->user_end()); in legalizeAndOptimizeInductions()
|
| /llvm-project/llvm/lib/Transforms/HipStdPar/ |
| H A D | HipStdPar.cpp | 94 Tmp.insert(Tmp.end(), U->user_begin(), U->user_end()); in checkIfSupported()
|
| /llvm-project/llvm/include/llvm/IR/ |
| H A D | Value.h | 186 /// Returns true if this iterator is equal to user_end() on the value.
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()
|
| /llvm-project/mlir/include/mlir/IR/ |
| H A D | UseDefLists.h | 271 user_iterator user_end() const { return user_iterator(use_end()); } in user_end() function
274 user_range getUsers() const { return {user_begin(), user_end()}; } in getUsers()
|
| H A D | Value.h | 227 user_iterator user_end() const { return use_end(); } in user_end() function
228 user_range getUsers() const { return {user_begin(), user_end()}; } in getUsers()
|
| H A D | Operation.h | 871 user_iterator user_end() { return user_iterator(use_end()); }
874 user_range getUsers() { return {user_begin(), user_end()}; }
866 user_iterator user_end() { return user_iterator(use_end()); } user_end() function
|
| H A D | ValueRange.h | 323 user_iterator user_end();
|
| /llvm-project/compiler-rt/lib/asan/ |
| H A D | asan_allocator.cpp | 293 uptr user_end = RoundDownTo(user_begin + user_size, ASAN_SHADOW_GRANULARITY); in OnMapSecondary()
299 PoisonShadow(user_end, size - (user_end - p), kAsanHeapLeftRedzoneMagic); in OnMapSecondary()
601 uptr user_end = user_beg + size; in Allocate()
602 CHECK_LE(user_end, alloc_end); in Allocate()
617 uptr tail_beg = RoundUpTo(user_end, ASAN_SHADOW_GRANULARITY); in Allocate()
292 uptr user_end = RoundDownTo(user_begin + user_size, ASAN_SHADOW_GRANULARITY); OnMapSecondary() local
600 uptr user_end = user_beg + size; Allocate() local
|
| /llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonOptimizeSZextends.cpp | 128 for (auto UI = Ashr->user_begin(), UE = Ashr->user_end(); in runOnFunction()
|
| /llvm-project/llvm/lib/IR/ |
| H A D | Value.cpp | 162 return std::equal(++user_begin(), user_end(), user_begin()); in hasOneUser()
192 return hasNItems(user_begin(), user_end(), N, isUnDroppableUser); in hasNUndroppableUses()
196 return hasNItemsOrMore(user_begin(), user_end(), N, isUnDroppableUser); in hasNUndroppableUsesOrMore()
242 const_user_iterator UI = user_begin(), UE = user_end(); in isUsedInBasicBlock()
|
| /llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUPromoteKernelArguments.cpp | 88 PtrUsers.append(U->user_begin(), U->user_end()); in enqueueUsers()
|
| /llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SplitModule.cpp | 95 Worklist.append(UU->user_begin(), UU->user_end()); in addAllGlobalValueUsers()
|
| H A D | CodeExtractor.cpp | 1624 std::vector<User *> Users(inputs[i]->user_begin(), inputs[i]->user_end()); in fixupDebugInfoPostExtraction()
1975 std::vector<User *> Users(header->user_begin(), header->user_end());
2008 std::vector<User *> Users(outputs[i]->user_begin(), outputs[i]->user_end());
|
| /llvm-project/compiler-rt/lib/memprof/ |
| H A D | memprof_allocator.cpp | 471 uptr user_end = user_beg + size; in Allocate()
472 CHECK_LE(user_end, alloc_end); in Allocate()
470 uptr user_end = user_beg + size; Allocate() local
|
| /llvm-project/mlir/lib/Dialect/GPU/Transforms/ |
| H A D | AsyncRegionRewriter.cpp | 221 executeOp.getToken().user_end()); in ~DeferWaitCallback()
|
| /llvm-project/mlir/lib/IR/ |
| H A D | OperationSupport.cpp | 589 return {user_begin(), user_end()}; in use_begin()
594 ResultRange::user_iterator ResultRange::user_end() { in getUsers()
599 ResultRange::user_iterator ResultRange::user_end() { user_end() function in ResultRange
|
| /llvm-project/mlir/lib/Transforms/Utils/ |
| H A D | DialectConversion.cpp | |
| /llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | PartialInlining.cpp | 903 DuplicateFunction->user_end()); in computeCallsiteToProfCountMap()
1354 Cloner.ClonedFunc->user_end()); in tryPartialInline()
|
| /llvm-project/llvm/lib/Analysis/ |
| H A D | Loads.cpp | 772 Worklist.append(User->user_begin(), User->user_end());
|
| /llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LICM.cpp | 1644 for (Value::user_iterator UI = I.user_begin(), UE = I.user_end(); UI != UE;) { in sink()
1685 UE = I.user_end(); in sink()
1716 SmallSetVector<User*, 8> Users(I.user_begin(), I.user_end()); in sink()
|
| /llvm-project/llvm/unittests/Transforms/Vectorize/ |
| H A D | VPlanTest.cpp | 1554 DoubleValueDef.getVPValue(0)->user_end());
1561 DoubleValueDef.getVPValue(1)->user_end());
|