| /openbsd/gnu/llvm/clang/include/clang/Sema/ |
| H A D | TypoCorrection.h | 301 virtual bool ValidateCandidate(const TypoCorrection &candidate);
309 virtual unsigned RankCandidate(const TypoCorrection &candidate) { in RankCandidate() argument
310 return (!MatchesTypo(candidate) && ValidateCandidate(candidate)) in RankCandidate()
340 bool MatchesTypo(const TypoCorrection &candidate) { in MatchesTypo() argument
341 return Typo && candidate.isResolved() && !candidate.requiresImport() && in MatchesTypo()
342 candidate.getCorrectionAsIdentifierInfo() == Typo && in MatchesTypo()
345 candidate.getCorrectionSpecifier() == TypoNNS; in MatchesTypo()
368 bool ValidateCandidate(const TypoCorrection &candidate) override { in ValidateCandidate() argument
369 return candidate.getCorrectionDeclAs<C>(); in ValidateCandidate()
385 bool ValidateCandidate(const TypoCorrection &candidate) override;
[all …]
|
| /openbsd/lib/libcrypto/x509/ |
| H A D | x509_verify.c | 575 candidate) == 0) in x509_verify_consider_candidate()
650 X509 *candidate; in x509_verify_build_chains() local
705 is_root, candidate, current_chain, in x509_verify_build_chains()
708 X509_free(candidate); in x509_verify_build_chains()
730 0, candidate, current_chain, in x509_verify_build_chains()
751 char *candidate; in x509_verify_cert_hostname() local
768 if ((len = strlen(candidate)) < 1) { in x509_verify_cert_hostname()
774 if (candidate[0] == '[' && candidate[len - 1] == ']') { in x509_verify_cert_hostname()
775 candidate[len - 1] = '\0'; in x509_verify_cert_hostname()
791 free(candidate); in x509_verify_cert_hostname()
[all …]
|
| H A D | x509_issuer_cache.c | 121 struct x509_issuer candidate, *found; in x509_issuer_cache_find() local
124 memset(&candidate, 0, sizeof(candidate)); in x509_issuer_cache_find()
125 candidate.parent_md = parent_md; in x509_issuer_cache_find()
126 candidate.child_md = child_md; in x509_issuer_cache_find()
134 &candidate)) != NULL) { in x509_issuer_cache_find()
|
| /openbsd/regress/lib/libc/qsort/ |
| H A D | antiqsort.c | 19 static int candidate; /* pivot candidate */ variable
32 if (x == candidate) in cmp()
38 candidate = x; in cmp()
40 candidate = y; in cmp()
51 nsolid = ncmp = candidate = 0; in antiqsort()
|
| /openbsd/gnu/llvm/lldb/packages/Python/lldbsuite/test/ |
| H A D | test_categories.py | 53 candidate = None
57 if candidate:
59 candidate = item
60 return candidate
|
| /openbsd/libexec/ld.so/ |
| H A D | Makefile | 80 candidate= $(PROG).test macro
81 CLEANFILES+= ${candidate}
85 $(CC) -P -x c - -Wl,-dynamic-linker,./$(candidate) -o $@ -lpthread
89 $(LD) -e _dl_start $(ELF_LDFLAGS) -o $(candidate) \
94 $(LD) -e _dl_start $(ELF_LDFLAGS) -o $(candidate) \
98 ${CHECK_LDSO} $(candidate)
103 cp $(candidate) $@
|
| /openbsd/gnu/llvm/llvm/utils/gn/build/ |
| H A D | write_vcsrevision.py | 19 candidate = os.path.join(path, program)
20 if os.path.isfile(candidate) and os.access(candidate, os.X_OK):
21 return candidate
|
| /openbsd/gnu/llvm/compiler-rt/lib/hwasan/ |
| H A D | hwasan_report.cpp | 311 uptr mem = ShadowToMem(reinterpret_cast<uptr>(candidate)); in ShowHeapOrGlobalCandidate()
319 } else if (candidate == left) { in ShowHeapOrGlobalCandidate()
355 candidate == left ? untagged_addr - (info.start + info.size) in ShowHeapOrGlobalCandidate()
357 candidate == left ? "after" : "before", info.size, info.name, in ShowHeapOrGlobalCandidate()
366 untagged_addr, candidate == left ? "after" : "before", mem, in ShowHeapOrGlobalCandidate()
437 tag_t *candidate = nullptr, *left = tag_ptr, *right = tag_ptr; in PrintAddressDescription() local
442 candidate = left; in PrintAddressDescription()
448 candidate = right; in PrintAddressDescription()
457 ShowHeapOrGlobalCandidate(untagged_addr, candidate, left, right); in PrintAddressDescription()
498 if (candidate && num_descriptions_printed == 0) { in PrintAddressDescription()
[all …]
|
| /openbsd/gnu/llvm/llvm/lib/Target/Sparc/ |
| H A D | DelaySlotFiller.cpp | 77 bool delayHasHazard(MachineBasicBlock::iterator candidate,
229 bool Filler::delayHasHazard(MachineBasicBlock::iterator candidate, in delayHasHazard() argument
236 if (candidate->isImplicitDef() || candidate->isKill()) in delayHasHazard()
239 if (candidate->mayLoad()) { in delayHasHazard()
245 if (candidate->mayStore()) { in delayHasHazard()
253 for (unsigned i = 0, e = candidate->getNumOperands(); i!= e; ++i) { in delayHasHazard()
254 const MachineOperand &MO = candidate->getOperand(i); in delayHasHazard()
272 unsigned Opcode = candidate->getOpcode(); in delayHasHazard()
|
| /openbsd/usr.sbin/pkg_add/OpenBSD/LibSpec/ |
| H A D | Build.pm | 72 for my $candidate (@$r) {
73 if (!defined $best || $candidate->is_better($best)) {
74 $best = $candidate;
|
| /openbsd/gnu/llvm/llvm/docs/ |
| H A D | ReleaseProcess.rst | 24 * Test and benchmark each release candidate, comparing to the previous release
29 * Make sure the critical bugs get fixed and merged to the next release candidate
32 should be fixed before the next candidate and what can wait until the next
64 To run the script on a specific release candidate run::
90 * On the final candidate you just need Release builds, and that's the binary
137 candidate. You don't need to fix all the bugs in the test-suite, since they're
186 When the Release Manager sends you the release candidate, download all sources,
192 * Download the current candidate sources from where the release manager points
201 Once the release manages announces that the latest candidate is the good one,
220 If you found regressions or failures when comparing a release candidate with the
[all …]
|
| /openbsd/gnu/llvm/lldb/include/lldb/DataFormatters/ |
| H A D | FormattersContainer.h | 180 bool Get(FormattersMatchCandidate candidate, ValueSP &entry) { in Get() argument
183 if (formatter.first.Matches(candidate)) { in Get()
194 for (const FormattersMatchCandidate &candidate : candidates) { in Get() local
195 if (Get(candidate, entry)) { in Get()
196 if (candidate.IsMatch(entry) == false) { in Get()
|
| /openbsd/gnu/llvm/lldb/source/Plugins/Language/CPlusPlus/ |
| H A D | GenericOptional.cpp | 107 ValueObjectSP candidate = in GetChildAtIndex() local
109 if (candidate) in GetChildAtIndex()
110 val_sp = candidate; in GetChildAtIndex()
|
| /openbsd/gnu/llvm/llvm/utils/ |
| H A D | update_any_test_checks.py | 28 candidate = os.path.join(path, utc_name)
29 if os.path.isfile(candidate):
30 return candidate
|
| /openbsd/gnu/usr.bin/perl/ext/mro/ |
| H A D | mro.xs | 619 GV* candidate; variable
640 candidate = *gvp;
641 assert(candidate);
643 if (SvTYPE(candidate) != SVt_PVGV)
644 gv_init_pvn(candidate, curstash, subname, subname_len,
650 … if (SvTYPE(candidate) == SVt_PVGV && (cand_cv = GvCV(candidate)) && !GvCVGEN(candidate)) {
|
| /openbsd/games/backgammon/backgammon/ |
| H A D | move.c | 268 mvcheck(struct BOARD *incumbent, struct BOARD *candidate) in mvcheck() argument
273 result = cturn * (candidate->b_st[i] - incumbent->b_st[i]); in mvcheck()
282 incumbent->b_st[i] = candidate->b_st[i]; in mvcheck()
283 incumbent->b_fn[i] = candidate->b_fn[i]; in mvcheck()
|
| /openbsd/gnu/llvm/libcxx/benchmarks/algorithms/ |
| H A D | common.h | 66 int candidate = 0; in fillAdversarialQuickSortInput() local
76 if (x == candidate) { in fillAdversarialQuickSortInput()
83 candidate = x; in fillAdversarialQuickSortInput()
85 candidate = y; in fillAdversarialQuickSortInput()
|
| /openbsd/gnu/llvm/clang/utils/ |
| H A D | CmpDriver | 56 candidate = cost(a_0, b)
57 if best is None or candidate < best[0]:
58 best = (candidate, a_0, j)
|
| /openbsd/gnu/llvm/lldb/source/DataFormatters/ |
| H A D | LanguageCategory.cpp | 99 for (auto &candidate : GetHardcodedFinder<ImplSP>()) { in GetHardcoded() local
100 if (auto result = candidate(valobj, use_dynamic, fmt_mgr)) { in GetHardcoded()
|
| /openbsd/gnu/llvm/lldb/source/Plugins/SymbolFile/DWARF/ |
| H A D | SymbolFileDWARFDwo.cpp | 71 if (auto *candidate = in FindSingleCompileUnit() local
75 cu = candidate; in FindSingleCompileUnit()
|
| /openbsd/gnu/gcc/gcc/cp/ |
| H A D | mangle.c | 415 tree candidate; in add_substitution() local
417 for (i = 0; VEC_iterate (tree, G.substitutions, i, candidate); i++) in add_substitution()
419 gcc_assert (!(DECL_P (node) && node == candidate)); in add_substitution()
420 gcc_assert (!(TYPE_P (node) && TYPE_P (candidate) in add_substitution()
421 && same_type_p (node, candidate))); in add_substitution()
638 tree candidate = VEC_index (tree, G.substitutions, i); in find_substitution() local
641 if (decl == candidate in find_substitution()
642 || (TYPE_P (candidate) && type && TYPE_P (type) in find_substitution()
643 && same_type_p (type, candidate)) in find_substitution()
644 || NESTED_TEMPLATE_MATCH (node, candidate)) in find_substitution()
|
| /openbsd/sys/netinet/ |
| H A D | in_pcb.c | 448 u_int16_t first, last, lower, higher, candidate, localport; in in_pcbpickport() local
479 candidate = lower + arc4random_uniform(count); in in_pcbpickport()
485 ++candidate; in in_pcbpickport()
486 if (candidate < lower || candidate > higher) in in_pcbpickport()
487 candidate = lower; in in_pcbpickport()
488 localport = htons(candidate); in in_pcbpickport()
489 } while (in_baddynamic(candidate, so->so_proto->pr_protocol)); in in_pcbpickport()
|
| /openbsd/gnu/usr.bin/gcc/gcc/cp/ |
| H A D | cvt.c | 1085 tree candidate; local
1091 candidate = TREE_TYPE (TREE_TYPE (cand));
1092 if (TREE_CODE (candidate) == REFERENCE_TYPE)
1093 candidate = TREE_TYPE (candidate);
1095 switch (TREE_CODE (candidate))
|
| H A D | mangle.c | 362 tree candidate = VARRAY_TREE (G.substitutions, i); local
364 && node == candidate)
366 && TYPE_P (candidate)
367 && same_type_p (node, candidate)))
588 tree candidate = VARRAY_TREE (G.substitutions, i); local
591 if (decl == candidate
592 || (TYPE_P (candidate) && type && TYPE_P (type)
593 && same_type_p (type, candidate))
594 || NESTED_TEMPLATE_MATCH (node, candidate))
|
| /openbsd/gnu/llvm/lldb/source/Plugins/Language/ObjC/ |
| H A D | NSDictionary.cpp | 497 for (auto &candidate : map) { in NSDictionarySummaryProvider() local
498 if (candidate.first && candidate.first->Match(class_name)) in NSDictionarySummaryProvider()
499 return candidate.second(valobj, stream, options); in NSDictionarySummaryProvider()
583 for (auto &candidate : map) { in NSDictionarySyntheticFrontEndCreator() local
584 if (candidate.first && candidate.first->Match((class_name))) in NSDictionarySyntheticFrontEndCreator()
585 return candidate.second(synth, valobj_sp); in NSDictionarySyntheticFrontEndCreator()
|