/external/elfutils/src/lib/ |
H A D | next_prime.c | 35 is_prime (size_t candidate) argument 41 while (sq < candidate && candidate % divn != 0) 51 return candidate % divn != 0;
|
/external/mockito/src/org/mockito/exceptions/stacktrace/ |
H A D | StackTraceCleaner.java | 25 * @param candidate element of the actual stack trace 28 boolean isOut(StackTraceElement candidate); argument
|
/external/objenesis/tck/src/org/objenesis/tck/ |
H A D | TCK.java | 30 * This TCK accepts a set of candidate classes (class it attempts to instantiate) and a set of 31 * Objenesis implementations. It then tries instantiating every candidate with every Objenesis 37 * // register candidate classes. 61 * Register a candidate class to attempt to instantiate. 110 private void runTest(Reporter reporter, Class candidate, Objenesis objenesis, argument 113 Object instance = objenesis.newInstance(candidate); 114 boolean success = instance != null && instance.getClass() == candidate;
|
/external/junit/src/org/junit/experimental/theories/ |
H A D | ParameterSignature.java | 43 public boolean canAcceptType(Class<?> candidate) { argument 44 return type.isAssignableFrom(candidate); 75 Annotation candidate= findDeepAnnotation(each.annotationType() 77 if (candidate != null) 78 return annotationType.cast(candidate);
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | radeon_program_pair.c | 42 int candidate = -1; local 88 candidate = i; 93 candidate = RC_PAIR_PRESUB_SRC; 94 } else if (candidate < 0 || (rgb && rgb_used > 2) 99 /* candidate >= 0 */ 102 pair->RGB.Src[candidate].Used = 1; 103 pair->RGB.Src[candidate].File = file; 104 pair->RGB.Src[candidate].Index = index; 105 if (candidate == RC_PAIR_PRESUB_SRC) { 115 pair->Alpha.Src[candidate] [all...] |
/external/mockito/src/org/mockito/internal/invocation/ |
H A D | InvocationMatcher.java | 77 public boolean hasSimilarMethod(Invocation candidate) { argument 79 String currentMethodName = candidate.getMethod().getName(); 82 final boolean isUnverified = !candidate.isVerified(); 83 final boolean mockIsTheSame = getInvocation().getMock() == candidate.getMock(); 84 final boolean methodEquals = hasSameMethod(candidate); 90 final boolean overloadedButSameArgs = !methodEquals && safelyArgumentsMatch(candidate.getArguments()); 95 public boolean hasSameMethod(Invocation candidate) { argument 99 Method m2 = candidate.getMethod();
|
/external/v8/src/ |
H A D | version.cc | 49 #define CANDIDATE_STRING " (candidate)" 80 const char* candidate = IsCandidate() ? " (candidate)" : ""; local 88 GetMajor(), GetMinor(), GetBuild(), GetPatch(), candidate, 92 GetMajor(), GetMinor(), GetBuild(), candidate, 102 const char* candidate = IsCandidate() ? "-candidate" : ""; local 105 GetMajor(), GetMinor(), GetBuild(), GetPatch(), candidate); 108 GetMajor(), GetMinor(), GetBuild(), candidate);
|
/external/v8/test/cctest/ |
H A D | test-version.cc | 40 bool candidate, const char* soname) { 45 Version::candidate_ = candidate; 53 int patch, bool candidate, 60 SetVersion(major, minor, build, patch, candidate, ""); 68 SetVersion(major, minor, build, patch, candidate, soname); 80 "0.0.0 (candidate) SIMULATOR", "libv8-0.0.0-candidate.so"); 83 "1.0.0 (candidate) SIMULATOR", "libv8-1.0.0-candidate.so"); 86 "1.0.0.1 (candidate) SIMULATO 39 SetVersion(int major, int minor, int build, int patch, bool candidate, const char* soname) argument 52 CheckVersion(int major, int minor, int build, int patch, bool candidate, const char* expected_version_string, const char* expected_generic_soname) argument [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | canonical_views_clustering.cc | 70 double ComputeClusteringQualityDifference(const int candidate, 159 // Computes the difference in the quality score if 'candidate' were 162 const int candidate, 166 options_.view_score_weight * graph_->VertexWeight(candidate); 168 // Compute how much the quality score changes if the candidate view 171 const IntSet& neighbors = graph_->Neighbors(candidate); 177 const double new_similarity = graph_->EdgeWeight(*neighbor, candidate); 189 graph_->EdgeWeight(centers[i], candidate); 161 ComputeClusteringQualityDifference( const int candidate, const vector<int>& centers) const argument
|
/external/libvpx/libvpx/vp9/common/ |
H A D | vp9_mvref_common.c | 15 // to try and find candidate reference vectors. 45 const MB_MODE_INFO *const candidate = &candidate_mi->mbmi; local 47 context_counter += mode_2_counter[candidate->mode]; 50 if (candidate->ref_frame[0] == ref_frame) 52 else if (candidate->ref_frame[1] == ref_frame) 63 const MB_MODE_INFO *const candidate = &xd->mi[mv_ref->col + mv_ref->row * local 67 if (candidate->ref_frame[0] == ref_frame) 68 ADD_MV_REF_LIST(candidate->mv[0]); 69 else if (candidate->ref_frame[1] == ref_frame) 70 ADD_MV_REF_LIST(candidate 89 const MB_MODE_INFO *const candidate = &xd->mi[mv_ref->col + mv_ref->row local [all...] |
H A D | vp9_mvref_common.h | 137 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/v8/src/heap/ |
H A D | objects-visiting.cc | 198 // Check whether to keep the candidate in the list. 199 T* candidate = reinterpret_cast<T*>(list); local 217 candidate = reinterpret_cast<T*>(retained); 218 tail = candidate; 224 WeakListVisitor<T>::VisitPhantomObject(heap, candidate); 228 list = WeakListVisitor<T>::WeakNext(candidate); 243 T* candidate = reinterpret_cast<T*>(list); local 244 list = WeakListVisitor<T>::WeakNext(candidate); 245 WeakListVisitor<T>::SetWeakNext(candidate, undefined);
|
/external/boringssl/src/crypto/bn/ |
H A D | prime.c | 454 int BN_primality_test(int *is_probably_prime, const BIGNUM *candidate, argument 457 switch (BN_is_prime_fasttest_ex(candidate, checks, ctx, do_trial_division, cb)) { 470 int BN_is_prime_ex(const BIGNUM *candidate, int checks, BN_CTX *ctx, BN_GENCB *cb) { argument 471 return BN_is_prime_fasttest_ex(candidate, checks, ctx, 0, cb); 679 /* In the case that the candidate prime is a single word then
|
/external/libphonenumber/libphonenumber/src/com/google/i18n/phonenumbers/ |
H A D | PhoneNumberMatcher.java | 220 * @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 386 parseAndVerify(String candidate, int offset) argument 574 checkNumberGroupingIsValid( PhoneNumber number, String candidate, PhoneNumberUtil util, NumberGroupingChecker checker) argument 598 containsMoreThanOneSlashInNationalNumber(PhoneNumber number, String candidate) argument 624 containsOnlyValidXChars( PhoneNumber number, String candidate, PhoneNumberUtil util) argument [all...] |
/external/lldb/source/Expression/ |
H A D | IRMemoryMap.cpp | 71 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 D | DelaySlotFiller.cpp | 80 bool delayHasHazard(MachineBasicBlock::iterator candidate, 227 bool Filler::delayHasHazard(MachineBasicBlock::iterator candidate, argument 234 if (candidate->isImplicitDef() || candidate->isKill()) 237 if (candidate->mayLoad()) { 243 if (candidate->mayStore()) { 251 for (unsigned i = 0, e = candidate->getNumOperands(); i!= e; ++i) { 252 const MachineOperand &MO = candidate->getOperand(i);
|
/external/skia/src/core/ |
H A D | SkTDynamicHash.h | 94 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/wpa_supplicant_8/hostapd/src/rsn_supp/ |
H A D | preauth.c | 34 * pmksa_candidate_free - Free all entries in PMKSA candidate list 296 * Go through the PMKSA candidates and start pre-authentication if a candidate 302 struct rsn_pmksa_candidate *candidate, *n; local 307 /* TODO: drop priority for old candidate entries */ 309 wpa_msg(sm->ctx->msg_ctx, MSG_DEBUG, "RSN: processing PMKSA candidate " 323 dl_list_for_each_safe(candidate, n, &sm->pmksa_candidates, 326 p = pmksa_cache_get(sm->pmksa, candidate->bssid, NULL, NULL); 327 if (os_memcmp(sm->bssid, candidate->bssid, ETH_ALEN) != 0 && 330 "candidate " MACSTR 332 MAC2STR(candidate [all...] |
/external/wpa_supplicant_8/src/rsn_supp/ |
H A D | preauth.c | 34 * pmksa_candidate_free - Free all entries in PMKSA candidate list 296 * Go through the PMKSA candidates and start pre-authentication if a candidate 302 struct rsn_pmksa_candidate *candidate, *n; local 307 /* TODO: drop priority for old candidate entries */ 309 wpa_msg(sm->ctx->msg_ctx, MSG_DEBUG, "RSN: processing PMKSA candidate " 323 dl_list_for_each_safe(candidate, n, &sm->pmksa_candidates, 326 p = pmksa_cache_get(sm->pmksa, candidate->bssid, NULL, NULL); 327 if (os_memcmp(sm->bssid, candidate->bssid, ETH_ALEN) != 0 && 330 "candidate " MACSTR 332 MAC2STR(candidate [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/rsn_supp/ |
H A D | preauth.c | 34 * pmksa_candidate_free - Free all entries in PMKSA candidate list 296 * Go through the PMKSA candidates and start pre-authentication if a candidate 302 struct rsn_pmksa_candidate *candidate, *n; local 307 /* TODO: drop priority for old candidate entries */ 309 wpa_msg(sm->ctx->msg_ctx, MSG_DEBUG, "RSN: processing PMKSA candidate " 323 dl_list_for_each_safe(candidate, n, &sm->pmksa_candidates, 326 p = pmksa_cache_get(sm->pmksa, candidate->bssid, NULL, NULL); 327 if (os_memcmp(sm->bssid, candidate->bssid, ETH_ALEN) != 0 && 330 "candidate " MACSTR 332 MAC2STR(candidate [all...] |
/external/apache-http/src/org/apache/commons/logging/impl/ |
H A D | LogFactoryImpl.java | 856 * 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/skia/src/ports/ |
H A D | SkFontMgr_android.cpp | 222 static int match_score(const SkFontStyle& pattern, const SkFontStyle& candidate) { argument 224 score += abs((pattern.width() - candidate.width()) * 100); 225 score += abs((pattern.isItalic() == candidate.isItalic()) ? 0 : 1000); 226 score += abs(pattern.weight() - candidate.weight());
|
/external/v8/src/ia32/ |
H A D | code-stubs-ia32.h | 324 Register candidate = Register::FromAllocationIndex(i); local 325 if (candidate.is(ecx)) continue; 326 if (candidate.is(r1)) continue; 327 if (candidate.is(r2)) continue; 328 if (candidate.is(r3)) continue; 329 return candidate;
|
/external/v8/src/x64/ |
H A D | code-stubs-x64.h | 298 Register candidate = Register::FromAllocationIndex(i); local 299 if (candidate.is(rcx)) continue; 300 if (candidate.is(r1)) continue; 301 if (candidate.is(r2)) continue; 302 if (candidate.is(r3)) continue; 303 return candidate;
|
/external/v8/src/x87/ |
H A D | code-stubs-x87.h | 313 Register candidate = Register::FromAllocationIndex(i); local 314 if (candidate.is(ecx)) continue; 315 if (candidate.is(r1)) continue; 316 if (candidate.is(r2)) continue; 317 if (candidate.is(r3)) continue; 318 return candidate;
|