/minix/external/bsd/llvm/dist/llvm/lib/CodeGen/ |
H A D | LatencyPriorityQueue.cpp | 122 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local 125 if (Picker(*Best, *I)) in pop() 126 Best = I; in pop() 127 SUnit *V = *Best; in pop() 128 if (Best != std::prev(Queue.end())) in pop() 129 std::swap(*Best, Queue.back()); in pop()
|
H A D | MachineTraceMetrics.cpp | 322 const MachineBasicBlock *Best = nullptr; in pickTracePred() local 334 if (!Best || Depth < BestDepth) in pickTracePred() 335 Best = Pred, BestDepth = Depth; in pickTracePred() 337 return Best; in pickTracePred() 346 const MachineBasicBlock *Best = nullptr; in pickTraceSucc() local 364 if (!Best || Height < BestHeight) in pickTraceSucc() 365 Best = Succ, BestHeight = Height; in pickTraceSucc() 367 return Best; in pickTraceSucc()
|
/minix/external/bsd/llvm/dist/clang/lib/Sema/ |
H A D | SemaOverload.cpp | 5438 DeclAccessPair::make(Best->Function, Best->FoundDecl.getAccess()); in PerformContextualImplicitConversion() 8468 Best = end(); in BestViableFunction() 8471 if (Best == end() || isBetterOverloadCandidate(S, *Cand, *Best, Loc, in BestViableFunction() 8473 Best = Cand; in BestViableFunction() 8477 if (Best == end()) in BestViableFunction() 8484 Cand != Best && in BestViableFunction() 8487 Best = end(); in BestViableFunction() 8493 if (Best->Function && in BestViableFunction() 11623 FoundDecl = Best->FoundDecl; in BuildCallToMemberFunction() 11880 if (Best == CandidateSet.end()) in BuildCallToObjectOfClassType() [all …]
|
H A D | SemaInit.cpp | 387 OverloadCandidateSet::iterator Best; in PerformEmptyInit() local 3222 OverloadCandidateSet::iterator Best; in TryConstructorInitialization() local 3633 OverloadCandidateSet::iterator Best; in TryRefInitWithConversionFunction() local 3678 ICS.Standard = Best->FinalConversion; in TryRefInitWithConversionFunction() 4253 OverloadCandidateSet::iterator Best; in TryUserDefinedConversion() local 4295 if (Best->FinalConversion.First || Best->FinalConversion.Second || in TryUserDefinedConversion() 4296 Best->FinalConversion.Third) { in TryUserDefinedConversion() 4299 ICS.Standard = Best->FinalConversion; in TryUserDefinedConversion() 5064 OverloadCandidateSet::iterator Best; in CopyObject() local 5172 OverloadCandidateSet::iterator Best; in CheckCXX98CompatAccessibleCopy() local [all …]
|
H A D | SemaTemplateInstantiate.cpp | 2366 SmallVectorImpl<MatchResult>::iterator Best = Matched.begin(); in InstantiateClassTemplateSpecialization() local 2379 for (SmallVectorImpl<MatchResult>::iterator P = Best + 1, in InstantiateClassTemplateSpecialization() 2382 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in InstantiateClassTemplateSpecialization() 2385 Best = P; in InstantiateClassTemplateSpecialization() 2394 if (P != Best && in InstantiateClassTemplateSpecialization() 2395 getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in InstantiateClassTemplateSpecialization() 2397 != Best->Partial) { in InstantiateClassTemplateSpecialization() 2423 ClassTemplatePartialSpecializationDecl *OrigPartialSpec = Best->Partial; in InstantiateClassTemplateSpecialization() 2434 ClassTemplateSpec->setInstantiationOf(Best->Partial, Best->Args); in InstantiateClassTemplateSpecialization()
|
H A D | SemaExprCXX.cpp | 1905 OverloadCandidateSet::iterator Best; in FindAllocationOverload() local 1906 switch (Candidates.BestViableFunction(*this, StartLoc, Best)) { in FindAllocationOverload() 1909 FunctionDecl *FnDecl = Best->Function; in FindAllocationOverload() 1911 Best->FoundDecl, Diagnose) == AR_inaccessible) in FindAllocationOverload() 1937 << Best->Function->isDeleted() in FindAllocationOverload() 1939 << getDeletedOrUnavailableSuffix(Best->Function) in FindAllocationOverload() 4336 OverloadCandidateSet::iterator Best; in FindConditionalOverload() local 4337 switch (CandidateSet.BestViableFunction(Self, QuestionLoc, Best)) { in FindConditionalOverload() 4342 Best->Conversions[0], Sema::AA_Converting); in FindConditionalOverload() 4353 if (Best->Function) in FindConditionalOverload() [all …]
|
H A D | SemaTemplate.cpp | 2721 SmallVector<MatchResult, 4>::iterator Best = Matched.begin(); in CheckVarTemplateId() local 2734 for (SmallVector<MatchResult, 4>::iterator P = Best + 1, in CheckVarTemplateId() 2737 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in CheckVarTemplateId() 2740 Best = P; in CheckVarTemplateId() 2748 if (P != Best && getMoreSpecializedPartialSpecialization( in CheckVarTemplateId() 2749 P->Partial, Best->Partial, in CheckVarTemplateId() 2750 PointOfInstantiation) != Best->Partial) { in CheckVarTemplateId() 2758 InstantiationPattern = Best->Partial; in CheckVarTemplateId() 2759 InstantiationArgs = Best->Args; in CheckVarTemplateId()
|
H A D | SemaTemplateDeduction.cpp | 4488 UnresolvedSetIterator Best = SpecBegin; in getMostSpecialized() local 4490 = cast<FunctionDecl>(*Best)->getPrimaryTemplate(); in getMostSpecialized() 4499 Best = I; in getMostSpecialized() 4510 if (I != Best && in getMostSpecialized() 4521 return Best; in getMostSpecialized()
|
/minix/external/bsd/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ResourcePriorityQueue.cpp | 602 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local 604 signed BestCost = SUSchedulingCost(*Best); in pop() 610 Best = I; in pop() 618 if (Picker(*Best, *I)) in pop() 619 Best = I; in pop() 622 SUnit *V = *Best; in pop() 623 if (Best != std::prev(Queue.end())) in pop() 624 std::swap(*Best, Queue.back()); in pop()
|
H A D | ScheduleDAGRRList.cpp | 465 SDNode *Best = nullptr; in FindCallSeqStart() local 472 if (!Best || (MyMaxNest > BestMaxNest)) { in FindCallSeqStart() 473 Best = New; in FindCallSeqStart() 477 assert(Best); in FindCallSeqStart() 479 return Best; in FindCallSeqStart() 1741 std::vector<SUnit *>::iterator Best = Q.begin(); in popFromQueueImpl() local 1744 if (Picker(*Best, *I)) in popFromQueueImpl() 1745 Best = I; in popFromQueueImpl() 1746 SUnit *V = *Best; in popFromQueueImpl() 1747 if (Best != std::prev(Q.end())) in popFromQueueImpl() [all …]
|
/minix/external/bsd/llvm/dist/llvm/test/tools/llvm-readobj/ARM/ |
H A D | attribute-6.s | 44 @CHECK-OBJ-NEXT: Description: Best Debugging 51 @CHECK-OBJ-NEXT: Description: Best Accuracy
|
/minix/external/bsd/llvm/dist/llvm/include/llvm/CodeGen/ |
H A D | MachineScheduler.h | 809 void setBest(SchedCandidate &Best) { in setBest() 810 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); in setBest() 811 SU = Best.SU; in setBest() 812 Reason = Best.Reason; in setBest() 813 RPDelta = Best.RPDelta; in setBest() 814 ResDelta = Best.ResDelta; in setBest()
|
/minix/external/bsd/llvm/dist/clang/lib/Basic/ |
H A D | DiagnosticIDs.cpp | 574 StringRef Best; in getNearestOption() local 593 Best = ""; in getNearestOption() 596 Best = i->getName(); in getNearestOption() 601 return Best; in getNearestOption()
|
/minix/common/dist/zlib/contrib/dotzlib/DotZLib/ |
H A D | DotZLib.cs | 74 Best = 9, enumerator
|
H A D | UnitTests.cs | 250 using (GZipStream gzOut = new GZipStream("gzstream.gz", CompressLevel.Best)) in GZipStream_WriteRead()
|
/minix/external/bsd/llvm/dist/llvm/utils/FileCheck/ |
H A D | FileCheck.cpp | 510 size_t Best = StringRef::npos; in PrintFailureInfo() local 528 if (Quality < BestQuality || Best == StringRef::npos) { in PrintFailureInfo() 529 Best = i; in PrintFailureInfo() 537 if (Best && Best != StringRef::npos && BestQuality < 50) { in PrintFailureInfo() 538 SM.PrintMessage(SMLoc::getFromPointer(Buffer.data() + Best), in PrintFailureInfo()
|
/minix/external/bsd/bind/dist/doc/misc/ |
H A D | rfc-compliance | 12 or Best Current Practice (BCP) documents.
|
/minix/external/bsd/llvm/dist/llvm/utils/TableGen/ |
H A D | FixedLenDecoderEmitter.cpp | 448 const Filter &Best) const; 1329 const Filter &Best) const { in emitSingletonTableEntry() 1330 unsigned Opc = Best.getSingletonOpc(); in emitSingletonTableEntry() 1342 Best.getVariableFC().emitTableEntries(TableInfo); in emitSingletonTableEntry() 1637 const Filter &Best = Filters[BestIndex]; in emitTableEntries() local 1638 if (Best.getNumFiltered() == 1) in emitTableEntries() 1639 emitSingletonTableEntry(TableInfo, Best); in emitTableEntries() 1641 Best.emitTableEntry(TableInfo); in emitTableEntries()
|
/minix/external/bsd/llvm/dist/clang/lib/Frontend/ |
H A D | CompilerInstance.cpp | 1497 SmallVector<StringRef, 2> Best; in loadModule() local 1508 Best.clear(); in loadModule() 1512 Best.push_back((*J)->Name); in loadModule() 1517 if (Best.size() == 1) { in loadModule() 1520 << Path[I].first << Module->getFullModuleName() << Best[0] in loadModule() 1523 Best[0]); in loadModule() 1525 Sub = Module->findSubmodule(Best[0]); in loadModule()
|
/minix/external/bsd/llvm/dist/llvm/lib/Support/ |
H A D | CommandLine.cpp | 251 Option *Best = nullptr; in LookupNearestOption() local 268 if (!Best || Distance < BestDistance) { in LookupNearestOption() 269 Best = O; in LookupNearestOption() 279 return Best; in LookupNearestOption()
|
/minix/external/bsd/llvm/dist/llvm/lib/Transforms/Scalar/ |
H A D | LoopStrengthReduce.cpp | 3980 Formula &Best = LU.Formulae[P.first->second]; in FilterOutUndesirableDedicatedRegisters() local 3987 std::swap(F, Best); in FilterOutUndesirableDedicatedRegisters() 3990 " in favor of formula "; Best.print(dbgs()); in FilterOutUndesirableDedicatedRegisters() 4219 const SCEV *Best = nullptr; in NarrowSearchSpaceByPickingWinnerRegs() local 4226 if (!Best) in NarrowSearchSpaceByPickingWinnerRegs() 4227 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs() 4231 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs() 4237 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best in NarrowSearchSpaceByPickingWinnerRegs() 4239 Taken.insert(Best); in NarrowSearchSpaceByPickingWinnerRegs() 4245 if (!LU.Regs.count(Best)) continue; in NarrowSearchSpaceByPickingWinnerRegs() [all …]
|
/minix/external/bsd/llvm/dist/llvm/docs/CommandGuide/ |
H A D | lli.rst | 216 =default: Best scheduler for the target
|
/minix/external/bsd/llvm/dist/clang/include/clang/Sema/ |
H A D | Overload.h | 779 OverloadCandidateSet::iterator& Best,
|
/minix/external/bsd/libpcap/dist/ |
H A D | README.hpux | 38 Best regards,
|
/minix/usr.bin/calendar/calendars/ |
H A D | calendar.music | 118 08/15 Beatles replace drummer Pete Best with Richard Starkey, 1962
|