| /external/webrtc/talk/app/webrtc/ |
| jsepicecandidate.h | 36 #include "webrtc/p2p/base/candidate.h"
45 const cricket::Candidate& candidate);
49 void SetCandidate(const cricket::Candidate& candidate) {
50 candidate_ = candidate;
55 virtual const cricket::Candidate& candidate() const { function in class:webrtc::JsepIceCandidate
64 cricket::Candidate candidate_;
77 virtual bool HasCandidate(const IceCandidateInterface* candidate) const
[all...] |
| jsep.h | 41 class Candidate;
54 // Class representation of an ICE candidate.
61 // identification" as defined in [RFC 3388] for m-line this candidate is
65 // candidate is assocated with.
67 virtual const cricket::Candidate& candidate() const = 0;
68 // Creates a SDP-ized form of this candidate.
87 // Returns true if an equivalent |candidate| exist in the collection.
88 virtual bool HasCandidate(const IceCandidateInterface* candidate) const = 0;
110 // Adds the specified candidate to the description
[all...] |
| jsepicecandidate.cc | 57 const cricket::Candidate& candidate)
60 candidate_(candidate) {
85 const IceCandidateInterface* candidate) const {
89 if ((*it)->sdp_mid() == candidate->sdp_mid() &&
90 (*it)->sdp_mline_index() == candidate->sdp_mline_index() &&
91 (*it)->candidate().IsEquivalent(candidate->candidate())) {
|
| webrtcsdp_unittest.cc | 50 using cricket::Candidate;
79 typedef std::vector<Candidate> Candidates;
143 "a=candidate:a0+B/1 1 udp 2130706432 192.168.1.5 1234 typ host "
145 "a=candidate:a0+B/1 2 udp 2130706432 192.168.1.5 1235 typ host "
147 "a=candidate:a0+B/2 1 udp 2130706432 ::1 1238 typ host "
149 "a=candidate:a0+B/2 2 udp 2130706432 ::1 1239 typ host "
151 "a=candidate:a0+B/3 1 udp 2130706432 74.125.127.126 2345 typ srflx "
154 "a=candidate:a0+B/3 2 udp 2130706432 74.125.127.126 2347 typ srflx "
179 "a=candidate:a0+B/1 2 udp 2130706432 192.168.1.5 1236 typ host "
181 "a=candidate:a0+B/1 1 udp 2130706432 192.168.1.5 1237 typ host
[all...] |
| /external/v8/src/compiler/ |
| js-inlining-heuristic.h | 38 struct Candidate {
52 bool operator()(const Candidate& left, const Candidate& right) const;
56 typedef ZoneSet<Candidate, CandidateCompare> Candidates;
60 Reduction InlineCandidate(Candidate const& candidate);
|
| js-inlining-heuristic.cc | 58 // Quick check on the size of the AST to avoid parsing large candidate.
77 // Check if the {node} is an appropriate candidate for inlining.
79 Candidate candidate; local
80 candidate.node = node;
81 candidate.num_functions = CollectFunctions(
82 callee, candidate.functions, kMaxCallPolymorphism, candidate.shared_info);
83 if (candidate.num_functions == 0) {
85 } else if (candidate.num_functions > 1 && !FLAG_polymorphic_inlining)
165 Candidate candidate = *i; local
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| StraightLineStrengthReduce.cpp | 81 // SLSR candidate. Such a candidate must be in one of the forms described in
83 struct Candidate : public ilist_node<Candidate> {
91 Candidate()
94 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S,
100 // Note that Index and Stride of a GEP candidate do not necessarily have the
105 // The instruction this candidate corresponds to. It helps us to rewrite a
106 // candidate with respect to its immediate basis. Note that one instruction
120 // Points to the immediate basis of this candidate, or nullptr if we canno
[all...] |
| NaryReassociate.cpp | 244 // ensures that all bases of a candidate are in Candidates when we process it.
393 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP);
394 if (Candidate == nullptr)
398 // Candidate does not necessarily have the same pointer type as GEP. Use
401 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType());
402 assert(Candidate->getType() == GEP->getType());
404 // NewGEP = (char *)Candidate + RHS * sizeof(IndexedType)
425 // NewGEP = &Candidate[RHS * (sizeof(IndexedType) / sizeof(Candidate[0])))
[all...] |
| /external/clang/lib/Analysis/ |
| ThreadSafetyTIL.cpp | 210 BasicBlock *Candidate = nullptr;
215 // If we don't yet have a candidate for dominator yet, take this one.
216 if (Candidate == nullptr) {
217 Candidate = Pred;
220 // Walk the alternate and current candidate back to find a common ancestor.
222 while (Alternate != Candidate) {
223 if (Candidate->BlockID > Alternate->BlockID)
224 Candidate = Candidate->DominatorNode.Parent;
229 DominatorNode.Parent = Candidate;
[all...] |
| /external/webrtc/webrtc/p2p/base/ |
| transportchannelimpl.h | 22 class Candidate;
81 sigslot::signal2<TransportChannelImpl*, const Candidate&>
83 virtual void AddRemoteCandidate(const Candidate& candidate) = 0;
|
| p2ptransportchannel.h | 12 // two P2P clients. Clients have candidate ports for connecting, and
14 // Bob each have candidates, one candidate from Alice and one candidate from
26 #include "webrtc/p2p/base/candidate.h"
51 // Adds the port on which the candidate originated.
52 class RemoteCandidate : public Candidate {
54 RemoteCandidate(const Candidate& c, PortInterface* origin_port)
55 : Candidate(c), origin_port_(origin_port) {}
90 void AddRemoteCandidate(const Candidate& candidate) override
[all...] |
| transport.h | 31 #include "webrtc/p2p/base/candidate.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,
241 // If candidate is not acceptable, returns false and sets error.
243 virtual bool VerifyCandidate(const Candidate& candidate,
[all...] |
| portinterface.h | 72 const Candidate& remote_candidate, CandidateOrigin origin) = 0;
79 virtual const std::vector<Candidate>& Candidates() const = 0;
|
| port.h | 19 #include "webrtc/p2p/base/candidate.h"
47 // RFC 6544, TCP candidate encoding rules.
196 sigslot::signal2<Port*, const Candidate&> SignalCandidateReady;
199 virtual const std::vector<Candidate>& Candidates() const {
292 // Called when the Connection discovers a local peer reflexive candidate.
293 // Returns the index of the new local candidate.
294 size_t AddPrflxCandidate(const Candidate& local);
381 std::vector<Candidate> candidates_;
392 // Candidate filter is pushed down to Port such that each Port could
429 virtual const Candidate& local_candidate() const
[all...] |
| transportchannel.h | 17 #include "webrtc/p2p/base/candidate.h"
30 class Candidate;
150 // being routed, i.e. to a different remote location. The candidate
152 sigslot::signal2<TransportChannel*, const Candidate&> SignalRouteChange;
|
| candidate.h | 30 // Candidate for ICE based connection discovery.
32 class Candidate {
35 // candidate-attribute syntax. http://tools.ietf.org/html/rfc5245#section-15.1
36 Candidate()
43 Candidate(int component,
161 // Determines whether this candidate is equivalent to the given one.
162 bool IsEquivalent(const Candidate& c) const {
239 // and back. This is primarily for converting old G-ICE candidate
240 // signalling to new ICE candidate classes.
|
| tcpport.h | 50 Connection* CreateConnection(const Candidate& address,
121 TCPConnection(TCPPort* port, const Candidate& candidate,
|
| /external/clang/unittests/Tooling/ |
| TestVisitor.h | 204 : Candidate(Name, LineNumber, ColumnNumber), Found(false) {}
207 if (Candidate.Matches(Name, Location)) {
210 } else if (!Found && Candidate.PartiallyMatches(Name, Location)) {
219 << "Expected \"" << Candidate.ExpectedName
220 << "\" at " << Candidate.LineNumber
221 << ":" << Candidate.ColumnNumber << PartialMatches;
224 MatchCandidate Candidate;
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64CollectLOH.cpp | 585 // store are LOH candidate iff the end of the chain is used as
596 // candidate for simplificaton in non-ADRPMode.
690 /// Check whether the given instruction is a LOH candidate.
693 /// \pre UseToDefs contains only on def per use, i.e., obvious non candidate are
794 // If no definition is available, this is a non candidate.
820 // A potential candidate becomes a candidate, if its current immediate
825 for (const MachineInstr *Candidate : PotentialCandidates) {
826 // Get the definition of the candidate i.e., ADD or LDR
[all...] |
| /external/clang/lib/Sema/ |
| Scope.cpp | 123 if (VarDecl *Candidate = NRVO.getPointer()) {
124 if (isDeclScope(Candidate))
125 Candidate->setNRVOVariable(true);
227 OS << "NRVO candidate : (clang::VarDecl*)" << NRVO.getPointer() << '\n';
|
| /frameworks/minikin/libs/minikin/ |
| OptimalLineBreaker.cpp | 58 // A single candidate break
59 struct Candidate {
71 bool isRtl; // The direction of the bidi run containing or ending in this candidate
73 Candidate(uint32_t offset, ParaWidth preBreak, ParaWidth postBreak, float penalty,
89 std::vector<Candidate> candidates;
180 // If an offset is a both candidate for hyphenation and desperate break points, place desperate
181 // break candidate first and hyphenation break points second since the result width of the desperate
282 uint32_t lineNumber; // the computed line number of the candidate
286 const std::vector<Candidate>& candidates);
310 const std::vector<Candidate>& candidates)
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 396 /// If this queue only has one ready candidate, return it. As a side effect,
475 SchedCandidate &Candidate,
534 /// Pick the best candidate from the top queue.
541 SchedCandidate &Candidate) {
547 // BestSU remains NULL if no top candidates beat the best existing candidate.
555 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false);
557 // Initialize the candidate if needed.
558 if (!Candidate.SU) {
559 Candidate.SU = *I;
560 Candidate.RPDelta = RPDelta
[all...] |
| HexagonMachineScheduler.h | 113 // The best SUnit candidate.
116 // Register pressure values for the best candidate.
228 SUnit *SU, SchedCandidate &Candidate,
233 SchedCandidate &Candidate);
|
| /external/llvm/lib/Target/Mips/ |
| MipsDelaySlotFiller.cpp | 173 /// disqualify the delay slot candidate between V and values in Uses and
230 /// This function checks if it is valid to move Candidate to the delay slot
233 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
271 bool terminateSearch(const MachineInstr &Candidate) const;
866 bool Filler::delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
868 assert(!Candidate.isKill() &&
871 bool HasHazard = Candidate.isImplicitDef();
873 HasHazard |= IM.hasHazard(Candidate);
874 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands())
[all...] |
| /external/llvm/include/llvm/Target/ |
| TargetMachine.h | 140 bool isCompatibleDataLayout(const DataLayout &Candidate) const {
141 return DL == Candidate;
|
