Searched defs:Candidate (Results 1 - 16 of 16) sorted by relevance

/external/chromium_org/chrome/browser/chromeos/input_method/
H A Dinput_method_engine_interface.cc25 InputMethodEngineInterface::Candidate::Candidate() { function in class:chromeos::InputMethodEngineInterface::Candidate
28 InputMethodEngineInterface::Candidate::~Candidate() {
H A Dinput_method_engine_interface.h98 struct Candidate { struct in class:chromeos::InputMethodEngineInterface
99 Candidate();
100 virtual ~Candidate();
107 std::vector<Candidate> candidates;
212 const std::vector<Candidate>& candidates,
/external/llvm/lib/Transforms/Scalar/
H A DSink.cpp186 assert(SuccToSinkTo && "Candidate sink target is null");
253 BasicBlock *Candidate = (*I)->getBlock(); local
255 IsAcceptableTarget(Inst, Candidate))
256 SuccToSinkTo = Candidate;
/external/chromium_org/third_party/libjingle/source/talk/p2p/base/
H A Dcandidate.h44 // Candidate for ICE based connection discovery.
46 class Candidate { class in namespace:cricket
50 Candidate() : component_(0), priority_(0), generation_(0) {} function in class:cricket::Candidate
51 Candidate(const std::string& id, int component, const std::string& protocol, function in class:cricket::Candidate
148 bool IsEquivalent(const Candidate& c) const {
/external/clang/unittests/Tooling/
H A DTestVisitor.h204 : Candidate(Name, LineNumber, ColumnNumber), Found(false) {}
207 if (Candidate.Matches(Name, Location)) {
210 } else if (!Found && Candidate.PartiallyMatches(Name, Location)) {
219 << "Expected \"" << Candidate.ExpectedName
220 << "\" at " << Candidate.LineNumber
221 << ":" << Candidate.ColumnNumber << PartialMatches;
224 MatchCandidate Candidate; member in struct:clang::ExpectedLocationVisitor::ExpectedMatch
/external/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp470 SchedCandidate &Candidate,
536 SchedCandidate &Candidate) {
550 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false);
553 if (!Candidate.SU) {
554 Candidate.SU = *I;
555 Candidate.RPDelta = RPDelta;
556 Candidate.SCost = CurrentCost;
562 if (CurrentCost > Candidate.SCost) {
564 Candidate.SU = *I;
565 Candidate
469 SchedulingCost(ReadyQueue &Q, SUnit *SU, SchedCandidate &Candidate, RegPressureDelta &Delta, bool verbose) argument
535 pickNodeFromQueue(ReadyQueue &Q, const RegPressureTracker &RPTracker, SchedCandidate &Candidate) argument
[all...]
/external/llvm/lib/Target/AArch64/
H A DAArch64CollectLOH.cpp835 for (const MachineInstr *Candidate : PotentialCandidates) {
837 const MachineInstr *Def = *UseToDefs.find(Candidate)->second.begin();
882 for (const MachineInstr *Candidate : PotentialCandidates) {
883 if (!UseToDefs.find(Candidate)->second.empty())
885 *UseToDefs.find(Candidate)->second.begin());
909 if (isCandidateLoad(Candidate)) {
914 if (!supportLoadFromLiteral(Candidate))
917 DEBUG(dbgs() << "Record AdrpLdr:\n" << *L1 << '\n' << *Candidate local
921 Args.push_back(Candidate);
924 assert((!InvolvedInLOHs || InvolvedInLOHs->insert(Candidate))
929 << "Ldr:\\n" << *L1 << '\\n' << *L2 << '\\n' << *Candidate local
963 << "Str:\\n" << *L1 << '\\n' << *L2 << '\\n' << *Candidate local
[all...]
/external/llvm/lib/Target/Mips/
H A DMipsDelaySlotFiller.cpp199 /// This function checks if it is valid to move Candidate to the delay slot
202 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
240 bool terminateSearch(const MachineInstr &Candidate) const;
724 bool Filler::delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU, argument
726 bool HasHazard = (Candidate.isImplicitDef() || Candidate.isKill());
728 HasHazard |= IM.hasHazard(Candidate);
729 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands());
734 bool Filler::terminateSearch(const MachineInstr &Candidate) cons
[all...]
/external/smack/asmack-master/lib/
H A Djstun.jarMETA-INF/ META-INF/MANIFEST.MF de/ de/javawi/ de/javawi/jstun/ de/javawi/jstun/attribute/ ...
/external/clang/lib/Sema/
H A DSemaLookup.cpp3269 TypoCorrection &Candidate) {
3270 Candidate.setCallbackDistance(CCC.RankCandidate(Candidate));
3271 return Candidate.getEditDistance(false) != TypoCorrection::InvalidDistance;
3443 bool resolveCorrection(TypoCorrection &Candidate);
3619 bool TypoCorrectionConsumer::resolveCorrection(TypoCorrection &Candidate) { argument
3620 IdentifierInfo *Name = Candidate.getCorrectionAsIdentifierInfo();
3627 Name == Typo && !Candidate.WillReplaceSpecifier());
3635 Candidate.WillReplaceSpecifier(true);
3645 QualifiedResults.push_back(Candidate);
3268 isCandidateViable(CorrectionCandidateCallback &CCC, TypoCorrection &Candidate) argument
[all...]
H A DSemaDecl.cpp7658 NamedDecl *Candidate = Previous.getFoundDecl(); local
7659 if (shouldLinkPossiblyHiddenDecl(Candidate, NewFD)) {
7661 OldDecl = Candidate;
H A DSemaOverload.cpp5600 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size()); local
5601 Candidate.FoundDecl = FoundDecl;
5602 Candidate.Function = Function;
5603 Candidate.Viable = true;
5604 Candidate.IsSurrogate = false;
5605 Candidate.IgnoreObjectArgument = false;
5606 Candidate.ExplicitCallArguments = Args.size();
5615 Candidate.Viable = false;
5616 Candidate.FailureKind = ovl_fail_too_many_arguments;
5628 Candidate
5845 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size() + 1); local
5960 OverloadCandidate &Candidate = CandidateSet.addCandidate(); local
6010 OverloadCandidate &Candidate = CandidateSet.addCandidate(); local
6108 OverloadCandidate &Candidate = CandidateSet.addCandidate(1); local
6260 OverloadCandidate &Candidate = CandidateSet.addCandidate(); local
6298 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size() + 1); local
6459 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size()); local
[all...]
/external/chromium_org/v8/src/heap/
H A Dmark-compact.cc782 class Candidate { class
784 Candidate() : fragmentation_(0), page_(NULL) {} function in class:v8::internal::Candidate
785 Candidate(int f, Page* p) : fragmentation_(f), page_(p) {} function in class:v8::internal::Candidate
831 Candidate candidates[kMaxMaxEvacuationCandidates];
838 Candidate* least = NULL;
889 candidates[count++] = Candidate(fragmentation, p);
900 *least = Candidate(fragmentation, p);
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.help_3.5.0.v20100524.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/
H A Dcompiler.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/javascript/ com/google/javascript/jscomp/ ...
/external/chromium_org/third_party/closure_compiler/compiler/
H A Dcompiler.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ...

Completed in 457 milliseconds