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

/external/v8/src/compiler/
H A Djs-inlining-heuristic.h33 struct Candidate { struct in class:v8::internal::compiler::final
41 bool operator()(const Candidate& left, const Candidate& right) const;
45 typedef ZoneSet<Candidate, CandidateCompare> Candidates;
/external/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp210 BasicBlock *Candidate = nullptr; local
216 if (Candidate == nullptr) {
217 Candidate = Pred;
222 while (Alternate != Candidate) {
223 if (Candidate->BlockID > Alternate->BlockID)
224 Candidate = Candidate->DominatorNode.Parent;
229 DominatorNode.Parent = Candidate;
237 BasicBlock *Candidate = nullptr; local
243 if (Candidate
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DSink.cpp191 assert(SuccToSinkTo && "Candidate sink target is null");
263 BasicBlock *Candidate = (*I)->getBlock(); local
265 IsAcceptableTarget(Inst, Candidate))
266 SuccToSinkTo = Candidate;
H A DNaryReassociate.cpp424 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP); local
425 if (Candidate == nullptr)
429 // Candidate does not necessarily have the same pointer type as GEP. Use
432 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType());
433 assert(Candidate->getType() == GEP->getType());
435 // NewGEP = (char *)Candidate + RHS * sizeof(IndexedType)
456 // NewGEP = &Candidate[RHS * (sizeof(IndexedType) / sizeof(Candidate[0])));
465 cast<GetElementPtrInst>(Builder.CreateGEP(Candidate, RH
[all...]
H A DSeparateConstOffsetFromGEP.cpp1106 Instruction *Candidate = Candidates.back(); local
1107 if (DT->dominates(Candidate, Dominatee))
1108 return Candidate;
H A DStraightLineStrengthReduce.cpp83 struct Candidate : public ilist_node<Candidate> { struct in class:__anon12567::StraightLineStrengthReduce
91 Candidate() function in struct:__anon12567::StraightLineStrengthReduce::Candidate
94 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, function in struct:__anon12567::StraightLineStrengthReduce::Candidate
122 Candidate *Basis;
150 bool isBasisFor(const Candidate &Basis, const Candidate &C);
152 bool isFoldable(const Candidate &C, TargetTransformInfo *TTI,
156 bool isSimplestForm(const Candidate &C);
181 void allocateCandidatesAndFindBasis(Candidate
[all...]
/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.cpp475 SchedCandidate &Candidate,
541 SchedCandidate &Candidate) {
555 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false);
558 if (!Candidate.SU) {
559 Candidate.SU = *I;
560 Candidate.RPDelta = RPDelta;
561 Candidate.SCost = CurrentCost;
567 if (CurrentCost > Candidate.SCost) {
569 Candidate.SU = *I;
570 Candidate
474 SchedulingCost(ReadyQueue &Q, SUnit *SU, SchedCandidate &Candidate, RegPressureDelta &Delta, bool verbose) argument
540 pickNodeFromQueue(ReadyQueue &Q, const RegPressureTracker &RPTracker, SchedCandidate &Candidate) argument
[all...]
/external/webrtc/webrtc/p2p/base/
H A Dcandidate.h30 // Candidate for ICE based connection discovery.
32 class Candidate { class in namespace:cricket
36 Candidate() function in class:cricket::Candidate
43 Candidate(int component, function in class:cricket::Candidate
162 bool IsEquivalent(const Candidate& c) const {
/external/llvm/lib/Target/AArch64/
H A DAArch64CollectLOH.cpp827 for (const MachineInstr *Candidate : PotentialCandidates) {
829 const MachineInstr *Def = *UseToDefs.find(Candidate)->second.begin();
874 for (const MachineInstr *Candidate : PotentialCandidates) {
875 if (!UseToDefs.find(Candidate)->second.empty())
877 *UseToDefs.find(Candidate)->second.begin());
902 if (isCandidateLoad(Candidate)) {
907 if (!supportLoadFromLiteral(Candidate))
910 DEBUG(dbgs() << "Record AdrpLdr:\n" << *L1 << '\n' << *Candidate local
914 Args.push_back(Candidate);
917 assert((!InvolvedInLOHs || InvolvedInLOHs->insert(Candidate))
922 << "Ldr:\\n" << *L1 << '\\n' << *L2 << '\\n' << *Candidate local
956 << "Str:\\n" << *L1 << '\\n' << *L2 << '\\n' << *Candidate local
[all...]
/external/llvm/lib/Target/Mips/
H A DMipsDelaySlotFiller.cpp206 /// This function checks if it is valid to move Candidate to the delay slot
209 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
247 bool terminateSearch(const MachineInstr &Candidate) const;
870 bool Filler::delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU, argument
872 assert(!Candidate.isKill() &&
875 bool HasHazard = Candidate.isImplicitDef();
877 HasHazard |= IM.hasHazard(Candidate);
878 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands());
883 bool Filler::terminateSearch(const MachineInstr &Candidate) cons
[all...]
/external/llvm/lib/Target/ARM/
H A DARMLoadStoreOptimizer.cpp1000 MergeCandidate *Candidate = new(Allocator.Allocate()) MergeCandidate; local
1002 Candidate->Instrs.push_back(MemOps[C].MI);
1003 Candidate->LatestMIIdx = Latest - SIndex;
1004 Candidate->EarliestMIIdx = Earliest - SIndex;
1005 Candidate->InsertPos = MemOps[Latest].Position;
1008 Candidate->CanMergeToLSMulti = CanMergeToLSMulti;
1009 Candidate->CanMergeToLSDouble = CanMergeToLSDouble;
1010 Candidates.push_back(Candidate);
1752 for (const MergeCandidate *Candidate : Candidates) {
1753 if (Candidate
[all...]
/external/llvm/lib/Target/Hexagon/MCTargetDesc/
H A DHexagonMCInstrInfo.cpp610 DuplexCandidate Candidate) {
611 assert(Candidate.packetIndexI < MCB.size());
612 assert(Candidate.packetIndexJ < MCB.size());
615 deriveDuplex(Context, Candidate.iClass,
616 *MCB.getOperand(Candidate.packetIndexJ).getInst(),
617 *MCB.getOperand(Candidate.packetIndexI).getInst());
619 MCB.getOperand(Candidate.packetIndexI).setInst(Duplex);
620 MCB.erase(MCB.begin() + Candidate.packetIndexJ);
609 replaceDuplex(MCContext &Context, MCInst &MCB, DuplexCandidate Candidate) argument
/external/clang/lib/Sema/
H A DSemaOverload.cpp5705 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size()); local
5706 Candidate.FoundDecl = FoundDecl;
5707 Candidate.Function = Function;
5708 Candidate.Viable = true;
5709 Candidate.IsSurrogate = false;
5710 Candidate.IgnoreObjectArgument = false;
5711 Candidate.ExplicitCallArguments = Args.size();
5722 Candidate.Viable = false;
5723 Candidate.FailureKind = ovl_fail_illegal_constructor;
5735 Candidate
6098 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size() + 1); local
6224 OverloadCandidate &Candidate = CandidateSet.addCandidate(); local
6275 OverloadCandidate &Candidate = CandidateSet.addCandidate(); local
6373 OverloadCandidate &Candidate = CandidateSet.addCandidate(1); local
6525 OverloadCandidate &Candidate = CandidateSet.addCandidate(); local
6563 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size() + 1); local
6724 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size()); local
[all...]
H A DSemaDecl.cpp8331 NamedDecl *Candidate = Previous.getRepresentativeDecl(); local
8332 if (shouldLinkPossiblyHiddenDecl(Candidate, NewFD)) {
8334 OldDecl = Candidate;
/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/guice/extensions/persist/lib/
H A Ddb4o-6.4.14.8131-java5.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/db4o/ com/db4o/activation/ com/db4o/cluster/ com/ ...

Completed in 573 milliseconds