/freebsd-12-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | DynamicCastInfo.h | 22 : From(from), To(to), ResultKind(resultKind) {} 24 QualType from() const { return From; } 28 return From == from && To == to; 35 return From == RHS.From && To == RHS.To; 38 return From < RHS.From && To < RHS.To; 42 ID.Add(From); 48 QualType From, To; member in class:clang::ento::DynamicCastInfo
|
H A D | ConstraintManager.h | 122 const llvm::APSInt &From, 128 const llvm::APSInt &From, 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
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | Casting.h | 33 template<typename From> struct simplify_type { 34 using SimpleType = From; // The real type this represents... 37 static SimpleType &getSimplifiedValue(From &Val) { return Val; } 40 template<typename From> struct simplify_type<const From> { 41 using NonConstSimpleType = typename simplify_type<From>::SimpleType; 47 static RetType getSimplifiedValue(const From& Val) { 48 return simplify_type<From>::getSimplifiedValue(const_cast<From&>(Val)); 52 // The core of the implementation of isa<X> is here; To and From shoul [all...] |
H A D | CFGUpdate.h | 30 NodePtr From; 34 Update(UpdateKind Kind, NodePtr From, NodePtr To) argument 35 : From(From), ToAndKind(To, Kind) {} 38 NodePtr getFrom() const { return From; } 41 return From == RHS.From && ToAndKind == RHS.ToAndKind; 75 NodePtr From = U.getFrom(); local 78 std::swap(From, To); // Reverse edge for postdominators. 80 Operations[{From, T [all...] |
/freebsd-12-stable/contrib/llvm-project/compiler-rt/lib/fuzzer/ |
H A D | FuzzerRandom.h | 29 intptr_t operator()(intptr_t From, intptr_t To) { argument 30 assert(From < To); 31 intptr_t RangeSize = To - From + 1; 32 return operator()(RangeSize) + From;
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Demangle/ |
H A D | StringView.h | 39 StringView substr(size_t From) const { 40 return StringView(begin() + From, size() - From); 43 size_t find(char C, size_t From = 0) const { 44 size_t FindBegin = std::min(From, size()); 54 StringView substr(size_t From, size_t To) const { argument 57 if (From >= size()) 58 From = size() - 1; 59 return StringView(First + From, First + To);
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | bit.h | 25 template <typename To, typename From 26 , typename = typename std::enable_if<sizeof(To) == sizeof(From)>::type 38 , typename = typename std::enable_if<std::is_trivially_copyable<From>::value>::type 41 , typename = typename std::enable_if<__is_trivially_copyable(From)>::type 50 inline To bit_cast(const From &from) noexcept {
|
H A D | SmallString.h | 146 size_t find(char C, size_t From = 0) const { 147 return str().find(C, From); 154 size_t find(StringRef Str, size_t From = 0) const { 155 return str().find(Str, From); 162 size_t rfind(char C, size_t From = StringRef::npos) const { 163 return str().rfind(C, From); 176 size_t find_first_of(char C, size_t From = 0) const { 177 return str().find_first_of(C, From); 184 size_t find_first_of(StringRef Chars, size_t From = 0) const { 185 return str().find_first_of(Chars, From); [all...] |
H A D | StringRef.h | 306 size_t find(char C, size_t From = 0) const { 307 size_t FindBegin = std::min(From, Length); 321 size_t find_lower(char C, size_t From = 0) const; 326 /// \p From, or npos if not found. 328 size_t find_if(function_ref<bool(char)> F, size_t From = 0) const { 329 StringRef S = drop_front(From); 341 /// from \p From, or npos if not found. 343 size_t find_if_not(function_ref<bool(char)> F, size_t From = 0) const { 344 return find_if([F](char c) { return !F(c); }, From); 352 size_t find(StringRef Str, size_t From [all...] |
/freebsd-12-stable/contrib/llvm-project/clang/lib/AST/Interp/ |
H A D | Block.cpp | 47 void Block::movePointer(Pointer *From, Pointer *To) { argument 50 To->Prev = From->Prev; 53 To->Next = From->Next; 56 if (Pointers == From) 59 From->Prev = nullptr; 60 From->Next = nullptr;
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DomTreeUpdater.cpp | 27 const auto *From = Update.getFrom(); local 31 // Discard updates by inspecting the current state of successors of From. 32 // Since isUpdateValid() must be called *after* the Terminator of From is 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, T 342 insertEdgeRelaxed(BasicBlock *From, BasicBlock *To) argument 363 deleteEdge(BasicBlock *From, BasicBlock *To) argument 388 deleteEdgeRelaxed(BasicBlock *From, BasicBlock *To) argument [all...] |
H A D | AliasAnalysisSummary.cpp | 86 auto From = instantiateInterfaceValue(ERelation.From, Call); local 87 if (!From) 92 return InstantiatedRelation{*From, *To, ERelation.Offset};
|
H A D | CFLGraph.h | 126 void addEdge(Node From, Node To, int64_t Offset = 0) { 127 auto *FromInfo = getNode(From); 133 ToInfo->ReverseEdges.push_back(Edge{From, 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()) 223 addNode(From); 224 if (To != From) { 226 Graph.addEdge(InstantiatedValue{From, 0}, InstantiatedValue{To, 0}, 231 void addDerefEdge(Value *From, Valu [all...] |
/freebsd-12-stable/contrib/googletest/googlemock/include/gmock/internal/ |
H A D | gmock-internal-utils.h | 192 // LosslessArithmeticConvertibleImpl<kFromKind, From, kToKind, To>::value 193 // is true iff arithmetic type From can be losslessly converted to 196 // It's the user's responsibility to ensure that both From and To are 199 // From, and kToKind is the kind of To; the value is 201 template <TypeKind kFromKind, typename From, TypeKind kToKind, typename To> 220 template <typename From> 221 struct LosslessArithmeticConvertibleImpl<kInteger, From, kBool, bool> 226 template <typename From, typename To> 227 struct LosslessArithmeticConvertibleImpl<kInteger, From, kInteger, To> 231 ((sizeof(From) < sizeo [all...] |
/freebsd-12-stable/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) { 163 assert(Scopes[From].first < From); 164 From = Scopes[From].first;
|
/freebsd-12-stable/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/ |
H A D | GIMatchDag.cpp | 64 auto From = format(FromFmt, E->getFromMI(), E->getFromMO()->getIdx()); local 67 std::swap(From, To); 69 OS << " " << From << " -> " << To << " [label=\"$" << E->getName(); 97 auto From = local 99 OS << " " << From << " -> " << To << " " << Style << "\n"; 102 auto From = format(FromMIFmt, E->getRequiredMI()); local 103 OS << " " << From << " -> " << To << " " << Style << "\n";
|
/freebsd-12-stable/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
H A D | quarantine.h | 42 bool canMerge(const QuarantineBatch *const From) const { 43 return Count + From->Count <= MaxCount; 46 void merge(QuarantineBatch *const From) { argument 47 DCHECK_LE(Count + From->Count, MaxCount); 50 for (uptr I = 0; I < From->Count; ++I) 51 Batch[Count + I] = From->Batch[I]; 52 Count += From->Count; 53 Size += From->getQuarantinedSize(); 55 From->Count = 0; 56 From 91 transfer(QuarantineCache *From) argument [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Support/ |
H A D | StringRef.cpp | 58 size_t StringRef::find_lower(char C, size_t From) const { 60 return find_if([L](char D) { return toLower(D) == L; }, From); 133 size_t StringRef::find(StringRef Str, size_t From) const { 134 if (From > Length) 137 const char *Start = Data + From; 138 size_t Size = Length - From; 143 return From; 182 size_t StringRef::find_lower(StringRef Str, size_t From) const { 183 StringRef This = substr(From); 186 return From; [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/tools/llvm-mca/Views/ |
H A D | BottleneckAnalysis.h | 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, unsigned Cy); 318 void addResourceDep(unsigned From, unsigne [all...] |
H A D | BottleneckAnalysis.cpp | 430 void DependencyGraph::addDependency(unsigned From, unsigned To, 432 DGNode &NodeFrom = Nodes[From]; 446 DependencyEdge DE = {Dep, From, To, 1}; 461 void BottleneckAnalysis::addRegisterDep(unsigned From, unsigned To, 463 bool IsLoopCarried = From >= To; 466 DG.addRegisterDep(From, To + SourceSize, RegID, Cost); 467 DG.addRegisterDep(From + SourceSize, To + (SourceSize * 2), RegID, Cost); 470 DG.addRegisterDep(From + SourceSize, To + SourceSize, RegID, Cost); 473 void BottleneckAnalysis::addMemoryDep(unsigned From, unsigned To, 475 bool IsLoopCarried = From > [all...] |
/freebsd-12-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | SimpleConstraintManager.cpp | 95 ProgramStateRef State, NonLoc Value, const llvm::APSInt &From, 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-12-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/ |
H A D | NVPTXImageOptimizer.cpp | 43 void replaceWith(Instruction *From, ConstantInt *To); 147 void NVPTXImageOptimizer::replaceWith(Instruction *From, ConstantInt *To) { argument 151 for (CallInst::use_iterator UI = From->use_begin(), UE = From->use_end(); 166 From->replaceAllUsesWith(To); 167 InstrToDelete.push_back(From);
|
H A D | NVPTXProxyRegErasure.cpp | 56 void replaceRegisterUsage(MachineInstr &Instr, MachineOperand &From, 110 MachineOperand &From, 113 if (Op.isReg() && Op.getReg() == From.getReg()) { 109 replaceRegisterUsage(MachineInstr &Instr, MachineOperand &From, MachineOperand &To) argument
|
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/Lex/ |
H A D | PreprocessorOptions.h | 201 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);
|
/freebsd-12-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaFixItUtils.cpp | 22 bool ConversionFixItGenerator::compareTypesSimple(CanQualType From, argument 27 if (!To.isAtLeastAsQualifiedAs(From)) 30 From = From.getNonReferenceType(); 34 if (isa<PointerType>(From) && isa<PointerType>(To)) { 35 From = S.Context.getCanonicalType( 36 (cast<PointerType>(From))->getPointeeType()); 41 const CanQualType FromUnq = From.getUnqualifiedType(); 45 To.isAtLeastAsQualifiedAs(From))
|