| /external/chromium/third_party/libjingle/source/talk/p2p/base/ |
| transportchannelimpl.h | 39 class Candidate;
73 const Candidate&> SignalCandidateReady;
74 virtual void OnCandidate(const Candidate& candidate) = 0;
|
| p2ptransportchannel.h | 29 // two P2P clients. Clients have candidate ports for connecting, and
31 // Bob each have candidates, one candidate from Alice and one candidate from
44 #include "talk/p2p/base/candidate.h"
53 // Adds the port on which the candidate originated.
54 class RemoteCandidate : public Candidate {
56 RemoteCandidate(const Candidate& c, Port* origin_port)
57 : Candidate(c), origin_port_(origin_port) {}
99 virtual void OnCandidate(const Candidate& candidate);
[all...] |
| p2ptransport.h | 70 Candidate* candidate,
72 bool WriteCandidate(const Candidate& candidate,
|
| transport.h | 55 #include "talk/p2p/base/candidate.h"
78 typedef std::vector<Candidate> Candidates;
173 const std::vector<Candidate>&> SignalCandidatesReady;
174 void OnRemoteCandidates(const std::vector<Candidate>& candidates);
176 // If candidate is not acceptable, returns false and sets error.
178 virtual bool VerifyCandidate(const Candidate& candidate,
221 // Called when a candidate is ready from remote peer.
222 void OnRemoteCandidate(const Candidate& candidate);
[all...] |
| rawtransportchannel.h | 36 #include "talk/p2p/base/candidate.h"
87 virtual void OnCandidate(const Candidate& candidate);
108 const std::vector<Candidate>& candidates);
|
| candidate.h | 37 // Candidate for ICE based connection discovery.
39 class Candidate {
41 Candidate() : preference_(0), generation_(0) {}
42 Candidate(const std::string& name, const std::string& protocol,
101 // Determines whether this candidate is equivalent to the given one.
102 bool IsEquivalent(const Candidate& c) const {
|
| port.h | 42 #include "talk/p2p/base/candidate.h"
136 const std::vector<Candidate>& candidates() const { return candidates_; }
148 virtual Connection* CreateConnection(const Candidate& remote_candidate,
252 std::vector<Candidate> candidates_;
283 virtual const Candidate& local_candidate() const;
286 const Candidate& remote_candidate() const { return remote_candidate_; }
363 Connection(Port* port, size_t index, const Candidate& candidate);
387 Candidate remote_candidate_;
413 ProxyConnection(Port* port, size_t index, const Candidate& candidate)
[all...] |
| transport.cc | 32 #include "talk/p2p/base/candidate.h"
43 ChannelParams() : channel(NULL), candidate(NULL) {}
45 : name(name), channel(NULL), candidate(NULL) {}
49 channel(NULL), candidate(NULL) {}
50 explicit ChannelParams(cricket::Candidate* candidate) :
51 channel(NULL), candidate(candidate) {
52 name = candidate->name();
56 delete candidate;
62 cricket::Candidate* candidate; member in struct:cricket::ChannelParams
[all...] |
| rawtransportchannel.cc | 128 void RawTransportChannel::OnCandidate(const Candidate& candidate) {
129 remote_address_ = candidate.address();
175 PortAllocatorSession *session, const std::vector<Candidate>& candidates) {
179 // The most recent candidate is the one we haven't seen yet.
180 Candidate c = candidates[candidates.size() - 1];
|
| rawtransport.cc | 67 Candidate candidate;
68 candidate.set_name(cand_elem->Attr(buzz::QN_NAME));
69 candidate.set_address(addr);
70 candidates->push_back(candidate);
80 for (std::vector<Candidate>::const_iterator
|
| tcpport.h | 65 virtual Connection* CreateConnection(const Candidate& address,
117 TCPConnection(TCPPort* port, const Candidate& candidate,
|
| p2ptransport.cc | 88 // Only look at local part because it might be <session><candidate>
89 // or <tranport><candidate>.
91 Candidate candidate; local
92 if (!ParseCandidate(candidate_elem, &candidate, error))
94 candidates->push_back(candidate);
101 Candidate* candidate,
110 return BadParse("candidate missing required attribute", error);
117 candidate->set_name(elem->Attr(buzz::QN_NAME))
[all...] |
| udpport.h | 63 virtual Connection* CreateConnection(const Candidate& address,
|
| portallocator.h | 73 const std::vector<Candidate>&> SignalCandidatesReady;
|
| relayport.h | 46 // remote candidate that we try to send data to a RelayEntry instance
74 virtual Connection* CreateConnection(const Candidate& address,
|
| stunport.h | 76 // This will contact the secondary server and signal another candidate
80 virtual Connection* CreateConnection(const Candidate& address,
|
| udpport.cc | 72 Connection* UDPPort::CreateConnection(const Candidate& address,
|
| p2ptransportchannel.cc | 104 // Compare the candidate information.
289 // A new candidate is available, let listeners know
291 PortAllocatorSession *session, const std::vector<Candidate>& candidates) {
305 // candidate list. If it isn't return error to the stun request.
307 const Candidate *candidate = NULL; local
311 candidate = &(*it);
315 if (candidate == NULL) {
330 Candidate new_remote_candidate = *candidate;
[all...] |
| /external/clang/unittests/Tooling/ |
| TestVisitor.h | 186 : Candidate(Name, LineNumber, ColumnNumber), Found(false) {}
189 if (Candidate.Matches(Name, Location)) {
192 } else if (!Found && Candidate.PartiallyMatches(Name, Location)) {
201 << "Expected \"" << Candidate.ExpectedName
202 << "\" at " << Candidate.LineNumber
203 << ":" << Candidate.ColumnNumber << PartialMatches;
206 MatchCandidate Candidate;
|
| /external/chromium/third_party/libjingle/source/talk/p2p/client/ |
| socketmonitor.h | 52 Candidate local_candidate;
53 Candidate remote_candidate;
|
| /external/llvm/lib/Target/Mips/ |
| MipsDelaySlotFiller.cpp | 161 /// disqualify the delay slot candidate between V and values in Uses and
202 /// This function checks if it is valid to move Candidate to the delay slot
205 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
243 bool terminateSearch(const MachineInstr &Candidate) const;
707 bool Filler::delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
709 bool HasHazard = (Candidate.isImplicitDef() || Candidate.isKill());
711 HasHazard |= IM.hasHazard(Candidate);
712 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands())
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 387 /// If this queue only has one ready candidate, return it. As a side effect,
468 SchedCandidate &Candidate,
527 /// Pick the best candidate from the top queue.
534 SchedCandidate &Candidate) {
540 // BestSU remains NULL if no top candidates beat the best existing candidate.
548 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false);
550 // Initialize the candidate if needed.
551 if (!Candidate.SU) {
552 Candidate.SU = *I;
553 Candidate.RPDelta = RPDelta
[all...] |
| HexagonMachineScheduler.h | 114 // The best SUnit candidate.
117 // Register pressure values for the best candidate.
229 SUnit *SU, SchedCandidate &Candidate,
234 SchedCandidate &Candidate);
|
| /external/clang/lib/Sema/ |
| SemaOverload.cpp | 556 /// to the form used in overload-candidate information.
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| Sink.cpp | 183 assert(SuccToSinkTo && "Candidate sink target is null");
213 // dominated by the candidate
243 BasicBlock *Candidate = (*I)->getBlock();
245 IsAcceptableTarget(Inst, Candidate))
246 SuccToSinkTo = Candidate;
|
