Home
last modified time | relevance | path

Searched refs:To (Results 1 – 25 of 1068) sorted by relevance

12345678910>>...43

/llvm-project-15.0.7/libcxx/test/std/concepts/concepts.lang/concept.derived/
H A Dderived_from.pass.cpp28 template <typename From, typename To>
36 if constexpr (!std::same_as<To, void>) { in CheckNotDerivedFromPointer()
159 if constexpr (!std::is_array_v<To>) { in CheckNotDerivedFromPointer()
171 static_assert(!std::derived_from<To From::*, To>); in CheckNotDerivedFromPointer()
183 if constexpr (std::is_class_v<To>) { in CheckNotDerivedFromPointer()
184 static_assert(!std::derived_from<To (To::*)(), From>); in CheckNotDerivedFromPointer()
189 template <typename From, typename To>
191 if constexpr (!std::same_as<To, void>) { in CheckNotDerivedFromReference()
308 if constexpr (!std::is_array_v<To>) { in CheckNotDerivedFromReference()
319 template <typename From, typename To>
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DCasting.h79 template <typename To, typename From> struct isa_impl_cl<To, const From> {
93 template <typename To, typename From> struct isa_impl_cl<To, From *> {
100 template <typename To, typename From> struct isa_impl_cl<To, From *const> {
152 template <class To, class From> struct cast_retty_impl<To, const From> {
156 template <class To, class From> struct cast_retty_impl<To, From *> {
160 template <class To, class From> struct cast_retty_impl<To, const From *> {
303 static To castFailed() { return To(nullptr); }
336 static inline To doCast(From *f) { return To(f); }
371 static inline Optional<To> castFailed() { return Optional<To>{}; }
373 static inline Optional<To> doCast(const From &f) { return To(f); }
[all …]
H A DGenericDomTreeConstruction.h653 assert(To && "Cannot be a nullptr"); in InsertEdge()
670 const TreeNodePtr ToTN = DT.getNode(To); in InsertEdge()
746 (From->getBlock() && To->getBlock()) in InsertReachable()
766 if (NCDLevel + 1 >= To->getLevel()) in InsertReachable()
771 II.Bucket.push(To); in InsertReachable()
772 II.Visited.insert(To); in InsertReachable()
935 const TreeNodePtr ToTN = DT.getNode(To); in DeleteEdge()
1056 const TreeNodePtr TN = DT.getNode(To); in DeleteUnreachable()
1060 AffectedQueue.push_back(To); in DeleteUnreachable()
1478 return From != BB && To != BB; in verifyParentProperty()
[all …]
/llvm-project-15.0.7/libcxx/test/std/numerics/bit/bit.cast/
H A Dbit_cast.compile.pass.cpp30 template<class To, class From>
32 { std::bit_cast<To>(from) } -> std::same_as<To>;
37 struct To { char a; }; argument
39 static_assert(!bit_cast_is_valid<To, From>);
45 struct To { char a; To(To const&); }; argument
47 static_assert(!bit_cast_is_valid<To, From>);
52 struct To { char a; }; struct
54 static_assert(!bit_cast_is_valid<To, From>);
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A Dbit.h27 typename To, typename From,
28 typename = std::enable_if_t<sizeof(To) == sizeof(From)>
32 typename = std::enable_if_t<std::is_trivially_constructible<To>::value>
35 typename = std::enable_if_t<__is_trivially_constructible(To)>
42 typename = std::enable_if_t<std::is_trivially_copyable<To>::value>,
46 typename = std::enable_if_t<__is_trivially_copyable(To)>,
56 inline To bit_cast(const From &from) noexcept { in bit_cast()
57 To to; in bit_cast()
58 std::memcpy(&to, &from, sizeof(To)); in bit_cast()
H A DPointerUnion.h229 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) {
240 template <typename To, typename... PTs>
241 struct CastInfo<To, PointerUnion<PTs...>>
242 : public DefaultDoCastIfPossible<To, PointerUnion<PTs...>,
248 return Impl::template isPossible<To>(f);
251 static To doCast(From &f) { return Impl::template doCast<To>(f); }
253 static inline To castFailed() { return To(); }
256 template <typename To, typename... PTs>
[all …]
/llvm-project-15.0.7/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DDynamicCastInfo.h22 : 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 DRangedConstraintManager.h31 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()
174 return getRangeSet(Range(From, To)); in getRangeSet()
315 : RangeSet(F.getRangeSet(From, To)) {} in RangeSet()
423 const llvm::APSInt &To,
468 const llvm::APSInt &To, const llvm::APSInt &Adjustment) = 0;
[all …]
/llvm-project-15.0.7/clang/lib/AST/Interp/
H A DInterpBlock.cpp47 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()
/llvm-project-15.0.7/libc/src/__support/CPP/
H A DBit.h28 template <class To, class From> constexpr To bit_cast(const From &from) { in bit_cast()
29 static_assert(sizeof(To) == sizeof(From), "To and From must be of same size"); in bit_cast()
31 return __builtin_bit_cast(To, from); in bit_cast()
33 To to; in bit_cast()
37 __builtin_memcpy_inline(dst, src, sizeof(To)); in bit_cast()
39 for (unsigned i = 0; i < sizeof(To); ++i) in bit_cast()
/llvm-project-15.0.7/llvm/utils/unittest/googlemock/include/gmock/internal/
H A Dgmock-internal-utils.h184 template <typename To>
189 template <typename To>
200 template <typename From, typename To>
205 ((sizeof(From) < sizeof(To)) &&
208 ((sizeof(From) == sizeof(To)) &&
215 template <typename From, typename To>
225 template <typename From, typename To>
231 template <typename From, typename To>
233 kFloatingPoint, From, kFloatingPoint, To>
243 template <typename From, typename To>
[all …]
/llvm-project-15.0.7/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.cpp240 DGNode &To = Nodes[ToIID]; in propagateThroughEdges() local
245 if (Cost > To.Cost) { 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()
424 DGNode &NodeTo = Nodes[To]; in addDependency()
454 bool IsLoopCarried = From >= To; in addRegisterDep()
466 bool IsLoopCarried = From >= To; in addMemoryDep()
478 bool IsLoopCarried = From >= To; in addResourceDep()
[all …]
H A DBottleneckAnalysis.h238 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);
/llvm-project-15.0.7/libcxx/test/libcxx/utilities/function.objects/func.require/
H A Dinvoke_helpers.h143 template <class To>
145 To object;
152 To& operator*() const volatile { return const_cast<To&>(object); }
159 template <class To>
161 To object;
169 To& operator*() { return object; }
174 To& operator*() & { return object; }
178 To&& operator*() && { return static_cast<To &&>(object); }
179 To const&& operator*() const && { return static_cast<To const&&>(object); }
180 To volatile&& operator*() volatile && { return static_cast<To volatile&&>(object); }
[all …]
/llvm-project-15.0.7/llvm/unittests/IR/
H A DCFGBuilder.cpp39 << To->getName() << "\n"; in ConnectBlocks()
47 IRB.CreateSwitch(ConstantInt::get(IntTy, 0), To); in ConnectBlocks()
55 SI->addCase(IntVal, To); in ConnectBlocks()
60 << To->getName() << "\n"; in DisconnectBlocks()
71 if (SI->getDefaultDest() == To) { in DisconnectBlocks()
79 if (CIt->getCaseSuccessor() == To) { in DisconnectBlocks()
99 BasicBlock *To = getOrAddBlock(A.To); in connect() local
104 ConnectBlocks(From, To); in connect()
115 BasicBlock *To = getOrAddBlock(A.To); in disconnect() local
117 DisconnectBlocks(From, To); in disconnect()
[all …]
H A DDominatorTreeTest.cpp729 BasicBlock *To = B.getOrAddBlock(LastUpdate->Edge.To); in TEST() local
756 BasicBlock *To = B.getOrAddBlock(LastUpdate->Edge.To); in TEST() local
757 DT.insertEdge(From, To); in TEST()
783 BasicBlock *To = B.getOrAddBlock(LastUpdate->Edge.To); in TEST() local
805 BasicBlock *To = B.getOrAddBlock(LastUpdate->Edge.To); in TEST() local
834 BasicBlock *To = B.getOrAddBlock(LastUpdate->Edge.To); in TEST() local
864 BasicBlock *To = B.getOrAddBlock(LastUpdate->Edge.To); in TEST() local
891 BasicBlock *To = B.getOrAddBlock(LastUpdate->Edge.To); in TEST() local
917 BasicBlock *To = B.getOrAddBlock(LastUpdate->Edge.To); in TEST() local
946 BasicBlock *To = B.getOrAddBlock(LastUpdate->Edge.To); in TEST() local
[all …]
/llvm-project-15.0.7/bolt/include/bolt/Profile/
H A DDataAggregator.h99 Location To; member
107 uint64_t To; member
108 Trace(uint64_t From, uint64_t To) : From(From), To(To) {} in Trace()
110 return From == Other.From && To == Other.To;
116 return std::hash<uint64_t>()(L.From << 32 | L.To); in operator()
216 bool recordEntry(BinaryFunction &BF, uint64_t To, bool Mispred,
262 bool doIntraBranch(BinaryFunction &Func, uint64_t From, uint64_t To,
268 uint64_t From, uint64_t To, uint64_t Count,
272 bool doBranch(uint64_t From, uint64_t To, uint64_t Count, uint64_t Mispreds);
431 adjustAddress(LBR.To, MMI); in adjustLBR()
/llvm-project-15.0.7/bolt/lib/Profile/
H A DDataReader.cpp94 I->To.Name = this->Name; in appendFrom()
95 I->To.Offset += Offset; in appendFrom()
202 << Twine::utohexstr(From.Offset) << " " << To.IsSymbol << " " << To.Name in print()
210 if (I.From.Offset == From && I.To.Offset == To && I.From.Name == I.To.Name) in getBranch()
636 if (BI.To.IsSymbol && BI.To.Name == BI.From.Name && BI.To.Offset != 0) in convertBranchData()
689 if (From == To) in recordBranch()
713 if (To == Offset) in recordBranch()
970 Location To = Res.get(); in parseBranchInfo() local
1217 if (BI.To.IsSymbol && in parse()
1218 (!BI.From.Name.equals(BI.To.Name) || BI.To.Offset == 0)) { in parse()
[all …]
H A DDataAggregator.cpp719 To -= Func.getAddress(); in doIntraBranch()
726 To = BAT->translate(Func, To, /*IsBranchSrc=*/false); in doIntraBranch()
769 To = BAT->translate(*ToFunc, To, /*IsBranchSrc=*/false); in doInterBranch()
866 if (From > To) in recordTrace()
949 if (To > BF.getSize()) in recordEntry()
956 if (To == 0) { in recordEntry()
1483 uint64_t To = LBR.To; in parseBranchEvents() local
1485 To = 0; in parseBranchEvents()
1486 if (!From && !To) in parseBranchEvents()
1583 LBREntry Second{Loc.To, Loc.To, false}; in processBranchEvents()
[all …]
/llvm-project-15.0.7/libcxx/test/std/utilities/optional/optional.object/optional.object.ctor/
H A DU.pass.cpp46 template <class To, class From>
47 constexpr bool implicit_conversion(optional<To>&& opt, const From& v) in implicit_conversion()
49 using O = optional<To>; in implicit_conversion()
53 return opt && *opt == static_cast<To>(v); in implicit_conversion()
56 template <class To, class Input, class Expect>
59 using O = optional<To>; in explicit_conversion()
64 optional<To> opt(std::forward<Input>(in)); in explicit_conversion()
65 return opt && *opt == static_cast<To>(v); in explicit_conversion()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCFLGraph.h129 auto *ToInfo = getNode(To);
132 FromInfo->Edges.push_back(Edge{To, Offset});
220 assert(From != nullptr && To != nullptr);
224 if (To != From) {
225 addNode(To);
232 assert(From != nullptr && To != nullptr); in addDerefEdge()
241 addNode(To); in addDerefEdge()
246 Graph.addNode(InstantiatedValue{To, 1}); in addDerefEdge()
251 void addLoadEdge(Value *From, Value *To) { addDerefEdge(From, To, true); } in addLoadEdge() argument
252 void addStoreEdge(Value *From, Value *To) { addDerefEdge(From, To, false); } in addStoreEdge() argument
[all …]
H A DAliasAnalysisSummary.h154 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
/llvm-project-15.0.7/clang/lib/CodeGen/
H A DVarBypassDetector.cpp155 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()
/llvm-project-15.0.7/libcxx/test/libcxx/type_traits/
H A Dconvert_to_integral.pass.cpp35 template <class From, class To>
46 static_assert(std::is_same<decltype(ret), To>::value, ""); in check_integral_types()
55 static_assert(std::is_same<decltype(ret), To>::value, ""); in check_integral_types()
65 static_assert(std::is_same<decltype(ret), To>::value, ""); in check_integral_types()
70 template <class From, class To>
75 static_assert(std::is_same<decltype(ret), To>::value, ""); in check_enum_types()
/llvm-project-15.0.7/clang/lib/Sema/
H A DSemaFixItUtils.cpp23 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()

12345678910>>...43