Home
last modified time | relevance | path

Searched full:sort (Results 1 – 25 of 1022) sorted by relevance

12345678910>>...41

/Linux-v6.6/Documentation/mm/
Dpage_owner.rst101 If you want to sort by the page nums of buf, use the ``-m`` parameter.
106 Sort:
107 -a Sort by memory allocation time.
108 -m Sort by total memory.
109 -p Sort by pid.
110 -P Sort by tgid.
111 -n Sort by task command name.
112 -r Sort by memory release time.
113 -s Sort by stack trace.
114 -t Sort by times (default).
[all …]
/Linux-v6.6/tools/testing/selftests/ftrace/test.d/trigger/
Dtrigger-hist-syntax-errors.tc10 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-v6.6/scripts/
Dmodule.lds.S18 __ksymtab 0 : { *(SORT(___ksymtab+*)) }
19 __ksymtab_gpl 0 : { *(SORT(___ksymtab_gpl+*)) }
20 __kcrctab 0 : { *(SORT(___kcrctab+*)) }
21 __kcrctab_gpl 0 : { *(SORT(___kcrctab_gpl+*)) }
23 .ctors 0 : ALIGN(8) { *(SORT(.ctors.*)) *(.ctors) }
24 .init_array 0 : ALIGN(8) { *(SORT(.init_array.*)) *(.init_array) }
Dsorttable.h5 * 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()
Dnsdeps17 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
Ddiffconfig104 # print items in a but not b (accumulate, sort and print)
109 old.sort()
114 # print items that changed (accumulate, sort, and print)
121 changed.sort()
/Linux-v6.6/tools/perf/Documentation/
Dperf-kvm.txt101 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).
Dperf-report.txt72 --sort=::
73 Sort histogram entries by given key(s) - multiple keys can be specified
74 in CSV format. Following sort keys are available:
123 (i.e. --sort comm,dso,symbol)
125 If --branch-stack option is used, following sort keys are also
139 And default sort keys are changed to comm, dso_from, symbol_from, dso_to
142 When the sort key symbol is specified, columns "IPC" and "IPC Coverage"
150 If the --mem-mode option is used, the following sort keys are also available
166 And the default sort keys are changed to local_weight, mem, sym, dso,
170 If the data file has tracepoint event(s), following (dynamic) sort keys
[all …]
Dperf-top.txt54 --group-sort-idx::
55 Sort the output by the event at the index n in group. If n is invalid,
56 sort by the first event. It can support multiple groups with different
128 --sort::
129 Sort by key(s): pid, comm, dso, symbol, parent, srcline, weight,
131 Please see description of --sort in the perf-report man page.
137 Also it can contain any sort key(s).
139 By default, every sort keys not specified in --field will be appended
286 'cgroup_id' sort key.
302 'cgroup' sort key.
/Linux-v6.6/tools/perf/trace/beauty/tracepoints/
Dx86_msr.sh19 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-v6.6/scripts/coccinelle/api/
Dcheck_bq27xxx_data.cocci84 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-v6.6/tools/perf/util/
Dgenerate-cmdlist.sh14 sort |
28 sort |
43 sort |
58 sort |
/Linux-v6.6/kernel/
Drange.c8 #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-v6.6/tools/testing/selftests/ftrace/test.d/event/
Dsubsystem-enable.tc21 count=`cat trace | grep -v ^# | awk '{ print $5 }' | sort -u | wc -l`
32 count=`cat trace | grep -v ^# | awk '{ print $5 }' | sort -u | wc -l`
43 count=`cat trace | grep -v ^# | awk '{ print $5 }' | sort -u | wc -l`
/Linux-v6.6/tools/perf/scripts/perl/Perf-Trace-Util/lib/Perf/Trace/
DCore.pm39 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-v6.6/lib/
Dlist_sort.c22 /* 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
Dsort.c3 * A fast, small, non-recursive O(n log n) sort for the Linux kernel
17 #include <linux/sort.h>
192 * sort_r - sort an array of elements
193 * @base: pointer to data to sort
222 /* called from 'sort' without swap function, let's pick the default */ in sort_r()
249 else /* Sort complete */ in sort_r()
281 void sort(void *base, size_t num, size_t size, in sort() function
292 EXPORT_SYMBOL(sort);
/Linux-v6.6/tools/lib/
Dlist_sort.c21 /* if equal, take 'a' -- important for sort stability */ in merge()
58 /* if equal, take 'a' -- important for sort stability */ in merge_final()
101 * list_sort - sort a list
103 * @head: the list to sort
106 * The comparison function @cmp must return > 0 if @a should sort after
107 * @b ("@a > @b" if you want an ascending sort), and <= 0 if @a should
108 * sort before @b *or* their original order should be preserved. It is
110 * and list_sort is a stable sort, so it is not necessary to distinguish
/Linux-v6.6/fs/xfs/scrub/
Dxfarray.c438 /* 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()
495 /* 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()
620 /* Sort a bunch of records that all live in the same memory page. */
641 sort(startp, hi - lo + 1, si->array->obj_size, si->cmp_fn, NULL); in xfarray_pagesort()
[all …]
Dxfarray.h57 /* Declarations for xfile array sort functionality. */
71 /* Comparison function for the sort. */
113 * If for a given subset we decide to use an in-memory sort, we use a
135 /* Sort can be interrupted by a fatal signal. */
/Linux-v6.6/drivers/acpi/acpica/
Dnsrepair2.c97 * _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-v6.6/tools/testing/selftests/ftrace/test.d/trigger/inter-event/
Dtrigger-inter-event-combined-hist.tc22 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-v6.6/rust/alloc/
Dslice.rs25 use core::slice::sort;
181 …/// This sort is stable (i.e., does not reorder equal elements) and *O*(*n* \* log(*n*)) worst-cas…
189 /// The current algorithm is an adaptive, iterative merge sort inspired by
195 /// non-allocating insertion sort is used instead.
202 /// v.sort();
209 pub fn sort(&mut self) in sort() method
218 …/// This sort is stable (i.e., does not reorder equal elements) and *O*(*n* \* log(*n*)) worst-cas…
228 /// `partial_cmp` as our sort function when we know the slice doesn't contain a `NaN`.
242 /// The current algorithm is an adaptive, iterative merge sort inspired by
248 /// non-allocating insertion sort is used instead.
[all …]
/Linux-v6.6/drivers/net/wireless/ath/ath9k/
Dcalib.c27 int16_t sort[ATH9K_NF_CAL_HIST_MAX]; in ath9k_hw_get_nf_hist_mid() local
31 sort[i] = nfCalBuffer[i]; in ath9k_hw_get_nf_hist_mid()
35 if (sort[j] > sort[j - 1]) { in ath9k_hw_get_nf_hist_mid()
36 nfval = sort[j]; in ath9k_hw_get_nf_hist_mid()
37 sort[j] = sort[j - 1]; in ath9k_hw_get_nf_hist_mid()
38 sort[j - 1] = nfval; in ath9k_hw_get_nf_hist_mid()
42 nfval = sort[(ATH9K_NF_CAL_HIST_MAX - 1) >> 1]; in ath9k_hw_get_nf_hist_mid()
/Linux-v6.6/tools/perf/
Dbuiltin-kmem.c516 struct sort_dimension *sort; in __page_stat__findnew_alloc() local
524 list_for_each_entry(sort, &page_alloc_sort_input, list) { in __page_stat__findnew_alloc()
525 cmp = sort->cmp(pstat, data); in __page_stat__findnew_alloc()
571 struct sort_dimension *sort; in __page_stat__findnew_caller() local
579 list_for_each_entry(sort, &page_caller_sort_input, list) { in __page_stat__findnew_caller()
580 cmp = sort->cmp(pstat, data); in __page_stat__findnew_caller()
1275 struct sort_dimension *sort; in sort_slab_insert() local
1284 list_for_each_entry(sort, sort_list, list) { in sort_slab_insert()
1285 cmp = sort->cmp(data, this); in sort_slab_insert()
1322 struct sort_dimension *sort; in sort_page_insert() local
[all …]

12345678910>>...41