| /openbsd-src/sys/dev/pci/drm/ |
| H A D | linux_list_sort.c | 63 struct list_head *sorted; in list_sort() local
74 list_for_each_safe(sorted, next, list) { in list_sort()
76 sorted->next = NULL; in list_sort()
84 sorted = list_sort_merge(accum[logn], sorted, compare, arg); in list_sort()
97 accum[logn] = sorted; in list_sort()
103 sorted = NULL; in list_sort()
105 sorted = list_sort_merge(accum[logn], sorted, compare, arg); in list_sort()
111 list_sort_merge_into(list, accum[max_logn], sorted, compare, arg); in list_sort()
|
| /openbsd-src/regress/sys/net/rtable/fullfeed/ |
| H A D | Makefile | 11 .SUFFIXES: .txt .sorted
12 .txt.sorted:
15 CLEANFILES+= *.sorted
17 ${REGRESS_TARGETS}: ${PROG} ${.TARGET}-fullfeed.sorted
19 sort | diff -u ${.TARGET}-fullfeed.sorted /dev/stdin
|
| /openbsd-src/usr.bin/sort/ |
| H A D | radixsort.c | 58 struct sort_list_item **sorted; member
216 sl->sorted[sl->start_position] = sl->tosort[0]; in run_sort_level_next()
221 sl->sorted[sl->start_position++] = sl->tosort[1]; in run_sort_level_next()
222 sl->sorted[sl->start_position] = sl->tosort[0]; in run_sort_level_next()
224 sl->sorted[sl->start_position++] = sl->tosort[0]; in run_sort_level_next()
225 sl->sorted[sl->start_position] = sl->tosort[1]; in run_sort_level_next()
256 memcpy(sl->sorted + sl->start_position, in run_sort_level_next()
301 memcpy(sl->sorted + sl->start_position, sl->leaves, in run_sort_level_next()
316 slc->sorted = sl->sorted; in run_sort_level_next()
337 slc->sorted = sl->sorted; in run_sort_level_next()
[all …]
|
| /openbsd-src/gnu/llvm/lld/ELF/ |
| H A D | CallGraphSort.cpp | 183 std::vector<int> sorted(clusters.size()); in run() local
187 std::iota(sorted.begin(), sorted.end(), 0); in run()
188 llvm::stable_sort(sorted, [&](int a, int b) { in run()
192 for (int l : sorted) { in run()
217 sorted.clear(); in run()
220 sorted.push_back(i); in run()
221 llvm::stable_sort(sorted, [&](int a, int b) { in run()
227 for (int leader : sorted) { in run()
245 for (int leader : sorted) in run()
|
| /openbsd-src/gnu/llvm/lld/COFF/ |
| H A D | CallGraphSort.cpp | 156 std::vector<int> sorted(clusters.size()); in run() local
160 std::iota(sorted.begin(), sorted.end(), 0); in run()
161 llvm::stable_sort(sorted, [&](int a, int b) { in run()
165 for (int l : sorted) { in run()
190 sorted.clear(); in run()
193 sorted.push_back(i); in run()
194 llvm::stable_sort(sorted, [&](int a, int b) { in run()
202 for (int leader : sorted) { in run()
219 for (int leader : sorted) in run()
|
| /openbsd-src/sys/kern/ |
| H A D | kern_bufq.c | 382 struct bufq_nscan_head sorted; member
419 struct bufq_nscan_head *sorted = &data->sorted; in bufq_nscan_resort() local
428 bufq_simple_nscan(sorted, bp); in bufq_nscan_resort()
441 SIMPLEQ_INIT(&data->sorted); in bufq_nscan_create()
465 struct buf *next = SIMPLEQ_FIRST(&data->sorted); in bufq_nscan_queue()
467 bufq_simple_nscan(&data->sorted, bp); in bufq_nscan_queue()
481 struct bufq_nscan_head *sorted = &data->sorted; in bufq_nscan_dequeue() local
484 if (SIMPLEQ_FIRST(sorted) == NULL) in bufq_nscan_dequeue()
487 bp = SIMPLEQ_FIRST(sorted); in bufq_nscan_dequeue()
489 SIMPLEQ_REMOVE_HEAD(sorted, dsentries); in bufq_nscan_dequeue()
[all …]
|
| /openbsd-src/lib/libcrypto/stack/ |
| H A D | stack.c | 78 sk->sorted = 0; in sk_set_cmp_func()
100 ret->sorted = sk->sorted; in sk_dup()
134 ret->sorted = 0; in sk_new()
165 st->sorted = 0; in sk_insert()
346 st->sorted = 0; in sk_num()
354 if (st && !st->sorted) { in sk_value()
364 st->sorted = 1; in sk_set()
375 if (st->sorted) in sk_sort()
382 /* Lists with zero or one elements are always sorted in sk_sort()
[all...] |
| /openbsd-src/gnu/usr.bin/perl/cpan/CPAN/lib/CPAN/ |
| H A D | Mirrors.pm | 467 my @sorted = sort { $a <=> $b } @$tests;
470 if ( @sorted == 0 ) { undef }
471 elsif ( @sorted == 1 ) { $sorted[0] }
472 elsif ( @sorted % 2 ) { $sorted[ int(@sorted / 2) ] }
474 my $mid_high = int(@sorted/2);
475 ($sorted[$mid_high-1] + $sorted[$mid_high])/2;
|
| /openbsd-src/gnu/llvm/lld/MachO/ |
| H A D | SectionPriorities.cpp | 163 std::vector<int> sorted(clusters.size()); in run() local
168 std::iota(sorted.begin(), sorted.end(), 0); in run()
170 llvm::stable_sort(sorted, [&](int a, int b) { in run()
174 for (int l : sorted) { in run()
199 sorted.clear(); in run()
202 sorted.push_back(i); in run()
203 llvm::stable_sort(sorted, [&](int a, int b) { in run()
214 for (int leader : sorted) { in run()
231 for (int leader : sorted) in run()
|
| /openbsd-src/gnu/usr.bin/perl/lib/ |
| H A D | sort.t | 99 my ($ts, $unsorted, @sorted, $status);
107 @sorted = $dothesort->(sub { substr($a, 0, $RootWidth)
110 $status = checkorder(\@sorted);
118 @sorted = $dothesort->(sub { substr($a, $RootWidth)
120 substr($b, $RootWidth) }, \@sorted);
121 $status = checkequal(\@sorted, $unsorted);
|
| /openbsd-src/gnu/usr.bin/perl/Porting/ |
| H A D | manisort | 35 my @sorted = grep { !$seen{$_}++ }
42 next if ($manifest[$ii] eq $sorted[$ii]);
52 print($OUT join("\n", @sorted), "\n");
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/TextAPI/ |
| H A D | Architecture.def | 14 /// X86 architectures sorted by cpu type and sub type id.
22 /// ARM architectures sorted by cpu sub type id.
36 /// ARM64 architectures sorted by cpu sub type id.
43 /// ARM64_32 architectures sorted by cpu sub type id
|
| /openbsd-src/gnu/llvm/llvm/utils/ |
| H A D | sort_includes.py | 72 local_headers = sorted(set(local_headers))
73 subproject_headers = sorted(set(subproject_headers))
74 llvm_headers = sorted(set(llvm_headers))
75 system_headers = sorted(set(system_headers))
|
| H A D | update_mca_test_checks.py | 155 for prefix in sorted(lresult):
178 for prefix in sorted(lresult):
199 common_to_all = sorted(common_to_all)[0]
366 s = sorted(list(s))
376 block_infos[block_num][block_text] = sorted(list(current_set))
493 for block_text in sorted(block_infos[block_num]):
507 for prefix in sorted(output_blocks):
512 raise Error('unused prefixes: {}'.format(sorted(unused_prefixes)))
|
| /openbsd-src/gnu/llvm/lldb/source/Utility/ |
| H A D | Timer.cpp | 139 std::vector<Stats> sorted; in DumpCategoryTimes() local
146 sorted.push_back(stats); in DumpCategoryTimes()
149 if (sorted.empty()) in DumpCategoryTimes()
153 llvm::sort(sorted, CategoryMapIteratorSortCriterion); in DumpCategoryTimes()
155 for (const auto &stats : sorted) in DumpCategoryTimes()
|
| /openbsd-src/gnu/llvm/libcxx/utils/ |
| H A D | generate_header_tests.py | 128 …toplevel_headers = sorted(str(p.relative_to(include)) for p in include.glob('[a-z]*') if is_he…
129 …experimental_headers = sorted(str(p.relative_to(include)) for p in include.glob('experimental/[a-z…
130 …extended_headers = sorted(str(p.relative_to(include)) for p in include.glob('ext/[a-z]*') if i…
132 …private_headers = sorted(str(p.relative_to(include)) for p in include.rglob('*') if is_header…
|
| /openbsd-src/gnu/llvm/llvm/utils/gn/build/ |
| H A D | sync_source_lists_from_cmake.py | 104 by_rev(sorted(cmake_cpp - gn_cpp), 'add')
105 by_rev(sorted(gn_cpp - cmake_cpp), 'remove')
108 for rev in sorted(changes_by_rev):
111 for gn_file, data in sorted(changes_by_rev[rev].items()):
|
| /openbsd-src/usr.bin/gprof/ |
| H A D | printgprof.c | 385 arctype sorted; in sortchildren() local
396 sorted.arc_childlist = 0; in sortchildren()
403 for ( prevp = &sorted ; in sortchildren()
416 parentp -> children = sorted.arc_childlist; in sortchildren()
424 arctype sorted; in sortparents() local
435 sorted.arc_parentlist = 0; in sortparents()
442 for (prevp = &sorted; prevp->arc_parentlist; in sortparents()
452 childp -> parents = sorted.arc_parentlist; in sortparents()
|
| /openbsd-src/sys/dev/pci/drm/i915/gt/uc/ |
| H A D | selftest_guc_multi_lrc.c | 15 struct intel_engine_cs *sorted[MAX_ENGINE_INSTANCE + 1]; in logical_sort() local
21 sorted[i] = engines[j]; in logical_sort()
26 memcpy(*engines, *sorted, in logical_sort()
|
| /openbsd-src/gnu/usr.bin/binutils-2.17/ld/ |
| H A D | ldgram.y | 427 $$.sorted = none;
433 $$.sorted = none;
439 $$.sorted = by_name;
445 $$.sorted = by_alignment;
451 $$.sorted = by_name_alignment;
457 $$.sorted = by_name;
463 $$.sorted = by_alignment_name;
469 $$.sorted = by_alignment;
475 $$.sorted = by_name;
526 tmp.sorted = none;
|
| /openbsd-src/usr.bin/col/ |
| H A D | col.c | 389 static CHAR *sorted; in flush_line() local
399 sorted = xreallocarray(sorted, in flush_line()
422 sorted[count[c->c_column]++] = *c; in flush_line()
423 c = sorted; in flush_line()
|
| /openbsd-src/usr.sbin/pkg_add/OpenBSD/ |
| H A D | Update.pm | 257 my @sorted = sort {$a->pkgname->{version}->compare($b->pkgname->{version}) } @$locs;
258 if ($sorted[0]->pkgname->{version}->compare($pkgname->{version}) > 0) {
259 return $sorted[0];
261 if ($sorted[-1]->pkgname->{version}->compare($pkgname->{version}) < 0) {
262 return $sorted[-1];
|
| /openbsd-src/gnu/llvm/lldb/scripts/ |
| H A D | analyze-project-deps.py | 201 sorted = [] variable
203 sorted.append((node, incoming_counts[node], outgoing_counts[node]))
204 sorted.sort(key = lambda x: x[1]+x[2])
205 for (node, inc, outg) in sorted:
|
| /openbsd-src/usr.sbin/httpd/ |
| H A D | js.h.in | 12 // make the sorted column bold
14 th2.className = th2 == th ? 'sorted' : 'unsorted');
|
| /openbsd-src/gnu/llvm/llvm/tools/opt-viewer/ |
| H A D | opt-stats.py | 71 for (passname, count) in sorted(bypass.items(), key=operator.itemgetter(1),
76 for (name, count) in sorted(byname.items(), key=operator.itemgetter(1),
|