| /openbsd-src/gnu/llvm/llvm/include/llvm/Support/ |
| H A D | Casting.h | 63 template <typename To, typename From, typename Enabler = void> struct isa_impl { 64 static inline bool doit(const From &Val) { return To::classof(&Val); } 68 template <typename To, typename From> 69 struct isa_impl<To, From, std::enable_if_t<std::is_base_of<To, From>::value>> { 73 template <typename To, typename From> struct isa_impl_cl { 75 return isa_impl<To, From>::doit(Val); 79 template <typename To, typename From> struct isa_impl_cl<To, const From> { 81 return isa_impl<To, From>::doit(Val); 85 template <typename To, typename From> 86 struct isa_impl_cl<To, const std::unique_ptr<From>> { [all …]
|
| H A D | GenericDomTreeConstruction.h | 651 const NodePtr From, const NodePtr To) { in InsertEdge() 654 assert(To && "Cannot be a nullptr"); in InsertEdge() 656 << BlockNamePrinter(To) << "\n"); in InsertEdge() 671 const TreeNodePtr ToTN = DT.getNode(To); in InsertEdge() 673 InsertUnreachable(DT, BUI, FromTN, To); in InsertEdge() 682 const TreeNodePtr To) { in UpdateRootsBeforeInsertion() 686 if (!DT.isVirtualRoot(To->getIDom())) return false; in UpdateRootsBeforeInsertion() 688 if (!llvm::is_contained(DT.Roots, To->getBlock())) in UpdateRootsBeforeInsertion() 691 LLVM_DEBUG(dbgs() << "\t\tAfter the insertion, " << BlockNamePrinter(To) in UpdateRootsBeforeInsertion() 739 const TreeNodePtr From, const TreeNodePtr To) { in InsertReachable() [all …]
|
| H A D | CFGUpdate.h | 34 Update(UpdateKind Kind, NodePtr From, NodePtr To) in Update() argument 35 : From(From), ToAndKind(To, Kind) {} in Update() 76 NodePtr To = U.getTo(); 78 std::swap(From, To); // Reverse edge for postdominators. 80 Operations[{From, To}] += (U.getKind() == UpdateKind::Insert ? 1 : -1);
|
| /openbsd-src/gnu/llvm/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | DynamicCastInfo.h | 22 : From(from), To(to), ResultKind(resultKind) {} in DynamicCastInfo() 25 QualType to() const { return To; } in to() 28 return From == from && To == to; in equals() 35 return From == RHS.From && To == RHS.To; 38 return From < RHS.From && To < RHS.To; 43 ID.Add(To); in Profile() 48 QualType From, To;
|
| H A D | RangedConstraintManager.h | 31 Range(const llvm::APSInt &From, const llvm::APSInt &To) : Impl(&From, &To) { in Range() argument 32 assert(From <= To); in Range() 38 return From() <= Point && Point <= To(); in Includes() 41 const llvm::APSInt &To() const { return *Impl.second; } in To() function 43 return &From() == &To() ? &From() : nullptr; in getConcreteValue() 48 ID.AddPointer(&To()); in Profile() 166 RangeSet unite(RangeSet Original, llvm::APSInt From, llvm::APSInt To); 173 RangeSet getRangeSet(const llvm::APSInt &From, const llvm::APSInt &To) { in getRangeSet() argument 174 return getRangeSet(Range(From, To)); in getRangeSet() 314 RangeSet(Factory &F, const llvm::APSInt &From, const llvm::APSInt &To) in RangeSet() argument [all …]
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/ADT/ |
| H A D | PointerUnion.h | 229 template <typename To> static inline bool isPossible(From &F) { 230 return F.Val.getInt() == FirstIndexOfType<To, PTs...>::value; 233 template <typename To> static To doCast(From &F) { 234 assert(isPossible<To>(F) && "cast to an incompatible type !"); 235 return PointerLikeTypeTraits<To>::getFromVoidPointer(F.Val.getPointer()); 240 template <typename To, typename... PTs> 241 struct CastInfo<To, PointerUnion<PTs...>> 242 : public DefaultDoCastIfPossible<To, PointerUnion<PTs...>, 243 CastInfo<To, PointerUnion<PTs...>>> { 248 return Impl::template isPossible<To>(f); [all …]
|
| H A D | bit.h | 48 typename To, typename From, 49 typename = std::enable_if_t<sizeof(To) == sizeof(From)>, 50 typename = std::enable_if_t<std::is_trivially_constructible<To>::value>, 51 typename = std::enable_if_t<std::is_trivially_copyable<To>::value>, 53 [[nodiscard]] inline To bit_cast(const From &from) noexcept { in bit_cast() 55 return __builtin_bit_cast(To, from); in bit_cast() 57 To to; in bit_cast() 58 std::memcpy(&to, &from, sizeof(To)); in bit_cast()
|
| /openbsd-src/gnu/llvm/clang/lib/AST/Interp/ |
| H A D | InterpBlock.cpp | 47 void Block::movePointer(Pointer *From, Pointer *To) { in movePointer() argument 50 To->Prev = From->Prev; in movePointer() 51 if (To->Prev) in movePointer() 52 To->Prev->Next = To; in movePointer() 53 To->Next = From->Next; in movePointer() 54 if (To->Next) in movePointer() 55 To->Next->Prev = To; in movePointer() 57 Pointers = To; in movePointer()
|
| /openbsd-src/gnu/llvm/llvm/tools/llvm-mca/Views/ |
| H A D | BottleneckAnalysis.cpp | 240 DGNode &To = Nodes[ToIID]; in propagateThroughEdges() local 245 if (Cost > To.Cost) { in propagateThroughEdges() 246 To.CriticalPredecessor = DepEdge; in propagateThroughEdges() 247 To.Cost = Cost; in propagateThroughEdges() 248 To.Depth = N.Depth + 1; in propagateThroughEdges() 250 To.NumVisitedPredecessors++; in propagateThroughEdges() 251 if (To.NumVisitedPredecessors == To.NumPredecessors) in propagateThroughEdges() 421 void DependencyGraph::addDependency(unsigned From, unsigned To, in addDependency() argument 424 DGNode &NodeTo = Nodes[To]; in addDependency() 427 auto It = find_if(Vec, [To, Dep](DependencyEdge &DE) { in addDependency() [all …]
|
| H A D | BottleneckAnalysis.h | 238 void addDependency(unsigned From, unsigned To, 254 void addRegisterDep(unsigned From, unsigned To, unsigned RegID, in addRegisterDep() argument 256 addDependency(From, To, {DependencyEdge::DT_REGISTER, RegID, Cost}); in addRegisterDep() 259 void addMemoryDep(unsigned From, unsigned To, unsigned Cost) { in addMemoryDep() argument 260 addDependency(From, To, {DependencyEdge::DT_MEMORY, /* unused */ 0, Cost}); in addMemoryDep() 263 void addResourceDep(unsigned From, unsigned To, uint64_t Mask, in addResourceDep() argument 265 addDependency(From, To, {DependencyEdge::DT_RESOURCE, Mask, Cost}); in addResourceDep() 316 void addRegisterDep(unsigned From, unsigned To, unsigned RegID, unsigned Cy); 317 void addMemoryDep(unsigned From, unsigned To, unsigned Cy); 318 void addResourceDep(unsigned From, unsigned To, uint64_t Mask, unsigned Cy);
|
| /openbsd-src/gnu/llvm/llvm/tools/llvm-profgen/ |
| H A D | MissingFrameInferrer.cpp | 54 auto To = Item.first.second; in initialize() local 59 SampledCalls[From].insert(To); in initialize() 66 FuncRange *ToFRange = Binary->findFuncRange(To); in initialize() 68 SampledTailCalls[From].insert(To); in initialize() 130 BinaryFunction *From, BinaryFunction *To, SmallVectorImpl<uint64_t> &Path) { in computeUniqueTailCallPath() argument 135 if (From == To) in computeUniqueTailCallPath() 150 auto I = UniquePaths.find({From, To}); in computeUniqueTailCallPath() 156 auto J = NonUniquePaths.find({From, To}); in computeUniqueTailCallPath() 176 NumPaths += computeUniqueTailCallPath(TailCall, To, Path); in computeUniqueTailCallPath() 192 UniquePaths[{From, To}].assign(Path.begin() + Pos, Path.end()); in computeUniqueTailCallPath() [all …]
|
| /openbsd-src/gnu/usr.bin/perl/lib/unicore/ |
| H A D | mktables.lst | 77 To/Age.pl 78 To/Bc.pl 79 To/Bmg.pl 80 To/Bpb.pl 81 To/Bpt.pl 82 To/Cf.pl 83 To/Ea.pl 84 To/EqUIdeo.pl 85 To/GCB.pl 86 To/G [all...] |
| /openbsd-src/gnu/llvm/clang/lib/CodeGen/ |
| H A D | VarBypassDetector.cpp | 155 void VarBypassDetector::Detect(unsigned From, unsigned To) { in Detect() argument 156 while (From != To) { in Detect() 157 if (From < To) { in Detect() 158 assert(Scopes[To].first < To); in Detect() 159 const auto &ScopeTo = Scopes[To]; in Detect() 160 To = ScopeTo.first; in Detect()
|
| /openbsd-src/gnu/llvm/clang/lib/Sema/ |
| H A D | SemaFixItUtils.cpp | 23 CanQualType To, in compareTypesSimple() argument 27 if (!To.isAtLeastAsQualifiedAs(From)) in compareTypesSimple() 31 To = To.getNonReferenceType(); in compareTypesSimple() 34 if (isa<PointerType>(From) && isa<PointerType>(To)) { in compareTypesSimple() 37 To = S.Context.getCanonicalType( in compareTypesSimple() 38 (cast<PointerType>(To))->getPointeeType()); in compareTypesSimple() 42 const CanQualType ToUnq = To.getUnqualifiedType(); in compareTypesSimple() 45 To.isAtLeastAsQualifiedAs(From)) in compareTypesSimple()
|
| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | AliasAnalysisSummary.h | 154 InterfaceValue From, To; member 159 return LHS.From == RHS.From && LHS.To == RHS.To && LHS.Offset == RHS.Offset; 169 if (LHS.To < RHS.To) 171 if (LHS.To > RHS.To) 232 InstantiatedValue From, To; member
|
| H A D | AliasAnalysisSummary.cpp | 90 auto To = instantiateInterfaceValue(ERelation.To, Call); in instantiateExternalRelation() local 91 if (!To) in instantiateExternalRelation() 93 return InstantiatedRelation{*From, *To, ERelation.Offset}; in instantiateExternalRelation()
|
| /openbsd-src/gnu/llvm/libcxx/docs/Status/ |
| H A D | SpaceshipPapers.csv | 5 ….link/LWG3347>`_,"std::pair<T, U> now requires T and U to be less-than-comparable",|Nothing To Do|, 6 …s://wg21.link/LWG3350>`_,Simplify return type of lexicographical_compare_three_way,|Nothing To Do|, 7 …21.link/LWG3360>`_,three_way_comparable_with is inconsistent with similar concepts,|Nothing To Do|, 8 `LWG3380 <https://wg21.link/LWG3380>`_,common_type and comparison categories,|Nothing To Do|, 9 …tps://wg21.link/LWG3395>`_,Definition for three-way comparison needs to be updated,|Nothing To Do|,
|
| H A D | Cxx20Issues.csv | 9 …940>`__","``result_of``\ specification also needs a little cleanup","Toronto","|Nothing To Do|","" 13 "`2966 <https://wg21.link/LWG2966>`__","Incomplete resolution of US 74","Toronto","|Nothing To Do|"… 18 …te_directories do when p already exists but is not a directory?","Albuquerque","|Nothing To Do|","" 19 …rding should apply to both member and namespace-level functions","Albuquerque","|Nothing To Do|","" 20 …ent that construction of the deleter doesn't throw an exception","Albuquerque","|Nothing To Do|","" 28 …path::native_string() in filesystem_error::what() specification","Albuquerque","|Nothing To Do|","" 31 …2977>`__","unordered_meow::merge() has incorrect Throws: clause","Albuquerque","|Nothing To Do|","" 35 …1>`__","Remove redundant deduction guides from standard library","Albuquerque","|Nothing To Do|","" 39 …ction objects passed to {``forward_``,}list-specific algorithms","Albuquerque","|Nothing To Do|","" 45 …k/LWG2816>`__","``resize_file``\ has impossible postcondition","Jacksonville","|Nothing To Do|","" [all …]
|
| /openbsd-src/gnu/llvm/clang/lib/StaticAnalyzer/Core/ |
| H A D | SimpleConstraintManager.cpp | 97 const llvm::APSInt &To, bool InRange) { in assumeInclusiveRangeInternal() argument 99 assert(From.isUnsigned() == To.isUnsigned() && in assumeInclusiveRangeInternal() 100 From.getBitWidth() == To.getBitWidth() && in assumeInclusiveRangeInternal() 107 return assumeSymInclusiveRange(State, Sym, From, To, InRange); in assumeInclusiveRangeInternal() 118 return assumeSymInclusiveRange(State, Sym, From, To, InRange); in assumeInclusiveRangeInternal() 124 bool IsInRange = IntVal >= From && IntVal <= To; in assumeInclusiveRangeInternal()
|
| H A D | RangeConstraintManager.cpp | 155 llvm::APSInt To) { in unite() argument 157 Range(ValueFactory.getValue(From), ValueFactory.getValue(To))); in unite() 188 if (First->To() > Second->To()) { in unite() 248 while (First->To() >= Second->To()) { in unite() 256 Result.emplace_back(UnionStart, First->To()); in unite() 269 if (First->To() < Second->From() - One) in unite() 283 Result.emplace_back(UnionStart, Second->To()); in unite() 305 Result.emplace_back(UnionStart, First->To()); in unite() 354 return std::prev(end())->To(); in getMaxValue() 544 if (Second->From() > First->To()) { in intersect() [all …]
|
| /openbsd-src/gnu/llvm/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchDag.cpp | 65 auto To = format(ToFmt, E->getToMI(), E->getToMO()->getIdx()); in writeDOTGraph() local 67 std::swap(From, To); in writeDOTGraph() 69 OS << " " << From << " -> " << To << " [label=\"$" << E->getName(); in writeDOTGraph() 94 auto To = format(ToFmt, E->getPredicate(), E->getPredicateOp()->getIdx()); in writeDOTGraph() local 99 OS << " " << From << " -> " << To << " " << Style << "\n"; in writeDOTGraph() 103 OS << " " << From << " -> " << To << " " << Style << "\n"; in writeDOTGraph()
|
| /openbsd-src/gnu/llvm/lldb/utils/lui/ |
| H A D | Readme | 5 This directory contains the curses user interface for LLDB. To use it, ensure Python can find your … 9 Then, run the lui.py. To load a core file: 12 To create a target from an executable: 15 To attach to a running process:
|
| /openbsd-src/gnu/llvm/llvm/tools/llvm-exegesis/lib/X86/ |
| H A D | X86Counter.cpp | 78 const void *From, const void *To, in parseDataBuffer() argument 101 const uint64_t BlockEnd = To == nullptr in parseDataBuffer() 103 : reinterpret_cast<uint64_t>(To); in parseDataBuffer() 207 const void *To = reinterpret_cast<const void *>(FunctionBytes.data() + in readOrError() local 209 return doReadCounter(From, To); in readOrError() 213 X86LbrCounter::doReadCounter(const void *From, const void *To) const { in doReadCounter() 251 parseDataBuffer(DataBuf.get(), DataSize, From, To, &CycleArray); in doReadCounter()
|
| /openbsd-src/gnu/llvm/llvm/utils/TableGen/jupyter/ |
| H A D | README.md | 3 To use the kernel, first install it into jupyter: 19 # To run the example notebook in this folder. 22 # To use the kernel from the command line. 32 To run the kernel's doctests do:
|
| /openbsd-src/gnu/llvm/libcxx/include/experimental/ |
| H A D | type_traits | 59 template <class To, template<class...> class Op, class... Args> 60 using is_detected_convertible = is_convertible<detected_t<Op, Args...>, To>; 61 template <class To, template<class...> class Op, class... Args> 63 = is_detected_convertible<To, Op, Args...>::value; 145 template <class To, template<class...> class _Op, class... _Args> 146 using is_detected_convertible = is_convertible<detected_t<_Op, _Args...>, To>; 147 template <class To, template<class...> class _Op, class... _Args> 148 …_LIBCPP_CONSTEXPR bool is_detected_convertible_v = is_detected_convertible<To, _Op, _Args...>::val…
|