| /llvm-project/llvm/lib/CodeGen/ |
| H A D | IndirectBrExpandPass.cpp | 145 if (BlockAddressUseIt == BB.use_end()) in runImpl()
148 assert(std::find_if(std::next(BlockAddressUseIt), BB.use_end(), in runImpl()
149 IsBlockAddressUse) == BB.use_end() && in runImpl()
|
| /llvm-project/mlir/include/mlir/IR/ |
| H A D | UseDefLists.h | 250 use_iterator use_end() const { return use_iterator(nullptr); } in use_end() function
253 use_range getUses() const { return {use_begin(), use_end()}; } in getUses()
271 user_iterator user_end() const { return user_iterator(use_end()); } in user_end()
|
| H A D | Value.h | 209 use_iterator use_end() const { return use_iterator(); } in use_end() function
212 use_range getUses() const { return {use_begin(), use_end()}; } in getUses()
227 user_iterator user_end() const { return use_end(); } in user_end()
|
| H A D | Operation.h | 844 use_iterator use_end() { return getResults().use_end(); }
871 user_iterator user_end() { return user_iterator(use_end()); }
839 use_iterator use_end() { return getResults().use_end(); } use_end() function
|
| H A D | ValueRange.h | 269 use_iterator use_end() const;
|
| /llvm-project/llvm/tools/verify-uselistorder/ |
| H A D | verify-uselistorder.cpp | 327 auto LU = L->use_begin(), LE = L->use_end(); in matches()
328 auto RU = R->use_begin(), RE = R->use_end(); in matches()
408 if (V->use_empty() || std::next(V->use_begin()) == V->use_end()) in shuffleValueUseLists()
427 } while (std::is_sorted(V->use_begin(), V->use_end(), compareUses)); in shuffleValueUseLists()
450 if (V->use_empty() || std::next(V->use_begin()) == V->use_end()) in reverseValueUseLists()
|
| /llvm-project/llvm/include/llvm/IR/ |
| H A D | Value.h | 368 use_iterator use_end() { return use_iterator(); } in use_end() function
369 const_use_iterator use_end() const { return const_use_iterator(); } in use_end() function
371 return make_range(materialized_use_begin(), use_end()); in materialized_uses()
374 return make_range(materialized_use_begin(), use_end()); in materialized_uses()
|
| /llvm-project/llvm/lib/Target/BPF/ |
| H A D | BPFMISimplifyPatchable.cpp | 201 auto Begin = MRI->use_begin(DstReg), End = MRI->use_end(); in processCandidate()
228 auto Begin = MRI->use_begin(DstReg), End = MRI->use_end(); in processDstReg()
|
| /llvm-project/mlir/lib/IR/ |
| H A D | OperationSupport.cpp | 580 return {use_begin(), use_end()}; in ResultRange()
585 ResultRange::use_iterator ResultRange::use_end() const { in getUses()
595 return user_iterator(use_end()); in getUsers()
608 if (use != (*it).use_end()) in UseIterator()
610 if (use == (*it).use_end()) { in operator ++()
590 ResultRange::use_iterator ResultRange::use_end() const { use_end() function in ResultRange
|
| /llvm-project/llvm/tools/llvm-reduce/deltas/ |
| H A D | ReduceInstructionsMIR.cpp | 99 auto UE = MRI->use_end(); in extractInstrFromFunction()
|
| /llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | MachineRegisterInfo.h | 477 /// use_iterator/use_begin/use_end - Walk all uses of the specified register.
483 static use_iterator use_end() { return use_iterator(nullptr); } in use_operands()
486 return make_range(use_begin(Reg), use_end());
522 bool use_empty(Register RegNo) const { return use_begin(RegNo) == use_end(); }
481 static use_iterator use_end() { return use_iterator(nullptr); } use_end() function
|
| H A D | SelectionDAGNodes.h | 743 size_t use_size() const { return std::distance(use_begin(), use_end()); }
857 static use_iterator use_end() { return use_iterator(nullptr); }
860 return make_range(use_begin(), use_end());
863 return make_range(use_begin(), use_end());
|
| /llvm-project/mlir/test/lib/IR/ |
| H A D | TestUseListOrders.cpp | 205 size_t numUses = std::distance(value.use_begin(), value.use_end()); in getRandomPermutation()
|
| /llvm-project/llvm/lib/IR/ |
| H A D | Value.cpp | 150 return hasNItems(use_begin(), use_end(), N); in hasNUses()
154 return hasNItemsOrMore(use_begin(), use_end(), N); in hasNUsesOrMore()
256 return (unsigned)std::distance(use_begin(), use_end()); in getNumUses()
|
| /llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonGenPredicate.cpp | 229 use_iterator I = MRI->use_begin(Reg.R), E = MRI->use_end(); in processPredicateGPR()
|
| H A D | HexagonBitSimplify.cpp | 387 auto Begin = MRI.use_begin(OldR), End = MRI.use_end(); in replaceReg()
403 auto Begin = MRI.use_begin(OldR), End = MRI.use_end(); in replaceRegWithSub()
420 auto Begin = MRI.use_begin(OldR), End = MRI.use_end(); in replaceSubWithSub()
1243 for (auto I = MRI.use_begin(R), E = MRI.use_end(); I != E; ++I) { in computeUsedBits()
3203 for (auto UI = MRI->use_begin(DefR), UE = MRI->use_end(); UI != UE; ++UI) { in processLoop()
|
| /llvm-project/llvm/lib/Transforms/ObjCARC/ |
| H A D | ObjCARCContract.cpp | 603 for (Value::use_iterator UI = Arg->use_begin(), UE = Arg->use_end(); in run()
|
| /llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | LegalizeTypes.cpp | |
| H A D | ScheduleDAGSDNodes.cpp | |
| /llvm-project/llvm/lib/Target/X86/ |
| H A D | X86ISelDAGToDAG.cpp | |
| /llvm-project/llvm/lib/Bitcode/Writer/ |
| H A D | ValueEnumerator.cpp | 241 if (!V->use_empty() && std::next(V->use_begin()) != V->use_end()) in predictValueUseListOrder()
|
| /llvm-project/llvm/lib/Target/DirectX/DXILWriter/ |
| H A D | DXILValueEnumerator.cpp | 284 if (!V->use_empty() && std::next(V->use_begin()) != V->use_end()) in predictValueUseListOrder()
|
| /llvm-project/clang/lib/CodeGen/ |
| H A D | CGCleanup.cpp | 619 i = entry->use_begin(), e = entry->use_end(); i != e; ) { in destroyOptimisticNormalEntry()
|
| /llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | InferAddressSpaces.cpp | 1376 for (I = V->use_begin(), E = V->use_end(); I != E;) {
|
| /llvm-project/llvm/lib/Target/Mips/ |
| H A D | MipsSEISelDAGToDAG.cpp | 102 E = MRI->use_end(); U != E;) { in replaceUsesWithZeroReg()
|