/llvm-project/clang-tools-extra/clangd/index/ |
H A D | StdLib.h | 58 std::atomic<int> Best[2] = {{-1}, {-1}}; variable
|
/llvm-project/llvm/lib/CodeGen/ |
H A D | LatencyPriorityQueue.cpp | 117 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local
|
H A D | MachineTraceMetrics.cpp | 372 if (!Best || Depth < BestDepth) { in pickTraceSucc() local 348 const MachineBasicBlock *Best = nullptr; pickTracePred() local
|
/llvm-project/clang-tools-extra/clangd/ |
H A D | HeaderSourceSwitch.cpp | 110 auto Best = Candidates.begin(); in getCorrespondingHeaderOrSource() local
|
H A D | FuzzyMatch.cpp | 98 auto Best = std::max(Scores[PatN][WordN][Miss].Score, in match() local
|
/llvm-project/llvm/lib/Target/SystemZ/ |
H A D | SystemZMachineScheduler.cpp | 175 Candidate Best; in pickNode() local
|
/llvm-project/clang/lib/Tooling/ |
H A D | InterpolatingCompilationDatabase.cpp | 351 std::pair<size_t, int> Best = in chooseProxy() local 423 ScoredCandidate Best = {size_t(-1), false, 0, 0}; in pickWinner() local
|
/llvm-project/llvm/lib/Target/Mips/MCTargetDesc/ |
H A D | MipsELFObjectWriter.cpp | 113 InputIt Best = Last; find_best() local [all...] |
/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | GCNILPSched.cpp | 243 const auto *NewBestSU = pickBest(Best->SU, I->SU); in pickCandidate() local
|
H A D | SIMachineScheduler.cpp | 1573 std::vector<SIScheduleBlock*>::iterator Best; pickBlock() local 1880 SIScheduleBlockResult Best, Temp; schedule() local [all...] |
/llvm-project/clang/lib/Sema/ |
H A D | SemaInit.cpp | 611 OverloadCandidateSet::iterator Best; PerformEmptyInit() local 4221 ResolveConstructorOverload(Sema & S,SourceLocation DeclLoc,MultiExprArg Args,OverloadCandidateSet & CandidateSet,QualType DestType,DeclContext::lookup_result Ctors,OverloadCandidateSet::iterator & Best,bool CopyInitializing,bool AllowExplicit,bool OnlyListConstructors,bool IsListInit,bool RequireActualConstructor,bool SecondStepOfCopyInit=false) ResolveConstructorOverload() argument 4400 OverloadCandidateSet::iterator Best; TryConstructorInitialization() local 4980 OverloadCandidateSet::iterator Best; TryRefInitWithConversionFunction() local 5893 OverloadCandidateSet::iterator Best; TryUserDefinedConversion() local 6534 OverloadCandidateSet::iterator Best; InitializeFrom() local 6912 OverloadCandidateSet::iterator Best; CopyObject() local 7055 OverloadCandidateSet::iterator Best; CheckCXX98CompatAccessibleCopy() local 8707 OverloadCandidateSet::iterator Best; Diagnose() local 8956 OverloadCandidateSet::iterator Best; Diagnose() local 9036 OverloadCandidateSet::iterator Best; Diagnose() local 9768 OverloadCandidateSet::iterator Best; DeduceTemplateSpecializationFromInitializer() local [all...] |
H A D | SemaOverload.cpp | 3654 OverloadCandidateSet::iterator Best; IsInitializerListConstructorConversion() local 3834 OverloadCandidateSet::iterator Best; IsUserDefinedConversion() local 4987 OverloadCandidateSet::iterator Best; FindConversionForRefInit() local 6684 OverloadCandidateSet::iterator Best; PerformContextualImplicitConversion() local 10701 BestViableFunction(Sema & S,SourceLocation Loc,iterator & Best) BestViableFunction() argument 12874 auto Best = Matches.begin(); eliminiateSuboptimalOverloadCandidates() local 13615 OverloadCandidateSet::iterator Best; DiagnoseTwoPhaseLookup() local 13869 OverloadCandidateSet::iterator Best; buildOverloadedCallSet() local 13895 chooseRecoveryType(OverloadCandidateSet & CS,OverloadCandidateSet::iterator * Best) chooseRecoveryType() argument 13946 FinishOverloadedCallExpr(Sema & SemaRef,Scope * S,Expr * Fn,UnresolvedLookupExpr * ULE,SourceLocation LParenLoc,MultiExprArg Args,SourceLocation RParenLoc,Expr * ExecConfig,OverloadCandidateSet * CandidateSet,OverloadCandidateSet::iterator * Best,OverloadingResult OverloadResult,bool AllowTypoCorrection) FinishOverloadedCallExpr() argument 14080 OverloadCandidateSet::iterator Best; BuildOverloadedCallExpr() local 14265 OverloadCandidateSet::iterator Best; CreateOverloadedUnaryOp() local 14541 OverloadCandidateSet::iterator Best; CreateOverloadedBinOp() local 15098 OverloadCandidateSet::iterator Best; CreateOverloadedArraySubscriptExpr() local 15396 OverloadCandidateSet::iterator Best; BuildCallToMemberFunction() local 15667 OverloadCandidateSet::iterator Best; BuildCallToObjectOfClassType() local 15869 OverloadCandidateSet::iterator Best; BuildOverloadedArrowExpr() local 15976 OverloadCandidateSet::iterator Best; BuildLiteralOperatorCall() local 16077 OverloadCandidateSet::iterator Best; BuildForRangeBeginEndCall() local [all...] |
H A D | SemaExprCXX.cpp | 1840 UsualDeallocFnInfo Best; resolveDeallocationOverload() local 1901 auto Best = resolveDeallocationOverload( doesUsualArrayDeleteWantSize() local 2580 OverloadCandidateSet::iterator Best; resolveAllocationOverload() local 3892 OverloadCandidateSet::iterator Best; resolveBuiltinNewDeleteOverload() local 6487 OverloadCandidateSet::iterator Best; FindConditionalOverload() local [all...] |
/llvm-project/clang-tools-extra/pseudo/lib/ |
H A D | DirectiveTree.cpp |
|
/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanSLP.cpp | 265 VPValue *Best = nullptr; in getBest() local
|
/llvm-project/compiler-rt/lib/ubsan/ |
H A D | ubsan_diag.cpp | 242 Range *Best = 0; in upperBound() local
|
/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ResourcePriorityQueue.cpp | 589 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local
|
/llvm-project/bolt/lib/Passes/ |
H A D | ReorderAlgorithm.cpp | 479 int64_t Best = -1; in reorderBasicBlocks() local
|
/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonSubtarget.cpp | 656 SUnit *Best = nullptr; isBestZeroLatency() local
|
/llvm-project/clang/lib/Basic/ |
H A D | DiagnosticIDs.cpp | 720 StringRef Best; getNearestOption() local
|
/llvm-project/llvm/lib/Analysis/ |
H A D | MemoryDependenceAnalysis.cpp | 301 return Best; in getInvariantGroupPointerDependency() argument
|
/llvm-project/clang/lib/Format/ |
H A D | UnwrappedLineFormatter.cpp | 1304 reconstructPath(LineState & State,StateNode * Best) reconstructPath() argument
|
/llvm-project/clang/include/clang/Sema/ |
H A D | Overload.h | 886 bool Best : 1; global() member
|
/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | SimpleLoopUnswitch.cpp | 3412 std::optional<NonTrivialUnswitchCandidate> Best; findBestNonTrivialUnswitchCandidate() local 3498 NonTrivialUnswitchCandidate Best = findBestNonTrivialUnswitchCandidate( unswitchBestCondition() local [all...] |
H A D | LoopStrengthReduce.cpp | 4807 Formula &Best = LU.Formulae[P.first->second]; FilterOutUndesirableDedicatedRegisters() local 5085 Formula &Best = LU.Formulae[P.first->second]; NarrowSearchSpaceByFilterFormulaWithSameScaledReg() local 5302 IsSimplerBaseSCEVForTarget(const TargetTransformInfo & TTI,ScalarEvolution & SE,const SCEV * Best,const SCEV * Reg,MemAccessTy AccessType) IsSimplerBaseSCEVForTarget() argument 5338 const SCEV *Best = nullptr; NarrowSearchSpaceByPickingWinnerRegs() local [all...] |