| /external/llvm/lib/Transforms/Scalar/ |
| D | StraightLineStrengthReduce.cpp | 83 struct Candidate : public ilist_node<Candidate> { struct in __anond0fe4eaf0111::StraightLineStrengthReduce
91 Candidate() in Candidate() argument
94 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, in Candidate() function
122 Candidate *Basis; argument
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::Kind CT, const SCEV *B,
185 void rewriteCandidateWithBasis(const Candidate &C, const Candidate &Basis);
195 static Value *emitBump(const Candidate &Basis, const Candidate &C,
[all …]
|
| D | NaryReassociate.cpp | 424 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP); in tryReassociateGEPAtIndex() local
425 if (Candidate == nullptr) in tryReassociateGEPAtIndex()
432 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType()); in tryReassociateGEPAtIndex()
433 assert(Candidate->getType() == GEP->getType()); in tryReassociateGEPAtIndex()
465 cast<GetElementPtrInst>(Builder.CreateGEP(Candidate, RHS)); in tryReassociateGEPAtIndex()
569 if (Value *Candidate = Candidates.back()) { in findClosestMatchingDominator() local
570 Instruction *CandidateInstruction = cast<Instruction>(Candidate); in findClosestMatchingDominator()
|
| D | Sink.cpp | 263 BasicBlock *Candidate = (*I)->getBlock(); in SinkInstruction() local
265 IsAcceptableTarget(Inst, Candidate)) in SinkInstruction()
266 SuccToSinkTo = Candidate; in SinkInstruction()
|
| /external/clang/lib/Analysis/ |
| D | ThreadSafetyTIL.cpp | 210 BasicBlock *Candidate = nullptr; in computeDominator() local
216 if (Candidate == nullptr) { in computeDominator()
217 Candidate = Pred; in computeDominator()
222 while (Alternate != Candidate) { in computeDominator()
223 if (Candidate->BlockID > Alternate->BlockID) in computeDominator()
224 Candidate = Candidate->DominatorNode.Parent; in computeDominator()
229 DominatorNode.Parent = Candidate; in computeDominator()
237 BasicBlock *Candidate = nullptr; in computePostDominator() local
243 if (Candidate == nullptr) { in computePostDominator()
244 Candidate = Succ; in computePostDominator()
[all …]
|
| /external/webrtc/webrtc/p2p/base/ |
| D | p2ptransportchannel.h | 52 class RemoteCandidate : public Candidate {
54 RemoteCandidate(const Candidate& c, PortInterface* origin_port) in RemoteCandidate()
55 : Candidate(c), origin_port_(origin_port) {} in RemoteCandidate()
90 void AddRemoteCandidate(const Candidate& candidate) override;
203 bool CreateConnections(const Candidate& remote_candidate,
206 const Candidate& remote_candidate,
210 uint32_t GetRemoteCandidateGeneration(const Candidate& candidate);
211 bool IsDuplicateRemoteCandidate(const Candidate& candidate);
212 void RememberRemoteCandidate(const Candidate& remote_candidate,
221 const std::vector<Candidate>& candidates);
|
| D | port.h | 196 sigslot::signal2<Port*, const Candidate&> SignalCandidateReady;
199 virtual const std::vector<Candidate>& Candidates() const { in Candidates()
294 size_t AddPrflxCandidate(const Candidate& local);
381 std::vector<Candidate> candidates_;
429 virtual const Candidate& local_candidate() const;
432 const Candidate& remote_candidate() const { return remote_candidate_; } in remote_candidate()
571 void MaybeUpdatePeerReflexiveCandidate(const Candidate& new_candidate);
581 Connection(Port* port, size_t index, const Candidate& candidate);
604 Candidate remote_candidate_;
649 ProxyConnection(Port* port, size_t index, const Candidate& remote_candidate);
|
| D | transport.h | 46 typedef std::vector<Candidate> Candidates;
114 Candidate local_candidate; // The local candidate for this connection.
115 Candidate remote_candidate; // The remote candidate for this connection.
238 bool AddRemoteCandidates(const std::vector<Candidate>& candidates,
243 virtual bool VerifyCandidate(const Candidate& candidate,
|
| D | transportchannelimpl.h | 22 class Candidate; variable
81 sigslot::signal2<TransportChannelImpl*, const Candidate&>
83 virtual void AddRemoteCandidate(const Candidate& candidate) = 0;
|
| D | candidate.h | 32 class Candidate {
36 Candidate() in Candidate() function
43 Candidate(int component, in Candidate() function
162 bool IsEquivalent(const Candidate& c) const { in IsEquivalent()
|
| D | p2ptransportchannel.cc | 475 const std::vector<Candidate>& candidates) { in OnCandidatesReady()
517 const Candidate* candidate = NULL; in OnUnknownAddress()
546 Candidate remote_candidate; in OnUnknownAddress()
575 remote_candidate = Candidate(component(), ProtoToString(proto), address, 0, in OnUnknownAddress()
673 void P2PTransportChannel::AddRemoteCandidate(const Candidate& candidate) { in AddRemoteCandidate()
685 Candidate new_remote_candidate(candidate); in AddRemoteCandidate()
717 bool P2PTransportChannel::CreateConnections(const Candidate& remote_candidate, in CreateConnections()
763 const Candidate& remote_candidate, in CreateConnection()
813 const Candidate& candidate) { in GetRemoteCandidateGeneration()
833 const Candidate& candidate) { in IsDuplicateRemoteCandidate()
[all …]
|
| D | transport.cc | 269 bool Transport::VerifyCandidate(const Candidate& cand, std::string* error) { in VerifyCandidate()
318 bool Transport::AddRemoteCandidates(const std::vector<Candidate>& candidates, in AddRemoteCandidates()
322 for (const Candidate& cand : candidates) { in AddRemoteCandidates()
333 for (const Candidate& candidate : candidates) { in AddRemoteCandidates()
|
| D | portinterface.h | 72 const Candidate& remote_candidate, CandidateOrigin origin) = 0;
79 virtual const std::vector<Candidate>& Candidates() const = 0;
|
| D | dtlstransportchannel.h | 190 void AddRemoteCandidate(const Candidate& candidate) override { in AddRemoteCandidate()
215 void OnCandidateGathered(TransportChannelImpl* channel, const Candidate& c);
217 void OnRouteChange(TransportChannel* channel, const Candidate& candidate);
|
| /external/v8/src/compiler/ |
| D | js-inlining-heuristic.h | 33 struct Candidate { struct
41 bool operator()(const Candidate& left, const Candidate& right) const; argument
45 typedef ZoneSet<Candidate, CandidateCompare> Candidates;
|
| D | js-inlining-heuristic.cc | 108 Candidate candidate = *i; in Finalize()
123 const Candidate& left, const Candidate& right) const { in operator ()()
130 for (const Candidate& candidate : candidates_) { in PrintCandidates()
|
| /external/clang/unittests/Tooling/ |
| D | TestVisitor.h | 204 : Candidate(Name, LineNumber, ColumnNumber), Found(false) {} in ExpectedMatch()
207 if (Candidate.Matches(Name, Location)) { in UpdateFor()
210 } else if (!Found && Candidate.PartiallyMatches(Name, Location)) { in UpdateFor()
219 << "Expected \"" << Candidate.ExpectedName in ExpectFound()
220 << "\" at " << Candidate.LineNumber in ExpectFound()
221 << ":" << Candidate.ColumnNumber << PartialMatches; in ExpectFound()
224 MatchCandidate Candidate; member
|
| /external/webrtc/talk/app/webrtc/ |
| D | jsepicecandidate.h | 45 const cricket::Candidate& candidate);
49 void SetCandidate(const cricket::Candidate& candidate) { in SetCandidate()
55 virtual const cricket::Candidate& candidate() const { in candidate()
64 cricket::Candidate candidate_;
|
| D | webrtcsdp_unittest.cc | 50 using cricket::Candidate;
79 typedef std::vector<Candidate> Candidates;
613 Candidate candidate1(ICE_CANDIDATE_COMPONENT_RTP, "udp", address, in WebRtcSdpTest()
617 Candidate candidate2(ICE_CANDIDATE_COMPONENT_RTCP, "udp", address, in WebRtcSdpTest()
621 Candidate candidate3(ICE_CANDIDATE_COMPONENT_RTCP, "udp", address, in WebRtcSdpTest()
625 Candidate candidate4(ICE_CANDIDATE_COMPONENT_RTP, "udp", address, in WebRtcSdpTest()
631 cricket::Candidate candidate5(cricket::ICE_CANDIDATE_COMPONENT_RTP, "udp", in WebRtcSdpTest()
636 cricket::Candidate candidate6(cricket::ICE_CANDIDATE_COMPONENT_RTCP, "udp", in WebRtcSdpTest()
641 cricket::Candidate candidate7(cricket::ICE_CANDIDATE_COMPONENT_RTCP, "udp", in WebRtcSdpTest()
646 cricket::Candidate candidate8(cricket::ICE_CANDIDATE_COMPONENT_RTP, "udp", in WebRtcSdpTest()
[all …]
|
| D | jsep.h | 41 class Candidate; variable
67 virtual const cricket::Candidate& candidate() const = 0;
|
| /external/llvm/lib/Target/AArch64/ |
| D | AArch64CollectLOH.cpp | 827 for (const MachineInstr *Candidate : PotentialCandidates) { in computeOthers() local
829 const MachineInstr *Def = *UseToDefs.find(Candidate)->second.begin(); in computeOthers()
874 for (const MachineInstr *Candidate : PotentialCandidates) { in computeOthers() local
875 if (!UseToDefs.find(Candidate)->second.empty()) in computeOthers()
877 *UseToDefs.find(Candidate)->second.begin()); in computeOthers()
902 if (isCandidateLoad(Candidate)) { in computeOthers()
907 if (!supportLoadFromLiteral(Candidate)) in computeOthers()
910 DEBUG(dbgs() << "Record AdrpLdr:\n" << *L1 << '\n' << *Candidate in computeOthers()
914 Args.push_back(Candidate); in computeOthers()
917 assert((!InvolvedInLOHs || InvolvedInLOHs->insert(Candidate)) && in computeOthers()
[all …]
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.cpp | 475 SchedCandidate &Candidate, in SchedulingCost() argument
541 SchedCandidate &Candidate) { in pickNodeFromQueue() argument
555 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false); in pickNodeFromQueue()
558 if (!Candidate.SU) { in pickNodeFromQueue()
559 Candidate.SU = *I; in pickNodeFromQueue()
560 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
561 Candidate.SCost = CurrentCost; in pickNodeFromQueue()
567 if (CurrentCost > Candidate.SCost) { in pickNodeFromQueue()
569 Candidate.SU = *I; in pickNodeFromQueue()
570 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
[all …]
|
| /external/tcpdump/tests/ |
| D | pimv2_bootstrap-v.out | 6 …Candidate RP Advertisement, cksum 0xee5e (correct) prefix-cnt=1 prio=0 holdtime=2m30s RP=3.3.3.3 G…
12 …Candidate RP Advertisement, cksum 0xee5e (correct) prefix-cnt=1 prio=0 holdtime=2m30s RP=3.3.3.3 G…
18 …Candidate RP Advertisement, cksum 0xee5e (correct) prefix-cnt=1 prio=0 holdtime=2m30s RP=3.3.3.3 G…
24 …Candidate RP Advertisement, cksum 0xee5e (correct) prefix-cnt=1 prio=0 holdtime=2m30s RP=3.3.3.3 G…
|
| /external/llvm/lib/Target/Mips/ |
| D | MipsDelaySlotFiller.cpp | 209 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
247 bool terminateSearch(const MachineInstr &Candidate) const;
870 bool Filler::delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU, in delayHasHazard() argument
872 assert(!Candidate.isKill() && in delayHasHazard()
875 bool HasHazard = Candidate.isImplicitDef(); in delayHasHazard()
877 HasHazard |= IM.hasHazard(Candidate); in delayHasHazard()
878 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands()); in delayHasHazard()
883 bool Filler::terminateSearch(const MachineInstr &Candidate) const { in terminateSearch()
884 return (Candidate.isTerminator() || Candidate.isCall() || in terminateSearch()
885 Candidate.isPosition() || Candidate.isInlineAsm() || in terminateSearch()
[all …]
|
| /external/clang/lib/Sema/ |
| D | SemaOverload.cpp | 5705 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size()); in AddOverloadCandidate() local
5706 Candidate.FoundDecl = FoundDecl; in AddOverloadCandidate()
5707 Candidate.Function = Function; in AddOverloadCandidate()
5708 Candidate.Viable = true; in AddOverloadCandidate()
5709 Candidate.IsSurrogate = false; in AddOverloadCandidate()
5710 Candidate.IgnoreObjectArgument = false; in AddOverloadCandidate()
5711 Candidate.ExplicitCallArguments = Args.size(); in AddOverloadCandidate()
5722 Candidate.Viable = false; in AddOverloadCandidate()
5723 Candidate.FailureKind = ovl_fail_illegal_constructor; in AddOverloadCandidate()
5735 Candidate.Viable = false; in AddOverloadCandidate()
[all …]
|
| D | Scope.cpp | 119 if (VarDecl *Candidate = NRVO.getPointer()) { in mergeNRVOIntoParent() local
120 if (isDeclScope(Candidate)) in mergeNRVOIntoParent()
121 Candidate->setNRVOVariable(true); in mergeNRVOIntoParent()
|