Searched defs:candidate (Results 51 - 75 of 188) sorted by relevance

12345678

/external/chromium_org/third_party/boringssl/src/crypto/bn/
H A Dprime.c267 int BN_primality_test(int *is_probably_prime, const BIGNUM *candidate, argument
270 switch (BN_is_prime_fasttest_ex(candidate, checks, ctx, do_trial_division, cb)) {
283 int BN_is_prime_ex(const BIGNUM *candidate, int checks, BN_CTX *ctx, BN_GENCB *cb) { argument
284 return BN_is_prime_fasttest_ex(candidate, checks, ctx, 0, cb);
486 /* In the case that the candidate prime is a single word then
/external/chromium_org/third_party/brotli/src/brotli/enc/
H A Dcluster.h180 // What is the bit cost of moving histogram from cur_symbol to candidate.
183 const Histogram<kSize>& candidate) {
188 tmp.AddHistogram(candidate);
189 return PopulationCost(tmp) - candidate.bit_cost_;
182 HistogramBitCostDistance(const Histogram<kSize>& histogram, const Histogram<kSize>& candidate) argument
/external/chromium_org/third_party/libjingle/source/talk/app/webrtc/
H A Dpeerconnectionfactory_unittest.cc98 virtual void OnIceCandidate(const webrtc::IceCandidateInterface* candidate) {} argument
/external/chromium_org/third_party/libjingle/source/talk/app/webrtc/test/
H A Dpeerconnectiontestwrapper.cc122 const IceCandidateInterface* candidate) {
124 EXPECT_TRUE(candidate->ToString(&sdp));
127 SignalOnIceCandidateReady(candidate->sdp_mid(), candidate->sdp_mline_index(),
202 const std::string& candidate) {
204 webrtc::CreateIceCandidate(sdp_mid, sdp_mline_index, candidate, NULL));
121 OnIceCandidate( const IceCandidateInterface* candidate) argument
200 AddIceCandidate(const std::string& sdp_mid, int sdp_mline_index, const std::string& candidate) argument
/external/chromium_org/third_party/libjingle/source/talk/p2p/base/
H A Ddtlstransportchannel.h223 virtual void OnCandidate(const Candidate& candidate) { argument
224 channel_->OnCandidate(candidate);
244 void OnRouteChange(TransportChannel* channel, const Candidate& candidate);
H A Dtcpport.cc86 // It's active only candidate, we should not try to create connections
238 TCPConnection::TCPConnection(TCPPort* port, const Candidate& candidate, argument
240 : Connection(port, 0, candidate), socket_(socket), error_(0) {
244 int opts = (candidate.protocol() == SSLTCP_PROTOCOL_NAME) ?
248 candidate.address(), port->proxy(), port->user_agent(), opts);
253 << candidate.address().ToSensitiveString();
258 << candidate.address().ToSensitiveString();
313 << "different address from the local candidate.";
H A Dtransportchannelproxy.cc251 const Candidate& candidate) {
254 SignalRouteChange(this, candidate);
250 OnRouteChange(TransportChannel* channel, const Candidate& candidate) argument
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/
H A Dvp9_mvref_common.h137 static INLINE int_mv get_sub_block_mv(const MODE_INFO *candidate, int which_mv, argument
139 return block_idx >= 0 && candidate->mbmi.sb_type < BLOCK_8X8
140 ? candidate->bmi[idx_n_column_to_subblock[block_idx][search_col == 0]]
142 : candidate->mbmi.mv[which_mv];
/external/chromium_org/third_party/skia/src/core/
H A DSkTDynamicHash.h94 T* candidate = fArray[index]; local
95 if (Empty() == candidate) {
98 if (Deleted() != candidate && GetKey(*candidate) == key) {
99 return candidate;
148 const T* candidate = fArray[index]; local
149 if (Empty() == candidate || Deleted() == candidate || GetKey(*candidate) == key) {
212 const T* candidate local
231 const T* candidate = fArray[index]; local
[all...]
/external/chromium_org/tools/clang/plugins/
H A DChromeClassTester.cpp226 const std::string& candidate) {
229 return candidate;
243 return GetNamespaceImpl(context->getParent(), candidate);
225 GetNamespaceImpl(const DeclContext* context, const std::string& candidate) argument
/external/libphonenumber/java/src/com/android/i18n/phonenumbers/
H A DPhoneNumberMatcher.java220 * @param leniency the leniency to use when evaluating candidate phone numbers
252 CharSequence candidate = text.subSequence(start, matcher.end());
257 candidate = trimAfterFirstMatch(PhoneNumberUtil.SECOND_NUMBER_START_PATTERN, candidate);
259 PhoneNumberMatch match = extractMatch(candidate, start);
264 index = start + candidate.length();
272 * Trims away any characters after the first match of {@code pattern} in {@code candidate},
275 private static CharSequence trimAfterFirstMatch(Pattern pattern, CharSequence candidate) { argument
276 Matcher trailingCharsMatcher = pattern.matcher(candidate);
278 candidate
314 extractMatch(CharSequence candidate, int offset) argument
348 extractInnerMatch(String candidate, int offset) argument
387 parseAndVerify(String candidate, int offset) argument
575 checkNumberGroupingIsValid( PhoneNumber number, String candidate, PhoneNumberUtil util, NumberGroupingChecker checker) argument
599 containsMoreThanOneSlashInNationalNumber(PhoneNumber number, String candidate) argument
625 containsOnlyValidXChars( PhoneNumber number, String candidate, PhoneNumberUtil util) argument
[all...]
/external/lldb/source/Expression/
H A DIRMemoryMap.cpp71 lldb::addr_t candidate = LLDB_INVALID_ADDRESS; local
78 candidate = random_data;
79 candidate &= ~0xfffull;
86 candidate = random_high;
87 candidate <<= 32ull;
88 candidate |= random_low;
89 candidate &= ~0xfffull;
94 if (IntersectsAllocation(candidate, size))
97 ret = candidate;
/external/llvm/lib/Target/Sparc/
H A DDelaySlotFiller.cpp82 bool delayHasHazard(MachineBasicBlock::iterator candidate,
229 bool Filler::delayHasHazard(MachineBasicBlock::iterator candidate, argument
236 if (candidate->isImplicitDef() || candidate->isKill())
239 if (candidate->mayLoad()) {
245 if (candidate->mayStore()) {
253 for (unsigned i = 0, e = candidate->getNumOperands(); i!= e; ++i) {
254 const MachineOperand &MO = candidate->getOperand(i);
/external/oprofile/opjitconv/
H A Djitsymbol.c210 int candidate = OP_JIT_CONV_FAIL; local
218 if (candidate == -1 || x > lifetime) {
219 candidate = i;
223 return candidate;
/external/skia/src/core/
H A DSkTDynamicHash.h66 T* candidate = fArray[index]; local
67 if (Empty() == candidate) {
70 if (Deleted() != candidate && GetKey(*candidate) == key) {
71 return candidate;
103 const T* candidate = fArray[index]; local
104 if (Empty() == candidate || Deleted() == candidate || GetKey(*candidate) == key) {
166 const T* candidate local
184 const T* candidate = fArray[index]; local
[all...]
/external/wpa_supplicant_8/hostapd/src/rsn_supp/
H A Dpreauth.c34 * pmksa_candidate_free - Free all entries in PMKSA candidate list
282 * Go through the PMKSA candidates and start pre-authentication if a candidate
288 struct rsn_pmksa_candidate *candidate, *n; local
293 /* TODO: drop priority for old candidate entries */
295 wpa_msg(sm->ctx->msg_ctx, MSG_DEBUG, "RSN: processing PMKSA candidate "
307 dl_list_for_each_safe(candidate, n, &sm->pmksa_candidates,
310 p = pmksa_cache_get(sm->pmksa, candidate->bssid, NULL, NULL);
311 if (os_memcmp(sm->bssid, candidate->bssid, ETH_ALEN) != 0 &&
314 "candidate " MACSTR
316 MAC2STR(candidate
[all...]
/external/wpa_supplicant_8/src/rsn_supp/
H A Dpreauth.c34 * pmksa_candidate_free - Free all entries in PMKSA candidate list
282 * Go through the PMKSA candidates and start pre-authentication if a candidate
288 struct rsn_pmksa_candidate *candidate, *n; local
293 /* TODO: drop priority for old candidate entries */
295 wpa_msg(sm->ctx->msg_ctx, MSG_DEBUG, "RSN: processing PMKSA candidate "
307 dl_list_for_each_safe(candidate, n, &sm->pmksa_candidates,
310 p = pmksa_cache_get(sm->pmksa, candidate->bssid, NULL, NULL);
311 if (os_memcmp(sm->bssid, candidate->bssid, ETH_ALEN) != 0 &&
314 "candidate " MACSTR
316 MAC2STR(candidate
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/rsn_supp/
H A Dpreauth.c34 * pmksa_candidate_free - Free all entries in PMKSA candidate list
282 * Go through the PMKSA candidates and start pre-authentication if a candidate
288 struct rsn_pmksa_candidate *candidate, *n; local
293 /* TODO: drop priority for old candidate entries */
295 wpa_msg(sm->ctx->msg_ctx, MSG_DEBUG, "RSN: processing PMKSA candidate "
307 dl_list_for_each_safe(candidate, n, &sm->pmksa_candidates,
310 p = pmksa_cache_get(sm->pmksa, candidate->bssid, NULL, NULL);
311 if (os_memcmp(sm->bssid, candidate->bssid, ETH_ALEN) != 0 &&
314 "candidate " MACSTR
316 MAC2STR(candidate
[all...]
/external/apache-http/src/org/apache/commons/logging/impl/
H A DLogFactoryImpl.java856 * Appends message if the given name is similar to the candidate.
859 * @param name the (trimmed) name to be test against the candidate, not null
860 * @param candidate the candidate name (not null)
863 final String candidate) {
864 if (name.equals(candidate)) {
872 // then suggest the candidate adapter class name.
873 if (name.regionMatches(true, 0, candidate, 0, PKG_LEN + 5)) {
875 messageBuffer.append(candidate);
862 informUponSimilarName(final StringBuffer messageBuffer, final String name, final String candidate) argument
/external/chromium_org/chrome/browser/chromeos/drive/
H A Dsearch_metadata.cc199 // If the candidate set is already full, and this |entry| is old, do nothing.
264 const ResultCandidate& candidate = *result_candidates.top(); local
269 error = resource_metadata->GetFilePath(candidate.local_id, &path);
272 bool is_directory = candidate.entry.file_info().is_directory();
274 path, is_directory, candidate.highlighted_base_name));
278 // uninteresting candidate at the top.
/external/chromium_org/content/renderer/media/
H A Drtc_peer_connection_handler_unittest.cc151 const blink::WebRTCICECandidate& candidate,
400 blink::WebRTCICECandidate candidate; local
401 candidate.initialize(kDummySdp, "sdpMid", 1);
405 testing::Ref(candidate),
408 EXPECT_TRUE(pc_handler_->addICECandidate(candidate));
676 // Check NULL candidate after ice gathering is completed.
/external/chromium_org/remoting/protocol/
H A Djingle_session.cc26 #include "third_party/libjingle/source/talk/p2p/base/candidate.h"
35 // Delay after candidate creation before sending transport-info
252 channel->AddRemoteCandidate(it->candidate);
281 const cricket::Candidate& candidate) {
283 transport->name(), candidate));
505 channel->second->AddRemoteCandidate(it->candidate);
280 OnTransportCandidate(Transport* transport, const cricket::Candidate& candidate) argument
/external/chromium_org/third_party/WebKit/Source/core/editing/
H A DVisiblePosition.cpp547 static Position canonicalizeCandidate(const Position& candidate) argument
549 if (candidate.isNull())
551 ASSERT(candidate.isCandidate());
552 Position upstream = candidate.upstream();
555 return candidate;
565 // FIXME (9535): Canonicalizing to the leftmost candidate means that if we're at a line wrap, we will
568 // the appropriate renderer for VisiblePosition's like these, or b) canonicalize to the rightmost candidate
578 Position candidate = position.upstream(); local
579 if (candidate.isCandidate())
580 return candidate;
[all...]
/external/chromium_org/third_party/WebKit/Source/core/page/
H A DSpatialNavigation.cpp137 // * b = Focus candidate node's rect.
199 // * b = Focus candidate node's rect.
536 // This method calculates the exitPoint from the startingRect and the entryPoint into the candidate rect.
642 void distanceDataForNode(FocusType type, const FocusCandidate& current, FocusCandidate& candidate) argument
644 if (areElementsOnSameLine(current, candidate)) {
645 if ((type == FocusTypeUp && current.rect.y() > candidate.rect.y()) || (type == FocusTypeDown && candidate.rect.y() > current.rect.y())) {
646 candidate.distance = 0;
647 candidate.alignment = Full;
652 LayoutRect nodeRect = candidate
696 canBeScrolledIntoView(FocusType type, const FocusCandidate& candidate) argument
751 frameOwnerElement(FocusCandidate& candidate) argument
[all...]
/external/chromium_org/third_party/libjingle/source/talk/app/webrtc/java/src/org/webrtc/
H A DPeerConnection.java71 /** Triggered when a new ICE candidate has been found. */
72 public void onIceCandidate(IceCandidate candidate); argument
145 public boolean addIceCandidate(IceCandidate candidate) { argument
147 candidate.sdpMid, candidate.sdpMLineIndex, candidate.sdp);

Completed in 7110 milliseconds

12345678