| /external/webrtc/api/ |
| D | candidate.cc | 19 Candidate::Candidate() in Candidate() function in cricket::Candidate
28 Candidate::Candidate(int component, in Candidate() function in cricket::Candidate
53 Candidate::Candidate(const Candidate&) = default;
55 Candidate::~Candidate() = default;
57 bool Candidate::IsEquivalent(const Candidate& c) const { in IsEquivalent()
69 bool Candidate::MatchesForRemoval(const Candidate& c) const { in MatchesForRemoval()
74 std::string Candidate::ToStringInternal(bool sensitive) const { in ToStringInternal()
86 uint32_t Candidate::GetPriority(uint32_t type_preference, in GetPriority()
112 bool Candidate::operator==(const Candidate& o) const { in operator ==()
124 bool Candidate::operator!=(const Candidate& o) const { in operator !=()
[all …]
|
| D | candidate.h | 30 class RTC_EXPORT Candidate {
32 Candidate();
35 Candidate(int component,
46 Candidate(const Candidate&);
47 ~Candidate();
152 bool IsEquivalent(const Candidate& c) const;
156 bool MatchesForRemoval(const Candidate& c) const;
166 bool operator==(const Candidate& o) const;
167 bool operator!=(const Candidate& o) const;
176 Candidate ToSanitizedCopy(bool use_hostname_address,
|
| D | jsep_ice_candidate.h | 36 const cricket::Candidate& candidate);
40 void SetCandidate(const cricket::Candidate& candidate) { in SetCandidate()
46 const cricket::Candidate& candidate() const override;
55 cricket::Candidate candidate_;
77 size_t remove(const cricket::Candidate& candidate);
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | StraightLineStrengthReduce.cpp | 83 struct Candidate : public ilist_node<Candidate> { struct in __anon6b7588d10111::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 …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | StraightLineStrengthReduce.cpp | 102 struct Candidate { struct in __anon11c94eb30111::StraightLineStrengthReduce
110 Candidate() = default;
111 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, in Candidate() function
144 Candidate *Basis = nullptr; argument
171 bool isBasisFor(const Candidate &Basis, const Candidate &C);
174 bool isFoldable(const Candidate &C, TargetTransformInfo *TTI,
179 bool isSimplestForm(const Candidate &C);
211 void allocateCandidatesAndFindBasis(Candidate::Kind CT, const SCEV *B,
216 void rewriteCandidateWithBasis(const Candidate &C, const Candidate &Basis);
228 static Value *emitBump(const Candidate &Basis, const Candidate &C,
[all …]
|
| /external/llvm-project/llvm/lib/Transforms/Scalar/ |
| D | StraightLineStrengthReduce.cpp | 134 struct Candidate { struct in __anon11657d3f0111::StraightLineStrengthReduce
142 Candidate() = default;
143 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, in Candidate() function
176 Candidate *Basis = nullptr; argument
184 bool isBasisFor(const Candidate &Basis, const Candidate &C);
187 bool isFoldable(const Candidate &C, TargetTransformInfo *TTI,
192 bool isSimplestForm(const Candidate &C);
224 void allocateCandidatesAndFindBasis(Candidate::Kind CT, const SCEV *B,
229 void rewriteCandidateWithBasis(const Candidate &C, const Candidate &Basis);
241 static Value *emitBump(const Candidate &Basis, const Candidate &C,
[all …]
|
| /external/rust/crates/aho-corasick/src/ |
| D | prefilter.rs | 27 pub enum Candidate { enum
33 impl Candidate { implementation
40 Candidate::None => None, in into_option()
41 Candidate::Match(ref m) => Some(m.start()), in into_option()
42 Candidate::PossibleStartOfMatch(start) => Some(start), in into_option()
63 ) -> Candidate; in next_candidate() argument
103 ) -> Candidate { in next_candidate() argument
370 ) -> Candidate { in next_candidate() argument
371 self.0.find_at(haystack, at).map_or(Candidate::None, Candidate::Match) in next_candidate()
672 ) -> Candidate { in next_candidate() argument
[all …]
|
| /external/webrtc/p2p/base/ |
| D | p2p_transport_channel.h | 70 class RemoteCandidate : public Candidate {
72 RemoteCandidate(const Candidate& c, PortInterface* origin_port) in RemoteCandidate()
73 : Candidate(c), origin_port_(origin_port) {} in RemoteCandidate()
118 void ResolveHostnameCandidate(const Candidate& candidate);
119 void AddRemoteCandidate(const Candidate& candidate) override;
120 void RemoveRemoteCandidate(const Candidate& candidate) override;
243 bool CreateConnections(const Candidate& remote_candidate,
246 const Candidate& remote_candidate,
250 uint32_t GetRemoteCandidateGeneration(const Candidate& candidate);
251 bool IsDuplicateRemoteCandidate(const Candidate& candidate);
[all …]
|
| D | connection.h | 49 const Candidate& local_candidate() const override { return local; } in local_candidate()
50 const Candidate& remote_candidate() const override { return remote; } in remote_candidate()
52 Candidate local;
53 Candidate remote;
93 const Candidate& local_candidate() const override;
95 const Candidate& remote_candidate() const override;
286 void MaybeUpdatePeerReflexiveCandidate(const Candidate& new_candidate);
340 Connection(Port* port, size_t index, const Candidate& candidate);
376 Candidate remote_candidate_;
470 ProxyConnection(Port* port, size_t index, const Candidate& remote_candidate);
|
| /external/llvm-project/clang/lib/Analysis/ |
| D | ThreadSafetyTIL.cpp | 209 BasicBlock *Candidate = nullptr; in computeDominator() local
215 if (Candidate == nullptr) { in computeDominator()
216 Candidate = Pred; in computeDominator()
221 while (Alternate != Candidate) { in computeDominator()
222 if (Candidate->BlockID > Alternate->BlockID) in computeDominator()
223 Candidate = Candidate->DominatorNode.Parent; in computeDominator()
228 DominatorNode.Parent = Candidate; in computeDominator()
236 BasicBlock *Candidate = nullptr; in computePostDominator() local
242 if (Candidate == nullptr) { in computePostDominator()
243 Candidate = Succ; in computePostDominator()
[all …]
|
| /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/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.cpp | 498 const RegPressureTracker &RPTracker, SchedCandidate &Candidate, in readyQueueVerboseDump() argument
511 SchedulingCost(Q, *I, Candidate, RPDelta, true); in readyQueueVerboseDump()
577 SchedCandidate &Candidate, in SchedulingCost() argument
766 SchedCandidate &Candidate) { in pickNodeFromQueue() argument
769 readyQueueVerboseDump(RPTracker, Candidate, Q); in pickNodeFromQueue()
783 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false); in pickNodeFromQueue()
786 if (!Candidate.SU) { in pickNodeFromQueue()
788 Candidate.SU = *I; in pickNodeFromQueue()
789 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
790 Candidate.SCost = CurrentCost; in pickNodeFromQueue()
[all …]
|
| /external/llvm-project/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.cpp | 498 const RegPressureTracker &RPTracker, SchedCandidate &Candidate, in readyQueueVerboseDump() argument
511 SchedulingCost(Q, *I, Candidate, RPDelta, true); in readyQueueVerboseDump()
577 SchedCandidate &Candidate, in SchedulingCost() argument
766 SchedCandidate &Candidate) { in pickNodeFromQueue() argument
769 readyQueueVerboseDump(RPTracker, Candidate, Q); in pickNodeFromQueue()
783 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false); in pickNodeFromQueue()
786 if (!Candidate.SU) { in pickNodeFromQueue()
788 Candidate.SU = *I; in pickNodeFromQueue()
789 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
790 Candidate.SCost = CurrentCost; in pickNodeFromQueue()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | MachineOutliner.h | 37 struct Candidate { struct
120 Candidate(unsigned StartIdx, unsigned Len, in Candidate() argument
126 Candidate() {} in Candidate() function
130 bool operator<(const Candidate &RHS) const {
166 std::vector<Candidate> Candidates;
189 for (const Candidate &C : Candidates) in getOutliningCost()
211 OutlinedFunction(std::vector<Candidate> &Candidates, unsigned SequenceSize, in OutlinedFunction()
216 for (Candidate &C : Candidates) in OutlinedFunction()
|
| /external/llvm-project/llvm/include/llvm/CodeGen/ |
| D | MachineOutliner.h | 38 struct Candidate { struct
121 Candidate(unsigned StartIdx, unsigned Len, in Candidate() argument
127 Candidate() {} in Candidate() argument
131 bool operator<(const Candidate &RHS) const {
167 std::vector<Candidate> Candidates;
190 for (const Candidate &C : Candidates) in getOutliningCost()
212 OutlinedFunction(std::vector<Candidate> &Candidates, unsigned SequenceSize, in OutlinedFunction()
217 for (Candidate &C : Candidates) in OutlinedFunction()
|
| /external/llvm-project/llvm/lib/Target/AMDGPU/ |
| D | GCNMinRegStrategy.cpp | 37 struct Candidate : ilist_node<Candidate> { struct in __anoncf9415770111::GCNMinRegScheduler
41 Candidate(const SUnit *SU_, int Priority_ = 0) in Candidate() function
45 SpecificBumpPtrAllocator<Candidate> Alloc;
46 using Queue = simple_ilist<Candidate>;
81 Candidate* pickCandidate();
146 GCNMinRegScheduler::Candidate* GCNMinRegScheduler::pickCandidate() { in pickCandidate()
153 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; }); in pickCandidate()
158 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
169 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
183 Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; }); in pickCandidate()
[all …]
|
| D | GCNILPSched.cpp | 23 struct Candidate : ilist_node<Candidate> { struct in __anon7c51938e0111::GCNILPScheduler
26 Candidate(SUnit *SU_) in Candidate() argument
30 SpecificBumpPtrAllocator<Candidate> Alloc;
31 typedef simple_ilist<Candidate> Queue;
44 Candidate* pickCandidate();
241 GCNILPScheduler::Candidate* GCNILPScheduler::pickCandidate() { in pickCandidate()
286 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); in releasePredecessors()
309 *new (Alloc.Allocate()) Candidate(const_cast<SUnit*>(SU))); in schedule()
319 [=](const Candidate& C1, const Candidate& C2) { in schedule()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
| D | GCNMinRegStrategy.cpp | 30 struct Candidate : ilist_node<Candidate> { struct in __anone3fe7a6b0111::GCNMinRegScheduler
34 Candidate(const SUnit *SU_, int Priority_ = 0) in Candidate() argument
38 SpecificBumpPtrAllocator<Candidate> Alloc;
39 using Queue = simple_ilist<Candidate>;
74 Candidate* pickCandidate();
139 GCNMinRegScheduler::Candidate* GCNMinRegScheduler::pickCandidate() { in pickCandidate()
146 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; }); in pickCandidate()
151 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
162 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
176 Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; }); in pickCandidate()
[all …]
|
| D | GCNILPSched.cpp | 23 struct Candidate : ilist_node<Candidate> { struct in __anonc0e051820111::GCNILPScheduler
26 Candidate(SUnit *SU_) in Candidate() argument
30 SpecificBumpPtrAllocator<Candidate> Alloc;
31 typedef simple_ilist<Candidate> Queue;
44 Candidate* pickCandidate();
241 GCNILPScheduler::Candidate* GCNILPScheduler::pickCandidate() { in pickCandidate()
286 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); in releasePredecessors()
309 *new (Alloc.Allocate()) Candidate(const_cast<SUnit*>(SU))); in schedule()
319 [=](const Candidate& C1, const Candidate& C2) { in schedule()
|
| /external/s2-geometry-library-java/src/com/google/common/geometry/ |
| D | S2RegionCoverer.java | 98 static class Candidate { class in S2RegionCoverer
102 private Candidate[] children; // Actual size may be 0, 4, 16, or 64
108 private Candidate candidate;
110 public QueueEntry(int id, Candidate candidate) { in QueueEntry()
326 private Candidate newCandidate(S2Cell cell) { in newCandidate()
345 Candidate candidate = new Candidate(); in newCandidate()
349 candidate.children = new Candidate[1 << maxChildrenShift()]; in newCandidate()
365 private void addCandidate(Candidate candidate) { in addCandidate()
411 private int expandChildren(Candidate candidate, S2Cell cell, int numLevels) { in expandChildren()
426 Candidate child = newCandidate(childCells[i]); in expandChildren()
[all …]
|
| /external/tensorflow/tensorflow/lite/kernels/internal/reference/ |
| D | non_max_suppression.h | 94 struct Candidate { in NonMaxSuppression() struct
101 auto cmp = [](const Candidate bs_i, const Candidate bs_j) { in NonMaxSuppression()
104 std::priority_queue<Candidate, std::deque<Candidate>, decltype(cmp)> in NonMaxSuppression()
109 candidate_priority_queue.emplace(Candidate({i, scores[i], 0})); in NonMaxSuppression()
125 Candidate next_candidate = candidate_priority_queue.top(); in NonMaxSuppression()
|
| /external/webrtc/pc/ |
| D | jsep_session_description_unittest.cc | 92 cricket::Candidate candidate(cricket::ICE_CANDIDATE_COMPONENT_RTP, "udp", in SetUp()
116 cricket::Candidate candidate_;
161 std::vector<cricket::Candidate> candidates(1, candidate_); in TEST_F()
220 cricket::Candidate c; in TEST_F()
251 cricket::Candidate c; in TEST_F()
304 cricket::Candidate candidate1( in TEST_F()
308 cricket::Candidate candidate2( in TEST_F()
334 cricket::Candidate candidate_v4( in TEST_F()
338 cricket::Candidate candidate_v6( in TEST_F()
365 cricket::Candidate candidate1( in TEST_F()
[all …]
|
| D | webrtc_sdp.h | 29 class Candidate; variable
57 const cricket::Candidate& candidate);
89 cricket::Candidate* candidate,
99 cricket::Candidate* candidate,
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/SystemZ/ |
| D | SystemZMachineScheduler.cpp | 175 Candidate Best; in pickNode()
179 Candidate c(SU, *HazardRec); in pickNode()
200 SystemZPostRASchedStrategy::Candidate::
201 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec) : Candidate() { in Candidate() function in SystemZPostRASchedStrategy::Candidate
213 bool SystemZPostRASchedStrategy::Candidate::
214 operator<(const Candidate &other) { in operator <()
244 Candidate c(SU, *HazardRec); c.dumpCosts(); dbgs() << "\n";); in schedNode()
|
| /external/llvm-project/llvm/lib/Target/SystemZ/ |
| D | SystemZMachineScheduler.cpp | 175 Candidate Best; in pickNode()
179 Candidate c(SU, *HazardRec); in pickNode()
200 SystemZPostRASchedStrategy::Candidate::
201 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec) : Candidate() { in Candidate() function in SystemZPostRASchedStrategy::Candidate
213 bool SystemZPostRASchedStrategy::Candidate::
214 operator<(const Candidate &other) { in operator <()
244 Candidate c(SU, *HazardRec); c.dumpCosts(); dbgs() << "\n";); in schedNode()
|