| /external/webrtc/webrtc/p2p/base/ |
| D | stunport_unittest.cc | 159 EXPECT_EQ(0U, port()->Candidates().size()); in TEST_F()
167 ASSERT_EQ(1U, port()->Candidates().size()); in TEST_F()
168 EXPECT_TRUE(kLocalAddr.EqualIPs(port()->Candidates()[0].address())); in TEST_F()
180 EXPECT_EQ(0U, port()->Candidates().size()); in TEST_F()
188 ASSERT_EQ(1U, port()->Candidates().size()); in TEST_F()
189 EXPECT_TRUE(kLocalAddr.EqualIPs(port()->Candidates()[0].address())); in TEST_F()
190 EXPECT_EQ(kStunCandidatePriority, port()->Candidates()[0].priority()); in TEST_F()
199 EXPECT_EQ(0U, port()->Candidates().size()); in TEST_F()
209 ASSERT_EQ(1U, port()->Candidates().size()); in TEST_F()
210 EXPECT_TRUE(kLocalAddr.EqualIPs(port()->Candidates()[0].address())); in TEST_F()
[all …]
|
| D | turnport_unittest.cc | 338 ASSERT_EQ(1U, turn_port_->Candidates().size()); in TestTurnAlternateServer()
340 turn_port_->Candidates()[0].address().ipaddr()); in TestTurnAlternateServer()
341 EXPECT_NE(0, turn_port_->Candidates()[0].address().port()); in TestTurnAlternateServer()
372 ASSERT_EQ(0U, turn_port_->Candidates().size()); in TestTurnAlternateServerPingPong()
395 ASSERT_EQ(0U, turn_port_->Candidates().size()); in TestTurnAlternateServerDetectRepetition()
404 turn_port_->Candidates()[0], Port::ORIGIN_MESSAGE); in TestTurnConnection()
414 udp_port_->Candidates()[0], Port::ORIGIN_MESSAGE); in TestTurnConnection()
434 Connection* conn1 = udp_port_->CreateConnection(turn_port_->Candidates()[0], in TestDestroyTurnConnection()
436 Connection* conn2 = turn_port_->CreateConnection(udp_port_->Candidates()[0], in TestDestroyTurnConnection()
460 conn2 = turn_port_->CreateConnection(udp_port_->Candidates()[0], in TestDestroyTurnConnection()
[all …]
|
| D | port_unittest.cc | 76 assert(port->Candidates().size() >= 1); in GetCandidate()
77 return port->Candidates()[0]; in GetCandidate()
1322 ASSERT_FALSE(lport->Candidates().empty()); in TEST_F()
1323 Connection* conn = lport->CreateConnection(lport->Candidates()[0], in TEST_F()
1342 Connection* conn1 = lport->CreateConnection(lport->Candidates()[1], in TEST_F()
1388 ASSERT_FALSE(lport->Candidates().empty()); in TEST_F()
1389 ASSERT_FALSE(rport->Candidates().empty()); in TEST_F()
1390 Connection* lconn = lport->CreateConnection(rport->Candidates()[0], in TEST_F()
1392 Connection* rconn = rport->CreateConnection(lport->Candidates()[0], in TEST_F()
1431 EXPECT_EQ(0U, port->Candidates().size()); in TEST_F()
[all …]
|
| D | transportcontroller_unittest.cc | 33 using cricket::Candidates;
116 cricket::CONNECTIONROLE_ACTPASS, nullptr, Candidates()); in CreateChannelsAndCompleteConnection_w()
171 const Candidates& candidates) { in OnCandidatesGathered()
188 std::map<std::string, Candidates> candidates_;
327 cricket::CONNECTIONROLE_ACTPASS, nullptr, Candidates()); in TEST_F()
346 cricket::CONNECTIONROLE_ACTPASS, nullptr, Candidates()); in TEST_F()
358 Candidates candidates; in TEST_F()
376 cricket::CONNECTIONROLE_ACTPASS, nullptr, Candidates()); in TEST_F()
383 cricket::CONNECTIONROLE_ACTPASS, nullptr, Candidates()); in TEST_F()
655 cricket::CONNECTIONROLE_ACTPASS, nullptr, Candidates()); in TEST_F()
|
| D | transportdescription.h | 72 typedef std::vector<Candidate> Candidates; typedef
85 const Candidates& candidates) in TransportDescription()
149 Candidates candidates;
|
| D | transport_unittest.cc | 18 using cricket::Candidates;
160 cricket::CONNECTIONROLE_NONE, NULL, cricket::Candidates()); in TEST_F()
181 cricket::CONNECTIONROLE_ACTPASS, NULL, cricket::Candidates()); in TEST_F()
210 cricket::CONNECTIONROLE_NONE, NULL, cricket::Candidates()); in TEST_F()
|
| D | transportcontroller.h | 75 const Candidates& candidates,
108 sigslot::signal2<const std::string&, const Candidates&>
177 const Candidates& candidates,
|
| D | transportcontroller.cc | 33 const Candidates& candidates) in CandidatesData()
37 Candidates candidates;
123 const Candidates& candidates, in AddRemoteCandidates()
449 const Candidates& candidates, in AddRemoteCandidates_w()
|
| D | portinterface.h | 79 virtual const std::vector<Candidate>& Candidates() const = 0;
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopLoadElimination.cpp | 141 std::forward_list<StoreToLoadForwardingCandidate> Candidates; in findStoreToLoadDependences() local
145 return Candidates; in findStoreToLoadDependences()
185 Candidates.emplace_front(Load, Store); in findStoreToLoadDependences()
189 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &C) { in findStoreToLoadDependences()
193 return Candidates; in findStoreToLoadDependences()
223 std::forward_list<StoreToLoadForwardingCandidate> &Candidates) { in removeDependencesFromMultipleStores() argument
230 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores()
256 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { in removeDependencesFromMultipleStores()
288 const SmallVectorImpl<StoreToLoadForwardingCandidate> &Candidates) { in findPointersWrittenOnForwardingPath() argument
307 std::max_element(Candidates.begin(), Candidates.end(), in findPointersWrittenOnForwardingPath()
[all …]
|
| D | StraightLineStrengthReduce.cpp | 203 ilist<Candidate> Candidates; member in __anonaa4ec62a0111::StraightLineStrengthReduce
322 for (auto Basis = Candidates.rbegin(); in allocateCandidatesAndFindBasis()
323 Basis != Candidates.rend() && NumIterations < MaxNumIterations; in allocateCandidatesAndFindBasis()
333 Candidates.push_back(C); in allocateCandidatesAndFindBasis()
685 while (!Candidates.empty()) { in runOnFunction()
686 const Candidate &C = Candidates.back(); in runOnFunction()
690 Candidates.pop_back(); in runOnFunction()
|
| D | NaryReassociate.cpp | 530 auto &Candidates = Pos->second; in findClosestMatchingDominator() local
535 while (!Candidates.empty()) { in findClosestMatchingDominator()
538 if (Value *Candidate = Candidates.back()) { in findClosestMatchingDominator()
543 Candidates.pop_back(); in findClosestMatchingDominator()
|
| D | SeparateConstOffsetFromGEP.cpp | 1100 auto &Candidates = Pos->second; in findClosestMatchingDominator() local
1105 while (!Candidates.empty()) { in findClosestMatchingDominator()
1106 Instruction *Candidate = Candidates.back(); in findClosestMatchingDominator()
1109 Candidates.pop_back(); in findClosestMatchingDominator()
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | RegisterScavenging.cpp | 267 BitVector &Candidates, in findSurvivorReg() argument
270 int Survivor = Candidates.find_first(); in findSurvivorReg()
298 Candidates.reset(MO.getReg()); in findSurvivorReg()
300 Candidates.reset(*R); in findSurvivorReg()
311 if (Candidates.test(Survivor)) in findSurvivorReg()
315 if (Candidates.none()) in findSurvivorReg()
318 Survivor = Candidates.find_first(); in findSurvivorReg()
334 BitVector Candidates = in scavengeRegister() local
342 Candidates.reset(MO.getReg()); in scavengeRegister()
351 if ((Candidates & Available).any()) in scavengeRegister()
[all …]
|
| D | MachineLICM.cpp | 170 SmallVector<CandidateInfo, 32> &Candidates);
388 SmallVector<CandidateInfo, 32> &Candidates) { in ProcessMI() argument
457 Candidates.push_back(CandidateInfo(MI, Def, FI)); in ProcessMI()
468 SmallVector<CandidateInfo, 32> Candidates; in HoistRegionPostRA() local
497 ProcessMI(MI, PhysRegDefs, StoredFIs, Candidates); in HoistRegionPostRA()
506 for (unsigned i = 0, e = Candidates.size(); i != e; ++i) { in HoistRegionPostRA()
507 if (Candidates[i].FI != INT_MIN && in HoistRegionPostRA()
508 StoredFIs.count(Candidates[i].FI)) in HoistRegionPostRA()
511 if (PhysRegDefs[Candidates[i].Def] == 1) { in HoistRegionPostRA()
513 MachineInstr *MI = Candidates[i].MI; in HoistRegionPostRA()
[all …]
|
| /external/clang/include/clang/Sema/ |
| D | TemplateDeduction.h | 273 SmallVector<TemplateSpecCandidate, 16> Candidates; variable
298 iterator begin() { return Candidates.begin(); } in begin()
299 iterator end() { return Candidates.end(); } in end()
301 size_t size() const { return Candidates.size(); } in size()
302 bool empty() const { return Candidates.empty(); } in empty()
307 Candidates.emplace_back(); in addCandidate()
308 return Candidates.back(); in addCandidate()
|
| D | Overload.h | 714 SmallVector<OverloadCandidate, 16> Candidates;
751 iterator begin() { return Candidates.begin(); } in begin()
752 iterator end() { return Candidates.end(); } in end()
754 size_t size() const { return Candidates.size(); } in size()
755 bool empty() const { return Candidates.empty(); } in empty()
760 Candidates.push_back(OverloadCandidate());
761 OverloadCandidate &C = Candidates.back();
|
| /external/llvm/lib/CodeGen/ |
| D | RegisterScavenging.cpp | 277 BitVector &Candidates, in findSurvivorReg() argument
280 int Survivor = Candidates.find_first(); in findSurvivorReg()
299 Candidates.clearBitsNotInMask(MO.getRegMask()); in findSurvivorReg()
310 Candidates.reset(*AI); in findSurvivorReg()
321 if (Candidates.test(Survivor)) in findSurvivorReg()
325 if (Candidates.none()) in findSurvivorReg()
328 Survivor = Candidates.find_first(); in findSurvivorReg()
355 BitVector Candidates = TRI->getAllocatableSet(MF, RC); in scavengeRegister() local
361 Candidates.reset(MO.getReg()); in scavengeRegister()
367 Available &= Candidates; in scavengeRegister()
[all …]
|
| D | MachineLICM.cpp | 171 SmallVectorImpl<CandidateInfo> &Candidates);
355 SmallVectorImpl<CandidateInfo> &Candidates) { in ProcessMI() argument
432 Candidates.push_back(CandidateInfo(MI, Def, FI)); in ProcessMI()
447 SmallVector<CandidateInfo, 32> Candidates; in HoistRegionPostRA() local
469 ProcessMI(&MI, PhysRegDefs, PhysRegClobbers, StoredFIs, Candidates); in HoistRegionPostRA()
495 for (CandidateInfo &Candidate : Candidates) { in HoistRegionPostRA()
708 SmallVector<MachineInstr *, 8> Candidates; in SinkIntoLoop() local
714 Candidates.push_back(&*I); in SinkIntoLoop()
717 for (MachineInstr *I : Candidates) { in SinkIntoLoop()
|
| /external/v8/src/compiler/ |
| D | js-inlining-heuristic.h | 56 typedef ZoneSet<Candidate, CandidateCompare> Candidates; typedef
69 Candidates candidates_;
|
| /external/llvm/lib/Target/Mips/ |
| D | Mips16InstrInfo.cpp | 335 BitVector Candidates = in loadImmediate() local
343 Candidates.reset(MO.getReg()); in loadImmediate()
364 Available &= Candidates; in loadImmediate()
375 Reg = Candidates.find_first(); in loadImmediate()
376 Candidates.reset(Reg); in loadImmediate()
390 SpReg = Candidates.find_first(); in loadImmediate()
|
| /external/webrtc/webrtc/p2p/client/ |
| D | portallocator_unittest.cc | 1148 EXPECT_EQ(2U, ports_[0]->Candidates().size()); in TEST_F()
1149 EXPECT_EQ(1U, ports_[1]->Candidates().size()); in TEST_F()
1187 EXPECT_EQ(2U, ports_[0]->Candidates().size()); in TEST_F()
1188 EXPECT_EQ(1U, ports_[1]->Candidates().size()); in TEST_F()
1217 EXPECT_EQ(1U, ports_[0]->Candidates().size()); in TEST_F()
1218 EXPECT_EQ(1U, ports_[1]->Candidates().size()); in TEST_F()
1255 EXPECT_EQ(1U, ports_[0]->Candidates().size()); in TEST_F()
1256 EXPECT_EQ(1U, ports_[1]->Candidates().size()); in TEST_F()
1257 EXPECT_EQ(1U, ports_[2]->Candidates().size()); in TEST_F()
|
| /external/webrtc/talk/app/webrtc/ |
| D | jsepsessiondescription_unittest.cc | 84 NULL, cricket::Candidates())))); in CreateCricketSessionDescription()
92 NULL, cricket::Candidates())))); in CreateCricketSessionDescription()
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | IndirectCallPromotion.cpp | 184 const std::vector<PromotionCandidate> &Candidates,
578 Instruction *Inst, const std::vector<PromotionCandidate> &Candidates, in tryToPromote() argument
582 for (auto &C : Candidates) { in tryToPromote()
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| D | RegisterScavenging.h | 160 BitVector &Candidates,
|