Searched refs:To (Results 1 - 25 of 266) sorted by relevance

1234567891011

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A Dbit.h24 // - It requires trivially-constructible To, to avoid UB in the implementation.
25 template <typename To, typename From
26 , typename = typename std::enable_if<sizeof(To) == sizeof(From)>::type
29 , typename = typename std::is_trivially_constructible<To>::type
31 , typename = typename std::enable_if<__is_trivially_constructible(To)>::type
37 , typename = typename std::enable_if<std::is_trivially_copyable<To>::value>::type
40 , typename = typename std::enable_if<__is_trivially_copyable(To)>::type
50 inline To bit_cast(const From &from) noexcept {
51 To to;
52 std::memcpy(&to, &from, sizeof(To));
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DDynamicCastInfo.h22 : From(from), To(to), ResultKind(resultKind) {}
25 QualType to() const { return To; }
28 return From == from && To == to;
35 return From == RHS.From && To == RHS.To;
38 return From < RHS.From && To < RHS.To;
43 ID.Add(To);
48 QualType From, To; member in class:clang::ento::DynamicCastInfo
H A DConstraintManager.h123 const llvm::APSInt &To,
129 const llvm::APSInt &To) {
131 assumeInclusiveRange(State, Value, From, To, true);
139 assumeInclusiveRange(State, Value, From, To, false);
126 assumeInclusiveRangeDual(ProgramStateRef State, NonLoc Value, const llvm::APSInt &From, const llvm::APSInt &To) argument
H A DSimpleConstraintManager.h44 const llvm::APSInt &To,
57 /// Given a symbolic expression within the range [From, To], assume that it is
64 const llvm::APSInt &To,
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/Interp/
H A DBlock.cpp47 void Block::movePointer(Pointer *From, Pointer *To) { argument
50 To->Prev = From->Prev;
51 if (To->Prev)
52 To->Prev->Next = To;
53 To->Next = From->Next;
54 if (To->Next)
55 To->Next->Prev = To;
57 Pointers = To;
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DCasting.h52 // The core of the implementation of isa<X> is here; To and From should be
55 template <typename To, typename From, typename Enabler = void>
58 return To::classof(&Val);
63 template <typename To, typename From>
65 To, From, typename std::enable_if<std::is_base_of<To, From>::value>::type> {
69 template <typename To, typename From> struct isa_impl_cl {
71 return isa_impl<To, From>::doit(Val);
75 template <typename To, typename From> struct isa_impl_cl<To, cons
[all...]
H A DCFGUpdate.h34 Update(UpdateKind Kind, NodePtr From, NodePtr To) argument
35 : From(From), ToAndKind(To, Kind) {}
76 NodePtr To = U.getTo(); local
78 std::swap(From, To); // Reverse edge for postdominators.
80 Operations[{From, To}] += (U.getKind() == UpdateKind::Insert ? 1 : -1);
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerRandom.h29 intptr_t operator()(intptr_t From, intptr_t To) { argument
30 assert(From < To);
31 intptr_t RangeSize = To - From + 1;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DDomTreeUpdater.cpp28 const auto *To = Update.getTo(); local
36 successors(From), [To](const BasicBlock *B) { return B == To; });
317 void DomTreeUpdater::insertEdge(BasicBlock *From, BasicBlock *To) { argument
320 assert(isUpdateValid({DominatorTree::Insert, From, To}) &&
328 if (From == To)
333 DT->insertEdge(From, To);
335 PDT->insertEdge(From, To);
339 PendUpdates.push_back({DominatorTree::Insert, From, To});
342 void DomTreeUpdater::insertEdgeRelaxed(BasicBlock *From, BasicBlock *To) { argument
363 deleteEdge(BasicBlock *From, BasicBlock *To) argument
388 deleteEdgeRelaxed(BasicBlock *From, BasicBlock *To) argument
[all...]
H A DAliasAnalysisSummary.cpp89 auto To = instantiateInterfaceValue(ERelation.To, Call);
90 if (!To)
92 return InstantiatedRelation{*From, *To, ERelation.Offset};
H A DCFLGraph.h126 void addEdge(Node From, Node To, int64_t Offset = 0) {
129 auto *ToInfo = getNode(To);
132 FromInfo->Edges.push_back(Edge{To, Offset});
219 void addAssignEdge(Value *From, Value *To, int64_t Offset = 0) {
220 assert(From != nullptr && To != nullptr);
221 if (!From->getType()->isPointerTy() || !To->getType()->isPointerTy())
224 if (To != From) {
225 addNode(To);
226 Graph.addEdge(InstantiatedValue{From, 0}, InstantiatedValue{To, 0},
231 void addDerefEdge(Value *From, Value *To, boo
[all...]
H A DAliasAnalysisSummary.h23 /// arguments, the global values, and anything else external to the function. To
151 InterfaceValue From, To; member in struct:llvm::cflaa::ExternalRelation
156 return LHS.From == RHS.From && LHS.To == RHS.To && LHS.Offset == RHS.Offset;
166 if (LHS.To < RHS.To)
168 if (LHS.To > RHS.To)
229 InstantiatedValue From, To; member in struct:llvm::cflaa::InstantiatedRelation
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/
H A DASTImporterSharedState.h75 void setImportDeclError(Decl *To, ImportError Error) { argument
76 ImportErrors[To] = Error;
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.cpp243 DGNode &To = Nodes[ToIID];
248 if (Cost > To.Cost) {
249 To.CriticalPredecessor = DepEdge;
250 To.Cost = Cost;
251 To.Depth = N.Depth + 1;
253 To.NumVisitedPredecessors++;
254 if (To.NumVisitedPredecessors == To.NumPredecessors)
273 // To obtain the sequence of critical edges, we simply follow the chain of critical
430 void DependencyGraph::addDependency(unsigned From, unsigned To,
[all...]
H A DBottleneckAnalysis.h217 // to guarantee that the graph stays acyclic. To this end, extra nodes are
236 void addDependency(unsigned From, unsigned To,
251 void addRegisterDep(unsigned From, unsigned To, unsigned RegID, argument
253 addDependency(From, To, {DependencyEdge::DT_REGISTER, RegID, Cost});
256 void addMemoryDep(unsigned From, unsigned To, unsigned Cost) { argument
257 addDependency(From, To, {DependencyEdge::DT_MEMORY, /* unused */ 0, Cost});
260 void addResourceDep(unsigned From, unsigned To, uint64_t Mask, argument
262 addDependency(From, To, {DependencyEdge::DT_RESOURCE, Mask, Cost});
316 void addRegisterDep(unsigned From, unsigned To, unsigned RegID, unsigned Cy);
317 void addMemoryDep(unsigned From, unsigned To, unsigne
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/
H A DVarBypassDetector.cpp155 void VarBypassDetector::Detect(unsigned From, unsigned To) { argument
156 while (From != To) {
157 if (From < To) {
158 assert(Scopes[To].first < To);
159 const auto &ScopeTo = Scopes[To];
160 To = ScopeTo.first;
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DSimpleConstraintManager.cpp96 const llvm::APSInt &To, bool InRange) {
98 assert(From.isUnsigned() == To.isUnsigned() &&
99 From.getBitWidth() == To.getBitWidth() &&
106 return assumeSymInclusiveRange(State, Sym, From, To, InRange);
117 return assumeSymInclusiveRange(State, Sym, From, To, InRange);
123 bool IsInRange = IntVal >= From && IntVal <= To;
94 assumeInclusiveRange( ProgramStateRef State, NonLoc Value, const llvm::APSInt &From, const llvm::APSInt &To, bool InRange) argument
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DMemorySSAUpdater.h103 /// Update the MemoryPhi in `To` following an edge deletion between `From` and
104 /// `To`. If `To` becomes unreachable, a call to removeBlocks should be made.
105 void removeEdge(BasicBlock *From, BasicBlock *To);
106 /// Update the MemoryPhi in `To` to have a single incoming edge from `From`,
110 const BasicBlock *To);
145 /// `From` block was spliced into `From` and `To`. There is a CFG edge from
146 /// `From` to `To`. Move all accesses from `From` to `To` starting at
147 /// instruction `Start`. `To` i
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/
H A DGIMatchDag.cpp65 auto To = format(ToFmt, E->getToMI(), E->getToMO()->getIdx()); local
67 std::swap(From, To);
69 OS << " " << From << " -> " << To << " [label=\"$" << E->getName();
94 auto To = format(ToFmt, E->getPredicate(), E->getPredicateOp()->getIdx()); local
99 OS << " " << From << " -> " << To << " " << Style << "\n";
103 OS << " " << From << " -> " << To << " " << Style << "\n";
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXProxyRegErasure.cpp57 MachineOperand &To);
111 MachineOperand &To) {
114 Op.setReg(To.getReg());
109 replaceRegisterUsage(MachineInstr &Instr, MachineOperand &From, MachineOperand &To) argument
/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/
H A DSemaFixItUtils.cpp23 CanQualType To,
27 if (!To.isAtLeastAsQualifiedAs(From))
31 To = To.getNonReferenceType();
34 if (isa<PointerType>(From) && isa<PointerType>(To)) {
37 To = S.Context.getCanonicalType(
38 (cast<PointerType>(To))->getPointeeType());
42 const CanQualType ToUnq = To.getUnqualifiedType();
45 To.isAtLeastAsQualifiedAs(From))
22 compareTypesSimple(CanQualType From, CanQualType To, Sema &S, SourceLocation Loc, ExprValueKind FromVK) argument
/freebsd-11-stable/contrib/libstdc++/include/backward/
H A Dbackward_warning.h36 <iostream.h>. To disable this warning use -Wno-deprecated.
/freebsd-11-stable/stand/i386/boot2/
H A Dsio.S53 sio_flush.2: ret # To caller
68 sio_putc.2: ret # To caller
76 ret # To caller
84 ret # To caller
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Demangle/
H A DStringView.h54 StringView substr(size_t From, size_t To) const {
55 if (To >= size())
56 To = size() - 1;
59 return StringView(First + From, First + To);
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Lex/
H A DPreprocessorOptions.h201 void addRemappedFile(StringRef From, StringRef To) { argument
202 RemappedFiles.emplace_back(From, To);
205 void addRemappedFile(StringRef From, llvm::MemoryBuffer *To) { argument
206 RemappedFileBuffers.emplace_back(From, To);

Completed in 318 milliseconds

1234567891011