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

/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.cpp98 assert(SuccToSinkTo && "Candidate sink target is null");
171 BasicBlock *Candidate = (*I)->getBlock(); local
173 IsAcceptableTarget(Inst, Candidate, DT, LI))
174 SuccToSinkTo = Candidate;
H A DNaryReassociate.cpp393 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP); local
394 if (Candidate == nullptr)
398 // Candidate does not necessarily have the same pointer type as GEP. Use
401 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType());
402 assert(Candidate->getType() == GEP->getType());
404 // NewGEP = (char *)Candidate + RHS * sizeof(IndexedType)
425 // NewGEP = &Candidate[RHS * (sizeof(IndexedType) / sizeof(Candidate[0])));
434 cast<GetElementPtrInst>(Builder.CreateGEP(Candidate, RH
[all...]
H A DStraightLineStrengthReduce.cpp83 struct Candidate : public ilist_node<Candidate> { struct in class:__anon13543::StraightLineStrengthReduce
91 Candidate() function in struct:__anon13543::StraightLineStrengthReduce::Candidate
94 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, function in struct:__anon13543::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...]
H A DSeparateConstOffsetFromGEP.cpp1106 Instruction *Candidate = Candidates.back(); local
1107 if (DT->dominates(Candidate, Dominatee))
1108 return Candidate;
/external/v8/src/compiler/
H A Djs-inlining-heuristic.h38 struct Candidate { struct in class:v8::internal::compiler::final
52 bool operator()(const Candidate& left, const Candidate& right) const;
56 typedef ZoneSet<Candidate, CandidateCompare> Candidates;
60 Reduction InlineCandidate(Candidate const& candidate);
/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/Mips/MCTargetDesc/
H A DMipsELFObjectWriter.cpp183 /// Determine whether Candidate or PreviousBest is the better match.
184 /// The return value is true if Candidate is the better match.
189 static bool compareMatchingRelocs(const MipsRelocationEntry &Candidate, argument
191 if (Candidate.R.OriginalAddend != PreviousBest.R.OriginalAddend)
192 return Candidate.R.OriginalAddend < PreviousBest.R.OriginalAddend;
193 return PreviousBest.Matched && !Candidate.Matched;
/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.cpp825 for (const MachineInstr *Candidate : PotentialCandidates) {
827 const MachineInstr *Def = *UseToDefs.find(Candidate)->second.begin();
872 for (const MachineInstr *Candidate : PotentialCandidates) {
873 if (!UseToDefs.find(Candidate)->second.empty())
875 *UseToDefs.find(Candidate)->second.begin());
900 if (isCandidateLoad(Candidate)) {
905 if (!supportLoadFromLiteral(Candidate))
908 DEBUG(dbgs() << "Record AdrpLdr:\n" << *L1 << '\n' << *Candidate local
912 Args.push_back(Candidate);
915 assert((!InvolvedInLOHs || InvolvedInLOHs->insert(Candidate))
920 << "Ldr:\\n" << *L1 << '\\n' << *L2 << '\\n' << *Candidate local
954 << "Str:\\n" << *L1 << '\\n' << *L2 << '\\n' << *Candidate local
[all...]
/external/llvm/lib/Target/Mips/
H A DMipsDelaySlotFiller.cpp230 /// This function checks if it is valid to move Candidate to the delay slot
233 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
271 bool terminateSearch(const MachineInstr &Candidate) const;
866 bool Filler::delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU, argument
868 assert(!Candidate.isKill() &&
871 bool HasHazard = Candidate.isImplicitDef();
873 HasHazard |= IM.hasHazard(Candidate);
874 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands());
879 bool Filler::terminateSearch(const MachineInstr &Candidate) cons
[all...]
/external/llvm/lib/Target/ARM/
H A DARMLoadStoreOptimizer.cpp1040 MergeCandidate *Candidate = new(Allocator.Allocate()) MergeCandidate; local
1042 Candidate->Instrs.push_back(MemOps[C].MI);
1043 Candidate->LatestMIIdx = Latest - SIndex;
1044 Candidate->EarliestMIIdx = Earliest - SIndex;
1045 Candidate->InsertPos = MemOps[Latest].Position;
1048 Candidate->CanMergeToLSMulti = CanMergeToLSMulti;
1049 Candidate->CanMergeToLSDouble = CanMergeToLSDouble;
1050 Candidates.push_back(Candidate);
1811 for (const MergeCandidate *Candidate : Candidates) {
1812 if (Candidate
[all...]
/external/llvm/lib/Target/Hexagon/MCTargetDesc/
H A DHexagonMCInstrInfo.cpp744 DuplexCandidate Candidate) {
745 assert(Candidate.packetIndexI < MCB.size());
746 assert(Candidate.packetIndexJ < MCB.size());
749 deriveDuplex(Context, Candidate.iClass,
750 *MCB.getOperand(Candidate.packetIndexJ).getInst(),
751 *MCB.getOperand(Candidate.packetIndexI).getInst());
753 MCB.getOperand(Candidate.packetIndexI).setInst(Duplex);
754 MCB.erase(MCB.begin() + Candidate.packetIndexJ);
743 replaceDuplex(MCContext &Context, MCInst &MCB, DuplexCandidate Candidate) argument
/external/swiftshader/third_party/LLVM/lib/CodeGen/
H A DRegAllocLinearScan.cpp868 unsigned Candidate = Candidates[j].first; local
869 if (tri_->regsOverlap(PhysReg, Candidate)) {
883 unsigned Candidate = Candidates[j].first; local
884 if (tri_->regsOverlap(PhysReg, Candidate)) {
/external/webp/src/mux/
H A Danim_encode.c783 } Candidate; typedef in typeref:struct:__anon25872
790 Candidate* const candidate) {
851 WebPAnimEncoder* const enc, Candidate candidates[CANDIDATE_COUNT],
857 Candidate* const candidate_ll =
859 Candidate* const candidate_lossy = is_dispose_none
1011 Candidate* const candidates, int is_key_frame,
1066 Candidate candidates[CANDIDATE_COUNT];
/external/clang/lib/Sema/
H A DSemaOverload.cpp5765 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size()); local
5766 Candidate.FoundDecl = FoundDecl;
5767 Candidate.Function = Function;
5768 Candidate.Viable = true;
5769 Candidate.IsSurrogate = false;
5770 Candidate.IgnoreObjectArgument = false;
5771 Candidate.ExplicitCallArguments = Args.size();
5782 Candidate.Viable = false;
5783 Candidate.FailureKind = ovl_fail_illegal_constructor;
5795 Candidate
6144 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size() + 1); local
6270 OverloadCandidate &Candidate = CandidateSet.addCandidate(); local
6321 OverloadCandidate &Candidate = CandidateSet.addCandidate(); local
6419 OverloadCandidate &Candidate = CandidateSet.addCandidate(1); local
6571 OverloadCandidate &Candidate = CandidateSet.addCandidate(); local
6609 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size() + 1); local
6770 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size()); local
[all...]
H A DSemaDecl.cpp8657 NamedDecl *Candidate = Previous.getRepresentativeDecl(); local
8658 if (shouldLinkPossiblyHiddenDecl(Candidate, NewFD)) {
8660 OldDecl = Candidate;
/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/ ...
/external/v8/src/inspector/build/closure-compiler/
H A Dclosure-compiler.jarMETA-INF/MANIFEST.MF META-INF/ com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ...

Completed in 690 milliseconds