| /external/webrtc/webrtc/p2p/base/ |
| stunport_unittest.cc | 159 EXPECT_EQ(0U, port()->Candidates().size());
167 ASSERT_EQ(1U, port()->Candidates().size());
168 EXPECT_TRUE(kLocalAddr.EqualIPs(port()->Candidates()[0].address()));
180 EXPECT_EQ(0U, port()->Candidates().size());
188 ASSERT_EQ(1U, port()->Candidates().size());
189 EXPECT_TRUE(kLocalAddr.EqualIPs(port()->Candidates()[0].address()));
190 EXPECT_EQ(kStunCandidatePriority, port()->Candidates()[0].priority());
199 EXPECT_EQ(0U, port()->Candidates().size());
209 ASSERT_EQ(1U, port()->Candidates().size());
210 EXPECT_TRUE(kLocalAddr.EqualIPs(port()->Candidates()[0].address()))
[all...] |
| turnport_unittest.cc | 338 ASSERT_EQ(1U, turn_port_->Candidates().size());
340 turn_port_->Candidates()[0].address().ipaddr());
341 EXPECT_NE(0, turn_port_->Candidates()[0].address().port());
372 ASSERT_EQ(0U, turn_port_->Candidates().size());
395 ASSERT_EQ(0U, turn_port_->Candidates().size());
404 turn_port_->Candidates()[0], Port::ORIGIN_MESSAGE);
414 udp_port_->Candidates()[0], Port::ORIGIN_MESSAGE);
434 Connection* conn1 = udp_port_->CreateConnection(turn_port_->Candidates()[0],
436 Connection* conn2 = turn_port_->CreateConnection(udp_port_->Candidates()[0],
460 conn2 = turn_port_->CreateConnection(udp_port_->Candidates()[0]
[all...] |
| transportdescription.h | 72 typedef std::vector<Candidate> Candidates;
85 const Candidates& candidates)
92 candidates(candidates) {}
106 candidates(from.candidates) {}
121 candidates = from.candidates;
149 Candidates candidates member in struct:cricket::TransportDescription
[all...] |
| port_unittest.cc | 76 assert(port->Candidates().size() >= 1);
77 return port->Candidates()[0];
[all...] |
| portinterface.h | 79 virtual const std::vector<Candidate>& Candidates() const = 0;
|
| transport_unittest.cc | 18 using cricket::Candidates;
160 cricket::CONNECTIONROLE_NONE, NULL, cricket::Candidates());
181 cricket::CONNECTIONROLE_ACTPASS, NULL, cricket::Candidates());
210 cricket::CONNECTIONROLE_NONE, NULL, cricket::Candidates());
|
| transportcontroller.h | 71 // Start gathering candidates for any new transports, or transports doing an
75 const Candidates& candidates,
107 // (transport_name, candidates)
108 sigslot::signal2<const std::string&, const Candidates&>
177 const Candidates& candidates,
|
| transportcontroller_unittest.cc | 33 using cricket::Candidates;
116 cricket::CONNECTIONROLE_ACTPASS, nullptr, Candidates());
171 const Candidates& candidates) {
176 candidates.begin(), candidates.end());
187 // transport_name => candidates
188 std::map<std::string, Candidates> candidates_;
327 cricket::CONNECTIONROLE_ACTPASS, nullptr, Candidates());
335 // candidates
358 Candidates candidates; local
[all...] |
| transport.h | 46 typedef std::vector<Candidate> Candidates;
223 // Tells channels to start gathering candidates if necessary.
237 // Called when one or more candidates are ready from the remote peer.
238 bool AddRemoteCandidates(const std::vector<Candidate>& candidates,
|
| transportcontroller.cc | 33 const Candidates& candidates)
34 : transport_name(transport_name), candidates(candidates) {}
37 Candidates candidates; member in struct:cricket::CandidatesData
123 const Candidates& candidates,
127 transport_name, candidates, err));
254 SignalCandidatesGathered(data->transport_name, data->candidates);
514 std::vector<Candidate> candidates; local
[all...] |
| /external/clang/include/clang/Sema/ |
| TemplateDeduction.h | 222 /// For now, assume that the candidates are non-matching specializations.
242 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
247 SmallVector<TemplateSpecCandidate, 16> Candidates;
249 // Stores whether we're taking the address of these candidates. This helps us
267 /// \brief Clear out all of the candidates.
272 iterator begin() { return Candidates.begin(); }
273 iterator end() { return Candidates.end(); }
275 size_t size() const { return Candidates.size(); }
276 bool empty() const { return Candidates.empty(); }
281 Candidates.emplace_back()
[all...] |
| Overload.h | 43 OR_Ambiguous, ///< Ambiguous candidates found.
48 /// Requests that all candidates be shown. Viable candidates will
52 /// Requests that only viable candidates be shown.
695 /// OverloadCandidateSet - A set of overload candidates, used in C++
702 /// Lookup for candidates for a call using operator syntax. Candidates
710 SmallVector<OverloadCandidate, 16> Candidates;
743 /// \brief Clear out all of the candidates.
747 iterator begin() { return Candidates.begin();
[all...] |
| CodeCompleteConsumer.h | [all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopLoadElimination.cpp | 13 // distance of one between stores and loads. These form the candidates for the
127 std::forward_list<StoreToLoadForwardingCandidate> Candidates;
131 return Candidates;
165 Candidates.emplace_front(Load, Store);
169 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &C) {
173 return Candidates;
183 /// \brief If a load has multiple candidates associated (i.e. different
185 /// depending on control flow. Remove these candidates.
203 std::forward_list<StoreToLoadForwardingCandidate> &Candidates) {
210 for (const auto &Cand : Candidates) {
[all...] |
| NaryReassociate.cpp | 244 // ensures that all bases of a candidate are in Candidates when we process it.
561 auto &Candidates = Pos->second;
566 while (!Candidates.empty()) {
567 // Candidates stores WeakVHs, so a candidate can be nullptr if it's removed
569 if (Value *Candidate = Candidates.back()) {
574 Candidates.pop_back();
|
| StraightLineStrengthReduce.cpp | 18 // reduction candidates in the following forms:
25 // candidates S1 and S2 in the same form and S1 dominates S2, we may rewrite S2
107 // can correspond to multiple candidates depending on how you associate the
158 // to Candidates, and tries to find the immediate basis for each of them.
160 // Allocate candidates and find bases for Add instructions.
166 // Allocate candidates and find bases for Mul instructions.
172 // Allocate candidates and find bases for GetElementPtr instructions.
179 // Adds the given form <CT, B, Idx, S> to Candidates, and finds its immediate
203 ilist<Candidate> Candidates;
323 // the number of existing candidates. However, we could do better by usin
[all...] |
| /external/v8/src/compiler/ |
| js-inlining-heuristic.h | 28 // Processes the list of candidates gathered while the reducer was running,
39 // Comparator for candidates.
44 // Candidates are kept in a sorted set of unique candidates.
45 typedef ZoneSet<Candidate, CandidateCompare> Candidates;
47 // Dumps candidates to console.
52 Candidates candidates_;
|
| /external/llvm/lib/CodeGen/ |
| RegisterScavenging.cpp | 292 BitVector &Candidates,
295 int Survivor = Candidates.find_first();
296 assert(Survivor > 0 && "No candidates for scavenging");
311 // Remove any candidates touched by instruction.
315 Candidates.clearBitsNotInMask(MO.getRegMask());
326 Candidates.reset(*AI);
337 if (Candidates.test(Survivor))
340 // All candidates gone?
341 if (Candidates.none())
344 Survivor = Candidates.find_first()
[all...] |
| MachineLICM.cpp | 156 /// Keep track of information about hoisting candidates.
171 SmallVectorImpl<CandidateInfo> &Candidates);
352 SmallVectorImpl<CandidateInfo> &Candidates) {
430 Candidates.push_back(CandidateInfo(MI, Def, FI));
445 SmallVector<CandidateInfo, 32> Candidates;
449 // collect potential LICM candidates.
471 ProcessMI(MI, PhysRegDefs, PhysRegClobbers, StoredFIs, Candidates);
491 // Now evaluate whether the potential candidates qualify.
499 for (unsigned i = 0, e = Candidates.size(); i != e; ++i) {
500 if (Candidates[i].FI != INT_MIN &
[all...] |
| /external/llvm/lib/Target/Mips/ |
| Mips16InstrInfo.cpp | 336 BitVector Candidates =
344 Candidates.reset(MO.getReg());
348 // it will not be in the list of candidates.
365 Available &= Candidates;
376 Reg = Candidates.find_first();
377 Candidates.reset(Reg);
391 SpReg = Candidates.find_first();
392 // Candidates.reset(SpReg); // not really needed
|
| /external/llvm/include/llvm/CodeGen/ |
| RegisterScavenging.h | 175 BitVector &Candidates,
|
| /external/webrtc/talk/app/webrtc/ |
| jsepsessiondescription_unittest.cc | 84 NULL, cricket::Candidates()))));
92 NULL, cricket::Candidates()))));
140 const IceCandidateCollection* ice_candidates = jsep_desc_->candidates(0);
149 EXPECT_EQ(0u, jsep_desc_->candidates(1)->count());
156 EXPECT_EQ(0u, jsep_desc_->candidates(0)->count());
157 const IceCandidateCollection* ice_candidates = jsep_desc_->candidates(1);
174 const IceCandidateCollection* ice_candidates = jsep_desc_->candidates(0);
183 EXPECT_EQ(0u, jsep_desc_->candidates(1)->count());
197 // does not increase the number of candidates in the description.
201 EXPECT_EQ(1u, jsep_desc_->candidates(0)->count())
[all...] |
| /external/webrtc/webrtc/p2p/client/ |
| fakeportallocator.h | 128 SignalCandidatesReady(this, port->Candidates());
|
| portallocator_unittest.cc | 77 // Helper for dumping candidates
259 // candidates as specified. When |expect_stun_candidate| is true,
333 const std::vector<cricket::Candidate>& candidates) {
334 for (size_t i = 0; i < candidates.size(); ++i) {
335 LOG(LS_INFO) << "OnCandidatesReady: " << candidates[i].ToString();
336 candidates_.push_back(candidates[i]);
524 // When the same interfaces are added again, new candidates/ports should be
551 // When the same interfaces are added again, new candidates/ports should not
559 // Verify candidates with default step delay of 1sec.
615 // We check the candidates for udp/stun/tcp ports, and the from addres
[all...] |
| /external/clang/lib/Sema/ |
| CodeCompleteConsumer.cpp | 513 OverloadCandidate *Candidates,
517 = Candidates[I].CreateSignatureString(CurrentArg, SemaRef,
|
