| /trueos/contrib/llvm/lib/CodeGen/ |
| HD | LatencyPriorityQueue.cpp | 121 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local 124 if (Picker(*Best, *I)) in pop() 125 Best = I; in pop() 126 SUnit *V = *Best; in pop() 127 if (Best != prior(Queue.end())) in pop() 128 std::swap(*Best, Queue.back()); in pop()
|
| HD | MachineTraceMetrics.cpp | 325 const MachineBasicBlock *Best = 0; in pickTracePred() local 337 if (!Best || Depth < BestDepth) in pickTracePred() 338 Best = Pred, BestDepth = Depth; in pickTracePred() 340 return Best; in pickTracePred() 349 const MachineBasicBlock *Best = 0; in pickTraceSucc() local 367 if (!Best || Height < BestHeight) in pickTraceSucc() 368 Best = Succ, BestHeight = Height; in pickTraceSucc() 370 return Best; in pickTraceSucc()
|
| HD | MachineScheduler.cpp | 1395 void setBest(SchedCandidate &Best) { in setBest() 1396 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); in setBest() 1397 SU = Best.SU; in setBest() 1398 Reason = Best.Reason; in setBest() 1399 RPDelta = Best.RPDelta; in setBest() 1400 ResDelta = Best.ResDelta; in setBest()
|
| /trueos/contrib/llvm/lib/Support/ |
| HD | TargetRegistry.cpp | 74 const Target *Best = 0, *EquallyBest = 0; in lookupTarget() local 78 if (!Best || Qual > BestQuality) { in lookupTarget() 79 Best = &*it; in lookupTarget() 87 if (!Best) { in lookupTarget() 97 Best->Name + "\" and \"" + EquallyBest->Name + "\""; in lookupTarget() 101 return Best; in lookupTarget()
|
| HD | CommandLine.cpp | 219 Option *Best = 0; in LookupNearestOption() local 235 if (!Best || Distance < BestDistance) { in LookupNearestOption() 236 Best = O; in LookupNearestOption() 246 return Best; in LookupNearestOption()
|
| /trueos/contrib/llvm/tools/clang/lib/Sema/ |
| HD | SemaOverload.cpp | 2974 OverloadCandidateSet::iterator Best; in IsInitializerListConstructorConversion() local 2975 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) { in IsInitializerListConstructorConversion() 2978 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function); in IsInitializerListConstructorConversion() 2984 User.FoundConversionFunction = Best->FoundDecl; in IsInitializerListConstructorConversion() 3163 OverloadCandidateSet::iterator Best; in IsUserDefinedConversion() local 3164 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) { in IsUserDefinedConversion() 3168 = dyn_cast<CXXConstructorDecl>(Best->Function)) { in IsUserDefinedConversion() 3180 if (Best->Conversions[0].isEllipsis()) in IsUserDefinedConversion() 3183 User.Before = Best->Conversions[0].Standard; in IsUserDefinedConversion() 3189 User.FoundConversionFunction = Best->FoundDecl; in IsUserDefinedConversion() [all …]
|
| HD | SemaInit.cpp | 3017 OverloadCandidateSet::iterator &Best, in ResolveConstructorOverload() argument 3081 return CandidateSet.BestViableFunction(S, DeclLoc, Best); in ResolveConstructorOverload() 3128 OverloadCandidateSet::iterator Best; in TryConstructorInitialization() local 3145 CandidateSet, Ctors, Best, in TryConstructorInitialization() 3162 CandidateSet, Ctors, Best, in TryConstructorInitialization() 3181 !cast<CXXConstructorDecl>(Best->Function)->isUserProvided()) { in TryConstructorInitialization() 3189 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function); in TryConstructorInitialization() 3199 Best->FoundDecl.getAccess(), in TryConstructorInitialization() 3536 OverloadCandidateSet::iterator Best; in TryRefInitWithConversionFunction() local 3538 = CandidateSet.BestViableFunction(S, DeclLoc, Best, true)) in TryRefInitWithConversionFunction() [all …]
|
| HD | SemaTemplateInstantiate.cpp | 2360 SmallVectorImpl<MatchResult>::iterator Best = Matched.begin(); in InstantiateClassTemplateSpecialization() local 2373 for (SmallVectorImpl<MatchResult>::iterator P = Best + 1, in InstantiateClassTemplateSpecialization() 2376 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in InstantiateClassTemplateSpecialization() 2379 Best = P; in InstantiateClassTemplateSpecialization() 2388 if (P != Best && in InstantiateClassTemplateSpecialization() 2389 getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in InstantiateClassTemplateSpecialization() 2391 != Best->Partial) { in InstantiateClassTemplateSpecialization() 2417 ClassTemplatePartialSpecializationDecl *OrigPartialSpec = Best->Partial; in InstantiateClassTemplateSpecialization() 2428 ClassTemplateSpec->setInstantiationOf(Best->Partial, Best->Args); in InstantiateClassTemplateSpecialization()
|
| HD | SemaExprCXX.cpp | 1842 OverloadCandidateSet::iterator Best; in FindAllocationOverload() local 1843 switch (Candidates.BestViableFunction(*this, StartLoc, Best)) { in FindAllocationOverload() 1846 FunctionDecl *FnDecl = Best->Function; in FindAllocationOverload() 1871 Best->FoundDecl, Diagnose) == AR_inaccessible) in FindAllocationOverload() 1896 << Best->Function->isDeleted() in FindAllocationOverload() 1898 << getDeletedOrUnavailableSuffix(Best->Function) in FindAllocationOverload() 4303 OverloadCandidateSet::iterator Best; in FindConditionalOverload() local 4304 switch (CandidateSet.BestViableFunction(Self, QuestionLoc, Best)) { in FindConditionalOverload() 4308 Self.PerformImplicitConversion(LHS.get(), Best->BuiltinTypes.ParamTypes[0], in FindConditionalOverload() 4309 Best->Conversions[0], Sema::AA_Converting); in FindConditionalOverload() [all …]
|
| HD | SemaTemplate.cpp | 2661 SmallVector<MatchResult, 4>::iterator Best = Matched.begin(); in CheckVarTemplateId() local 2674 for (SmallVector<MatchResult, 4>::iterator P = Best + 1, in CheckVarTemplateId() 2677 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in CheckVarTemplateId() 2680 Best = P; in CheckVarTemplateId() 2688 if (P != Best && getMoreSpecializedPartialSpecialization( in CheckVarTemplateId() 2689 P->Partial, Best->Partial, in CheckVarTemplateId() 2690 PointOfInstantiation) != Best->Partial) { in CheckVarTemplateId() 2698 InstantiationPattern = Best->Partial; in CheckVarTemplateId() 2699 InstantiationArgs = Best->Args; in CheckVarTemplateId()
|
| HD | SemaTemplateDeduction.cpp | 4506 UnresolvedSetIterator Best = SpecBegin; in getMostSpecialized() local 4508 = cast<FunctionDecl>(*Best)->getPrimaryTemplate(); in getMostSpecialized() 4517 Best = I; in getMostSpecialized() 4528 if (I != Best && in getMostSpecialized() 4539 return Best; in getMostSpecialized()
|
| HD | SemaLookup.cpp | 2600 OverloadCandidateSet::iterator Best; in LookupSpecialMember() local 2601 switch (OCS.BestViableFunction(*this, SourceLocation(), Best)) { in LookupSpecialMember() 2603 Result->setMethod(cast<CXXMethodDecl>(Best->Function)); in LookupSpecialMember() 2608 Result->setMethod(cast<CXXMethodDecl>(Best->Function)); in LookupSpecialMember()
|
| /trueos/contrib/llvm/lib/CodeGen/SelectionDAG/ |
| HD | ResourcePriorityQueue.cpp | 603 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local 605 signed BestCost = SUSchedulingCost(*Best); in pop() 611 Best = I; in pop() 619 if (Picker(*Best, *I)) in pop() 620 Best = I; in pop() 623 SUnit *V = *Best; in pop() 624 if (Best != prior(Queue.end())) in pop() 625 std::swap(*Best, Queue.back()); in pop()
|
| HD | ScheduleDAGRRList.cpp | 464 SDNode *Best = 0; in FindCallSeqStart() local 471 if (!Best || (MyMaxNest > BestMaxNest)) { in FindCallSeqStart() 472 Best = New; in FindCallSeqStart() 476 assert(Best); in FindCallSeqStart() 478 return Best; in FindCallSeqStart() 1740 std::vector<SUnit *>::iterator Best = Q.begin(); in popFromQueueImpl() local 1743 if (Picker(*Best, *I)) in popFromQueueImpl() 1744 Best = I; in popFromQueueImpl() 1745 SUnit *V = *Best; in popFromQueueImpl() 1746 if (Best != prior(Q.end())) in popFromQueueImpl() [all …]
|
| /trueos/contrib/llvm/tools/clang/lib/Basic/ |
| HD | DiagnosticIDs.cpp | 564 StringRef Best; in getNearestWarningOption() local 575 Best = ""; in getNearestWarningOption() 578 Best = i->getName(); in getNearestWarningOption() 583 return Best; in getNearestWarningOption()
|
| /trueos/contrib/llvm/tools/clang/lib/Frontend/ |
| HD | CompilerInstance.cpp | 1299 SmallVector<StringRef, 2> Best; in loadModule() local 1310 Best.clear(); in loadModule() 1314 Best.push_back((*J)->Name); in loadModule() 1319 if (Best.size() == 1) { in loadModule() 1322 << Path[I].first << Module->getFullModuleName() << Best[0] in loadModule() 1325 Best[0]); in loadModule() 1327 Sub = Module->findSubmodule(Best[0]); in loadModule()
|
| /trueos/usr.bin/at/ |
| HD | LEGAL | 14 Best regards
|
| /trueos/libexec/atrun/ |
| HD | LEGAL | 16 Best regards
|
| /trueos/contrib/llvm/utils/TableGen/ |
| HD | FixedLenDecoderEmitter.cpp | 455 const Filter &Best) const; 1366 const Filter &Best) const { in emitSingletonTableEntry() 1367 unsigned Opc = Best.getSingletonOpc(); in emitSingletonTableEntry() 1379 Best.getVariableFC().emitTableEntries(TableInfo); in emitSingletonTableEntry() 1675 const Filter &Best = Filters[BestIndex]; in emitTableEntries() local 1676 if (Best.getNumFiltered() == 1) in emitTableEntries() 1677 emitSingletonTableEntry(TableInfo, Best); in emitTableEntries() 1679 Best.emitTableEntry(TableInfo); in emitTableEntries()
|
| /trueos/contrib/dialog/po/ |
| HD | nb.po | 76 msgstr "Bestått"
|
| /trueos/contrib/llvm/lib/Transforms/Scalar/ |
| HD | LoopStrengthReduce.cpp | 3837 Formula &Best = LU.Formulae[P.first->second]; in FilterOutUndesirableDedicatedRegisters() local 3841 CostBest.RateFormula(TTI, Best, Regs, VisitedRegs, L, LU.Offsets, SE, in FilterOutUndesirableDedicatedRegisters() 3844 std::swap(F, Best); in FilterOutUndesirableDedicatedRegisters() 3847 " in favor of formula "; Best.print(dbgs()); in FilterOutUndesirableDedicatedRegisters() 4076 const SCEV *Best = 0; in NarrowSearchSpaceByPickingWinnerRegs() local 4083 if (!Best) in NarrowSearchSpaceByPickingWinnerRegs() 4084 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs() 4088 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs() 4094 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best in NarrowSearchSpaceByPickingWinnerRegs() 4096 Taken.insert(Best); in NarrowSearchSpaceByPickingWinnerRegs() [all …]
|
| /trueos/contrib/llvm/tools/clang/include/clang/Sema/ |
| HD | Overload.h | 751 OverloadCandidateSet::iterator& Best,
|
| /trueos/contrib/subversion/subversion/libsvn_fs_base/notes/ |
| HD | TODO | 104 not clear what cache policy would be effective. Best to record some
|
| /trueos/usr.sbin/bsdconfig/share/ |
| HD | keymap.subr | 185 add_keymap($3, 4, keym) # Best match
|
| /trueos/usr.bin/calendar/calendars/ |
| HD | calendar.music | 149 08/15 Beatles replace drummer Pete Best with Richard Starkey, 1962
|