/freebsd-current/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | DynamicCastInfo.h | 22 : 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 D | RangedConstraintManager.h | 31 Range(const llvm::APSInt &From, const llvm::APSInt &To) : Impl(&From, &To) { argument 32 assert(From <= To); 38 return From() <= Point && Point <= To(); 41 const llvm::APSInt &To() const { return *Impl.second; } function in class:clang::ento::Range 43 return &From() == &To() ? &From() : nullptr; 48 ID.AddPointer(&To()); 166 RangeSet unite(RangeSet Original, llvm::APSInt From, llvm::APSInt To); 173 RangeSet getRangeSet(const llvm::APSInt &From, const llvm::APSInt &To) { argument 174 return getRangeSet(Range(From, To)); 314 RangeSet(Factory &F, const llvm::APSInt &From, const llvm::APSInt &To) argument [all...] |
H A D | SimpleConstraintManager.h | 47 /// Given a symbolic expression within the range [From, To], assume that it is 54 const llvm::APSInt &To, 75 const llvm::APSInt &To,
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | Casting.h | 60 // The core of the implementation of isa<X> is here; To and From should be 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_v<To, From>>> { 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, cons [all...] |
H A D | CFGUpdate.h | 34 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);
|
H A D | GenericDomTreeConstruction.h | 647 const NodePtr From, const NodePtr To) { 650 assert(To && "Cannot be a nullptr"); 652 << BlockNamePrinter(To) << "\n"); 667 const TreeNodePtr ToTN = DT.getNode(To); 669 InsertUnreachable(DT, BUI, FromTN, To); 678 const TreeNodePtr To) { 682 if (!DT.isVirtualRoot(To->getIDom())) return false; 684 if (!llvm::is_contained(DT.Roots, To->getBlock())) 685 return false; // To is not a root, nothing to update. 687 LLVM_DEBUG(dbgs() << "\t\tAfter the insertion, " << BlockNamePrinter(To) 646 InsertEdge(DomTreeT &DT, const BatchUpdatePtr BUI, const NodePtr From, const NodePtr To) argument 676 UpdateRootsBeforeInsertion(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr From, const TreeNodePtr To) argument 734 InsertReachable(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr From, const TreeNodePtr To) argument 860 InsertUnreachable(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr From, const NodePtr To) argument 910 DeleteEdge(DomTreeT &DT, const BatchUpdatePtr BUI, const NodePtr From, const NodePtr To) argument 1573 InsertEdge(DomTreeT &DT, typename DomTreeT::NodePtr From, typename DomTreeT::NodePtr To) argument 1580 DeleteEdge(DomTreeT &DT, typename DomTreeT::NodePtr From, typename DomTreeT::NodePtr To) argument [all...] |
/freebsd-current/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | PointerUnion.h | 219 /// template<typename To> 220 /// friend struct CastInfo<To, PointerUnion<PTs...>>; 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, PointerUnio [all...] |
H A D | iterator_range.h | 27 template <typename From, typename To, typename = void> 30 template <typename From, typename To> 32 From, To, 33 std::void_t<decltype(static_cast<To>(
|
/freebsd-current/contrib/llvm-project/libcxx/modules/std/ |
H A D | cinttypes.inc | 20 // abs is conditionally here, but always present in cmath.cppm. To avoid 23 // div is conditionally here, but always present in cstdlib.cppm. To avoid
|
/freebsd-current/contrib/llvm-project/libcxx/modules/std.compat/ |
H A D | cinttypes.inc | 20 // abs is conditionally here, but always present in cmath.cppm. To avoid 23 // div is conditionally here, but always present in cstdlib.cppm. To avoid
|
/freebsd-current/contrib/llvm-project/llvm/tools/llvm-mca/Views/ |
H A D | BottleneckAnalysis.cpp | 240 DGNode &To = Nodes[ToIID]; 245 if (Cost > To.Cost) { 246 To.CriticalPredecessor = DepEdge; 247 To.Cost = Cost; 248 To.Depth = N.Depth + 1; 250 To.NumVisitedPredecessors++; 251 if (To.NumVisitedPredecessors == To.NumPredecessors) 270 // To obtain the sequence of critical edges, we simply follow the chain of 421 void DependencyGraph::addDependency(unsigned From, unsigned To, [all...] |
H A D | BottleneckAnalysis.h | 219 // to guarantee that the graph stays acyclic. To this end, extra nodes are 238 void addDependency(unsigned From, unsigned To, 254 void addRegisterDep(unsigned From, unsigned To, unsigned RegID, argument 256 addDependency(From, To, {DependencyEdge::DT_REGISTER, RegID, Cost}); 259 void addMemoryDep(unsigned From, unsigned To, unsigned Cost) { argument 260 addDependency(From, To, {DependencyEdge::DT_MEMORY, /* unused */ 0, Cost}); 263 void addResourceDep(unsigned From, unsigned To, uint64_t Mask, argument 265 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-current/contrib/llvm-project/compiler-rt/lib/fuzzer/ |
H A D | FuzzerRandom.h | 37 operator()(T From, T To) { argument 38 assert(From < To); 39 auto RangeSize = static_cast<unsigned long long>(To) -
|
/freebsd-current/contrib/llvm-project/llvm/lib/MC/MCParser/ |
H A D | MCAsmParserExtension.cpp | 37 StringRef To; local 39 if (getParser().parseIdentifier(To)) 55 MCSymbol *ToSym = getContext().getOrCreateSymbol(To);
|
/freebsd-current/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | VarBypassDetector.cpp | 155 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-current/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | SimpleConstraintManager.cpp | 97 const llvm::APSInt &To, bool InRange) { 99 assert(From.isUnsigned() == To.isUnsigned() && 100 From.getBitWidth() == To.getBitWidth() && 107 return assumeSymInclusiveRange(State, Sym, From, To, InRange); 118 return assumeSymInclusiveRange(State, Sym, From, To, InRange); 124 bool IsInRange = IntVal >= From && IntVal <= To; 95 assumeInclusiveRangeInternal( ProgramStateRef State, NonLoc Value, const llvm::APSInt &From, const llvm::APSInt &To, bool InRange) argument
|
H A D | ConstraintManager.cpp | 103 const llvm::APSInt &To) { 105 return assumeInclusiveRangeInternal(State, Value, From, To, Assumption); 119 const llvm::APSInt &To, bool InBound) { 121 assumeInclusiveRangeDual(State, Value, From, To); 101 assumeInclusiveRangeDual(ProgramStateRef State, NonLoc Value, const llvm::APSInt &From, const llvm::APSInt &To) argument 117 assumeInclusiveRange(ProgramStateRef State, NonLoc Value, const llvm::APSInt &From, const llvm::APSInt &To, bool InBound) argument
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/NVPTX/ |
H A D | NVPTXProxyRegErasure.cpp | 57 MachineOperand &To); 109 MachineOperand &To) { 112 Op.setReg(To.getReg()); 107 replaceRegisterUsage(MachineInstr &Instr, MachineOperand &From, MachineOperand &To) argument
|
/freebsd-current/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaFixItUtils.cpp | 23 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-current/stand/i386/boot2/ |
H A D | sio.S | 51 sio_flush.2: ret # To caller 66 sio_putc.2: ret # To caller 74 ret # To caller 82 ret # To caller
|
/freebsd-current/contrib/llvm-project/clang/include/clang/Lex/ |
H A D | PreprocessorOptions.h | 243 void addRemappedFile(StringRef From, StringRef To) { argument 244 RemappedFiles.emplace_back(std::string(From), std::string(To)); 247 void addRemappedFile(StringRef From, llvm::MemoryBuffer *To) { argument 248 RemappedFileBuffers.emplace_back(std::string(From), To); local
|
/freebsd-current/contrib/llvm-project/compiler-rt/lib/orc/ |
H A D | extensible_rtti.h | 139 template <typename To, typename From> bool isa(const From &Value) { 140 return To::classof(&Value);
|
/freebsd-current/contrib/llvm-project/clang/include/clang/AST/ |
H A D | ASTImporterSharedState.h | 77 void setImportDeclError(Decl *To, ASTImportError Error) { argument 78 ImportErrors[To] = Error;
|
/freebsd-current/contrib/bmake/unit-tests/ |
H A D | varmod.exp | 1 make: "varmod.mk" line 101: To escape a dollar, use \$, not $$, at "$$:L} != """
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | MemorySSAUpdater.h | 87 /// Update the MemoryPhi in `To` following an edge deletion between `From` and 88 /// `To`. If `To` becomes unreachable, a call to removeBlocks should be made. 89 void removeEdge(BasicBlock *From, BasicBlock *To); 90 /// Update the MemoryPhi in `To` to have a single incoming edge from `From`, 94 const BasicBlock *To); 132 /// `From` block was spliced into `From` and `To`. There is a CFG edge from 133 /// `From` to `To`. Move all accesses from `From` to `To` starting at 134 /// instruction `Start`. `To` i [all...] |