| /linux-6.12.1/drivers/md/dm-vdo/indexer/ |
| D | radix-sort.c | 6 #include "radix-sort.h"
20 /* Piles smaller than this are handled with a simple insertion sort. */
23 /* Sort keys are pointers to immutable fixed-length arrays of bytes. */
46 /* Pointer to the first key to sort. */
48 /* Pointer to the last key to sort. */
52 /* The number of bytes remaining in the sort keys. */
87 * Sort a range of key segments using an insertion sort. This simple sort is faster than the
88 * 256-way radix sort when the number of keys to sort is small.
118 * Count the number of times each byte value appears in the arrays of keys to sort at the current
157 * After the keys are moved to the appropriate pile, we'll need to sort each of the piles by the
[all …]
|
| D | radix-sort.h | 10 * Radix sort is implemented using an American Flag sort, an unstable, in-place 8-bit radix
11 * exchange sort. This is adapted from the algorithm in the paper by Peter M. McIlroy, Keith
12 * Bostic, and M. Douglas McIlroy, "Engineering Radix Sort".
|
| /linux-6.12.1/Documentation/mm/ |
| D | page_owner.rst | 149 If you want to sort by the page nums of buf, use the ``-m`` parameter.
154 Sort:
155 -a Sort by memory allocation time.
156 -m Sort by total memory.
157 -p Sort by pid.
158 -P Sort by tgid.
159 -n Sort by task command name.
160 -r Sort by memory release time.
161 -s Sort by stack trace.
162 -t Sort by times (default).
[all …]
|
| /linux-6.12.1/tools/testing/selftests/ftrace/test.d/trigger/ |
| D | trigger-hist-syntax-errors.tc | 10 check_error 'hist:keys=common_pid:vals=bytes_req:sort=common_pid,^junk' # INVALID_SORT_FIELD
11 check_error 'hist:keys=common_pid:vals=bytes_req:^sort=' # EMPTY_ASSIGNMENT
12 check_error 'hist:keys=common_pid:vals=bytes_req:^sort=common_pid,' # EMPTY_SORT_FIELD
13 check_error 'hist:keys=common_pid:vals=bytes_req:sort=common_pid.^junk' # INVALID_SORT_MODIFIER
14 check_error 'hist:keys=common_pid:vals=bytes_req,bytes_alloc:^sort=common_pid,bytes_req,bytes_alloc…
|
| /linux-6.12.1/tools/perf/ |
| D | builtin-mem.c | 22 #include "util/sort.h"
328 char sort[128]; in get_sort_order() local
331 scnprintf(sort, sizeof(sort), "--sort=%s", mem->sort_key); in get_sort_order()
333 strcpy(sort, "--sort=mem,snoop,tlb,type"); in get_sort_order()
339 strcpy(sort, "--sort=mem,sym,dso,symbol_daddr," in get_sort_order()
342 strcpy(sort, "--sort=local_weight,mem,sym,dso,symbol_daddr," in get_sort_order()
348 strcat(sort, ",phys_daddr"); in get_sort_order()
351 strcat(sort, ",data_page_size"); in get_sort_order()
353 /* make sure it has 'type' sort key even -s option is used */ in get_sort_order()
354 if (mem->data_type && !strstr(sort, "type")) in get_sort_order()
[all …]
|
| /linux-6.12.1/scripts/ |
| D | module.lds.S | 21 __ksymtab 0 : { *(SORT(___ksymtab+*)) }
22 __ksymtab_gpl 0 : { *(SORT(___ksymtab_gpl+*)) }
23 __kcrctab 0 : { *(SORT(___kcrctab+*)) }
24 __kcrctab_gpl 0 : { *(SORT(___kcrctab_gpl+*)) }
26 .ctors 0 : ALIGN(8) { *(SORT(.ctors.*)) *(.ctors) }
27 .init_array 0 : ALIGN(8) { *(SORT(.init_array.*)) *(.init_array) }
|
| D | sorttable.h | 5 * Added ORC unwind tables sort support and other updates:
211 /* Sort the addresses stored between __start_mcount_loc to __stop_mcount_loc in vmlinux */
370 /* create thread to sort ORC unwind tables concurrently */ in do_sort()
383 "incomplete mcount's sort in file: %s\n", in do_sort()
388 /* create thread to sort mcount_loc concurrently */ in do_sort()
464 /* wait for ORC tables sort done */ in do_sort()
473 "failed to sort ORC tables '%s': %s\n", in do_sort()
482 /* wait for mcount sort done */ in do_sort()
491 "failed to sort mcount '%s': %s\n", in do_sort()
|
| D | nsdeps | 17 if ! { echo "$SPATCH_REQ_VERSION"; echo "$SPATCH_VERSION"; } | sort -CV ; then
42 # sort the imports
46 cat $source_file | grep MODULE_IMPORT_NS | LC_ALL=C sort -u >> ${source_file}.tmp
|
| /linux-6.12.1/tools/perf/Documentation/ |
| D | perf-kvm.txt | 101 Sorting key. Possible values: sample (default, sort by samples
102 number), percent_sample (sort by sample percentage), time
103 (sort by average time), precent_time (sort by time percentage),
104 max_t (sort by maximum time), min_t (sort by minimum time), mean_t
105 (sort by mean time).
141 Sorting key. Possible values: sample (default, sort by samples
142 number), time (sort by average time).
|
| D | perf-report.txt | 72 --sort=::
73 Sort histogram entries by given key(s) - multiple keys can be specified
74 in CSV format. Following sort keys are available:
129 (i.e. --sort comm,dso,symbol)
131 If --branch-stack option is used, following sort keys are also
145 And default sort keys are changed to comm, dso_from, symbol_from, dso_to
148 When the sort key symbol is specified, columns "IPC" and "IPC Coverage"
156 If the --mem-mode option is used, the following sort keys are also available
172 And the default sort keys are changed to local_weight, mem, sym, dso,
176 If the data file has tracepoint event(s), following (dynamic) sort keys
[all …]
|
| D | perf-top.txt | 58 --group-sort-idx::
59 Sort the output by the event at the index n in group. If n is invalid,
60 sort by the first event. It can support multiple groups with different
132 --sort::
133 Sort by key(s): pid, comm, dso, symbol, parent, srcline, weight,
135 Please see description of --sort in the perf-report man page.
141 Also it can contain any sort key(s).
143 By default, every sort keys not specified in --field will be appended
270 Enable hierarchical output. In the hierarchy mode, each sort key groups
272 level sort key.
[all …]
|
| D | perf-kwork.txt | 99 --sort::
100 Sort by key(s): runtime, max, count
133 --sort::
134 Sort by key(s): avg, max, count
202 --sort::
203 Sort by key(s): rate, runtime, tid
|
| /linux-6.12.1/tools/perf/trace/beauty/tracepoints/ |
| D | x86_msr.sh | 19 sed -r "s/$regex/\2 \1/g" | sort -n | \
26 grep -E $regex ${x86_msr_index} | sed -r "s/$regex/\2/g" | sort -n | head -1
29 sed -r "s/$regex/\2 \1/g" | grep -E -vw 'K6_WHCR' | sort -n | \
35 grep -E $regex ${x86_msr_index} | sed -r "s/$regex/\2/g" | sort -n | head -1
38 sed -r "s/$regex/\2 \1/g" | sort -n | \
|
| /linux-6.12.1/lib/ |
| D | test_sort.c | 5 #include <linux/sort.h>
30 sort(a, TEST_LEN, sizeof(*a), cmpint, NULL); in test_sort()
42 sort(a, TEST_LEN - 1, sizeof(*a), cmpint, NULL); in test_sort()
60 MODULE_DESCRIPTION("sort() KUnit test suite");
|
| D | list_sort.c | 22 /* if equal, take 'a' -- important for sort stability */ in merge()
59 /* if equal, take 'a' -- important for sort stability */ in merge_final()
102 * list_sort - sort a list
104 * @head: the list to sort
107 * The comparison function @cmp must return > 0 if @a should sort after
108 * @b ("@a > @b" if you want an ascending sort), and <= 0 if @a should
109 * sort before @b *or* their original order should be preserved. It is
111 * and list_sort is a stable sort, so it is not necessary to distinguish
|
| D | sort.c | 3 * A fast, small, non-recursive O(n log n) sort for the Linux kernel
15 #include <linux/sort.h>
190 * sort_r - sort an array of elements
191 * @base: pointer to data to sort
221 /* called from 'sort' without swap function, let's pick the default */ in sort_r()
253 } else { /* Sort complete */ in sort_r()
291 void sort(void *base, size_t num, size_t size, in sort() function
302 EXPORT_SYMBOL(sort);
|
| /linux-6.12.1/scripts/coccinelle/api/ |
| D | check_bq27xxx_data.cocci | 84 List.sort compare i1regs_vals = List.sort compare i2regs_vals
120 List.sort compare i1dmregs_vals = List.sort compare i2dmregs_vals
156 List.sort compare i1props_vals = List.sort compare i2props_vals
|
| /linux-6.12.1/tools/perf/util/ |
| D | generate-cmdlist.sh | 14 sort |
28 sort |
43 sort |
58 sort |
|
| /linux-6.12.1/tools/lib/ |
| D | list_sort.c | 21 /* if equal, take 'a' -- important for sort stability */ in merge()
57 /* if equal, take 'a' -- important for sort stability */ in merge_final()
91 * list_sort - sort a list
93 * @head: the list to sort
96 * The comparison function @cmp must return > 0 if @a should sort after
97 * @b ("@a > @b" if you want an ascending sort), and <= 0 if @a should
98 * sort before @b *or* their original order should be preserved. It is
100 * and list_sort is a stable sort, so it is not necessary to distinguish
|
| /linux-6.12.1/kernel/ |
| D | range.c | 8 #include <linux/sort.h>
155 /* sort them */ in clean_sort_range()
156 sort(range, nr_range, sizeof(struct range), cmp_range, NULL); in clean_sort_range()
163 /* sort them */ in sort_range()
164 sort(range, nr_range, sizeof(struct range), cmp_range, NULL); in sort_range()
|
| /linux-6.12.1/tools/testing/selftests/ftrace/test.d/event/ |
| D | subsystem-enable.tc | 21 count=`head -n 100 trace | grep -v ^# | awk '{ print $5 }' | sort -u | wc -l`
32 count=`head -n 100 trace | grep -v ^# | awk '{ print $5 }' | sort -u | wc -l`
43 count=`head -n 100 trace | grep -v ^# | awk '{ print $5 }' | sort -u | wc -l`
|
| /linux-6.12.1/tools/perf/scripts/perl/Perf-Trace-Util/lib/Perf/Trace/ |
| D | Core.pm | 39 foreach my $idx (sort {$a <=> $b} keys %trace_flags) {
69 foreach my $idx (sort {$a <=> $b} keys %{$flag_fields{$event_name}{$field_name}{"values"}}) {
109 foreach my $idx (sort {$a <=> $b} keys %{$flag_fields{$event}{$field}{"values"}}) {
121 foreach my $idx (sort {$a <=> $b} keys %{$symbolic_fields{$event_name}{$field_name}{"values"}}) {
155 foreach my $idx (sort {$a <=> $b} keys %{$symbolic_fields{$event}{$field}{"values"}}) {
|
| /linux-6.12.1/drivers/acpi/acpica/ |
| D | nsrepair2.c | 97 * _ALR: Sort the list ascending by ambient_illuminance
99 * _CST: Sort the list ascending by C state type
104 * _PSS: Sort the list descending by Power
105 * _TSS: Sort the list descending by Power
213 * DESCRIPTION: Repair for the _ALR object. If necessary, sort the object list
401 * 1. Sort the list ascending by C state type
638 * DESCRIPTION: Repair for the _PSS object. If necessary, sort the object list
661 * incorrectly sorted, sort it. We sort by cpu_frequency, since this in acpi_ns_repair_PSS()
708 * DESCRIPTION: Repair for the _TSS object. If necessary, sort the object list
722 * We can only sort the _TSS return package if there is no _PSS in the in acpi_ns_repair_TSS()
[all …]
|
| /linux-6.12.1/tools/testing/selftests/ftrace/test.d/trigger/inter-event/ |
| D | trigger-inter-event-combined-hist.tc | 22 echo 'hist:keys=pid,lat:sort=pid,lat' > events/synthetic/waking_latency/trigger
29 echo 'hist:keys=pid,lat:sort=pid,lat:ww_lat=$waking_lat+$wakeup_lat:onmatch(synthetic.wakeup_latenc…
30 echo 'hist:keys=pid,lat:sort=pid,lat' >> events/synthetic/waking_plus_wakeup_latency/trigger
|
| /linux-6.12.1/fs/xfs/scrub/ |
| D | xfarray.c | 438 /* Allocate memory to handle the sort. */
453 * fewer than 9 items. Make sure the in-memory sort will always take in xfarray_sortinfo_alloc()
462 * sort will always take care of the last few levels of recursion for in xfarray_sortinfo_alloc()
472 /* Scratchpad for in-memory sort, or finding the pivot */ in xfarray_sortinfo_alloc()
498 /* Should this sort be terminated by a fatal signal? */
517 /* Do we want an in-memory sort? */
538 * Sort a small number of array records using scratchpad memory. The records
560 sort(scratch, hi - lo + 1, si->array->obj_size, si->cmp_fn, NULL); in xfarray_isort()
567 * Sort the records from lo to hi (inclusive) if they are all backed by the
597 sort(startp, hi - lo + 1, si->array->obj_size, si->cmp_fn, NULL); in xfarray_foliosort()
[all …]
|