| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | Parallel.h | 254 template <class RangeTy,
255 class Comparator = std::less<decltype(*std::begin(RangeTy()))>>
256 void parallelSort(RangeTy &&R, const Comparator &Comp = Comparator()) {
260 template <class RangeTy, class FuncTy>
261 void parallelForEach(RangeTy &&R, FuncTy Fn) { in parallelForEach()
265 template <class RangeTy, class ResultTy, class ReduceFuncTy,
267 ResultTy parallelTransformReduce(RangeTy &&R, ResultTy Init, in parallelTransformReduce()
275 template <class RangeTy, class FuncTy>
276 Error parallelForEachError(RangeTy &&R, FuncTy Fn) { in parallelForEachError()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/ |
| H A D | Attributor.h | 241 struct RangeTy { struct
245 RangeTy(int64_t Offset, int64_t Size) : Offset(Offset), Size(Size) {} in RangeTy() argument
246 RangeTy() = default;
247 static RangeTy getUnknown() { return RangeTy{Unknown, Unknown}; } in getUnknown() argument
251 return Offset == RangeTy::Unknown || Size == RangeTy::Unknown; in offsetOrSizeAreUnknown() argument
257 return Offset == RangeTy::Unknown && Size == RangeTy::Unknown; in offsetAndSizeAreUnknown() argument
262 assert((Offset == RangeTy::Unassigned) == (Size == RangeTy::Unassigned) && in isUnassigned() argument
264 return Offset == RangeTy::Unassigned; in isUnassigned()
269 bool mayOverlap(const RangeTy &Range) const { in mayOverlap() argument
279 RangeTy &operator&=(const RangeTy &R) {
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyRegStackify.cpp | 723 using RangeTy = iterator_range<mop_reverse_iterator>; typedef in __anon612323ed0211::TreeWalkerState
724 SmallVector<RangeTy, 4> Worklist;
736 RangeTy &Range = Worklist.back(); in pop()
767 const RangeTy &Range = Worklist.back(); in hasRemainingOperands()
778 for (const RangeTy &Range : Worklist) in isOnStack()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUAttributor.cpp | 665 AA::RangeTy Range(Pos, 8); in funcRetrievesMultigridSyncArg()
671 AA::RangeTy Range(Pos, 8); in funcRetrievesHostcallPtr()
677 AA::RangeTy Range(Pos, 8); in funcRetrievesDefaultQueue()
683 AA::RangeTy Range(Pos, 8); in funcRetrievesCompletionAction()
690 AA::RangeTy Range(AMDGPU::ImplicitArg::HEAP_PTR_OFFSET, 8); in funcRetrievesHeapPtr()
697 AA::RangeTy Range(AMDGPU::ImplicitArg::QUEUE_PTR_OFFSET, 8); in funcRetrievesQueuePtr()
701 bool funcRetrievesImplicitKernelArg(Attributor &A, AA::RangeTy Range) { in funcRetrievesImplicitKernelArg()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopConstrainer.cpp | 465 DT(DT), LI(LI), LPMAddNewLoop(LPMAddNewLoop), OriginalLoop(L), RangeTy(T), in LoopConstrainer()
607 if (V->getType() == RangeTy) in changeIterationSpaceEnd()
609 return IsSignedPredicate ? B.CreateSExt(V, RangeTy, "wide." + V->getName()) in changeIterationSpaceEnd()
610 : B.CreateZExt(V, RangeTy, "wide." + V->getName()); in changeIterationSpaceEnd()
734 IntegerType *IVTy = cast<IntegerType>(RangeTy); in run()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | AttributorAttributes.cpp | 756 template <> struct DenseMapInfo<AA::RangeTy> {
757 static inline AA::RangeTy getEmptyKey() { in getEmptyKey()
759 return AA::RangeTy{EmptyKey, EmptyKey}; in getEmptyKey()
762 static inline AA::RangeTy getTombstoneKey() { in getTombstoneKey()
764 return AA::RangeTy{TombstoneKey, TombstoneKey}; in getTombstoneKey()
767 static unsigned getHashValue(const AA::RangeTy &Range) { in getHashValue()
773 static bool isEqual(const AA::RangeTy &A, const AA::RangeTy B) { in isEqual()
893 bool forallInterferingAccesses(AA::RangeTy Range, F CB) const { in forallInterferingAccesses()
898 AA::RangeTy ItRange = It.getFirst(); in forallInterferingAccesses()
914 AA::RangeTy &Range) const { in forallInterferingAccesses()
[all …]
|
| H A D | Attributor.cpp | 244 const DataLayout &DL, AA::RangeTy *RangePtr) { in getInitialValueForObj()
527 AA::RangeTy Range; in getPotentialCopiesOfMemoryValue()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | SmallVector.h | 1221 template <typename RangeTy>
1222 explicit SmallVector(const iterator_range<RangeTy> &R)
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | MachineVerifier.cpp | 1283 const LLT RangeTy = LLT::scalar(i->getIntegerType()->getBitWidth()); in verifyPreISelGenericInstruction() local
1285 if (MemTy.getScalarType() != RangeTy || in verifyPreISelGenericInstruction()
|
| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | RangeConstraintManager.cpp | 1111 template <class... RangeTy> struct IntersectionTraits;
|