Home
last modified time | relevance | path

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

12345678910>>...32

/linux/tools/testing/selftests/ftrace/test.d/trigger/
H A 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/tools/perf/
H A Dbuiltin-mem.c24 #include "util/sort.h"
331 char sort[128]; in get_sort_order()
334 scnprintf(sort, sizeof(sort), "--sort=%s", mem->sort_key); in get_sort_order()
336 strcpy(sort, "--sort=mem,snoop,tlb,type"); in get_sort_order()
342 strcpy(sort, "--sort=mem,sym,dso,symbol_daddr," in get_sort_order()
345 strcpy(sort, " in get_sort_order()
332 char sort[128]; get_sort_order() local
[all...]
H A Dbuiltin-kmem.c517 struct sort_dimension *sort; in __page_stat__findnew_alloc()
525 list_for_each_entry(sort, &page_alloc_sort_input, list) { in __page_stat__findnew_alloc()
526 cmp = sort->cmp(pstat, data); in __page_stat__findnew_alloc()
572 struct sort_dimension *sort; in __page_stat__findnew_caller()
580 list_for_each_entry(sort, &page_caller_sort_input, list) { in __page_stat__findnew_caller()
581 cmp = sort->cmp(pstat, data); in __page_stat__findnew_caller()
1291 struct sort_dimension *sort; in sort_slab_insert()
1300 list_for_each_entry(sort, sort_list, list) { in __sort_slab_result()
1301 cmp = sort->cmp(data, this); in __sort_slab_result()
1338 struct sort_dimension *sort; in sort_page_insert()
516 struct sort_dimension *sort; __page_stat__findnew_alloc() local
571 struct sort_dimension *sort; __page_stat__findnew_caller() local
1268 struct sort_dimension *sort; sort_slab_insert() local
1315 struct sort_dimension *sort; sort_page_insert() local
1679 struct sort_dimension *sort; slab_sort_dimension__add() local
1699 struct sort_dimension *sort; page_sort_dimension__add() local
[all...]
H A Dbuiltin-diff.c6 * DSOs and symbol information, sort them and produce a diff.
18 #include "util/sort.h"
460 * period in order to sort entries by percentage delta. in diff__process_sample_event()
579 bh->block_fmt.sort = block_sort; in init_block_hist()
1001 /* Don't sort callchain for perf diff */ in data_process()
1279 OPT_STRING('s', "sort", &sort_order, "key[,key2...]",
1280 "sort by key(s): pid, comm, dso, symbol, parent, cpu, srcline, ..."
1742 fmt->sort = hist_entry__cmp_baseline; in data__hpp_register()
1746 fmt->sort = hist_entry__cmp_delta; in data__hpp_register()
1750 fmt->sort in data__hpp_register()
[all...]
/linux/scripts/
H A Dmodule.lds.S17 __ksymtab 0 : ALIGN(8) { *(SORT(___ksymtab+*)) }
18 __kcrctab 0 : ALIGN(4) { *(SORT(___kcrctab+*)) }
19 __kflagstab 0 : ALIGN(1) { *(SORT(___kflagstab+*)) }
21 .ctors 0 : ALIGN(8) { *(SORT(.ctors.*)) *(.ctors) }
22 .init_array 0 : ALIGN(8) { *(SORT(.init_array.*)) *(.init_array) }
H A Dnsdeps17 if ! { echo "$SPATCH_REQ_VERSION"; echo "$SPATCH_VERSION"; } | sort -CV ; then
36 # sort the imports
40 cat $source_file | grep MODULE_IMPORT_NS | LC_ALL=C sort -u >> ${source_file}.tmp
H A 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()
H A Ddev-needs.sh311 # Can NOT combine sort and uniq using sort -suk2 because stable sort in toybox
313 dev_to_detail | sort -k2 -k1 | uniq -f 1 | sort | cut -f2-
/linux/tools/perf/Documentation/
H A 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).
H A Dperf-report.txt87 --sort=::
88 Sort histogram entries by given key(s) - multiple keys can be specified
89 in CSV format. Following sort keys are available:
152 (i.e. --sort overhead,comm,dso,symbol).
154 If --branch-stack option is used, following sort keys are also
168 And default sort keys are changed to comm, dso_from, symbol_from, dso_to
171 When the sort key symbol is specified, columns "IPC" and "IPC Coverage"
179 If the --mem-mode option is used, the following sort keys are also available
195 And the default sort keys are changed to local_weight, mem, sym, dso,
199 If the data file has tracepoint event(s), following (dynamic) sort key
[all...]
H A Dperf-top.txt58 --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 …]
H A Dperf-mem.txt100 --sort=<key>::
119 And the default sort keys are changed to local_weight, mem, sym, dso,
141 the debug information and it will change the default sort keys to:
179 sort keys ("mem" and "snoop"). So unlike other fields and sort keys, they'll
180 behave differently when it's used by -F/--fields or -s/--sort.
193 But using the same name for sort keys will aggregate samples for each type
H A Dperf-kwork.txt99 --sort::
100 Sort by key(s): runtime, max, count
133 --sort::
134 Sort by key(s): avg, max, count
205 --sort::
206 Sort by key(s): rate, runtime, tid
H A Dperf-kmem.txt46 --sort=<key[,key2...]>::
47 Sort the output (default: 'frag,hit,bytes' for slab and 'bytes,hit'
48 for page). Available sort keys are 'ptr, callsite, bytes, hit,
/linux/drivers/md/dm-vdo/indexer/
H A Dradix-sort.h10 * 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/tools/perf/trace/beauty/tracepoints/
H A 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/scripts/coccinelle/api/
H A 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/tools/lib/
H A Dlist_sort.c19 /* if equal, take 'a' -- important for sort stability */ in merge()
55 /* if equal, take 'a' -- important for sort stability */ in merge_final()
89 * list_sort - sort a list
91 * @head: the list to sort
94 * The comparison function @cmp must return > 0 if @a should sort after
95 * @b ("@a > @b" if you want an ascending sort), and <= 0 if @a should
96 * sort before @b *or* their original order should be preserved. It is
98 * and list_sort is a stable sort, so it is not necessary to distinguish
/linux/lib/
H A Dsort.c3 * A fast, small, non-recursive O(n log n) sort for the Linux kernel
15 #include <linux/sort.h>
205 /* called from 'sort' without swap function, let's pick the default */ in __sort_r()
237 } else { /* Sort complete */ in __sort_r()
278 * sort_r - sort an array of elements
279 * @base: pointer to data to sort
313 * sort_r_nonatomic - sort an array of elements, with cond_resched
314 * @base: pointer to data to sort
333 void sort(void *base, size_t num, size_t size, in sort() function
344 EXPORT_SYMBOL(sort);
/linux/kernel/
H A 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/tools/perf/scripts/perl/Perf-Trace-Util/lib/Perf/Trace/
H A 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/tools/testing/selftests/ftrace/test.d/trigger/inter-event/
H A 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/fs/xfs/scrub/
H A 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()
497 /* Should this sort be terminated by a fatal signal? */
516 /* Do we want an in-memory sort? */
537 * Sort a small number of array records using scratchpad memory. The records
559 sort(scratch, hi - lo + 1, si->array->obj_size, si->cmp_fn, NULL); in xfarray_isort()
566 * Sort the records from lo to hi (inclusive) if they are all backed by the
596 sort(startp, hi - lo + 1, si->array->obj_size, si->cmp_fn, NULL); in xfarray_foliosort()
[all …]
/linux/tools/perf/util/
H A Dsort.c2 #include "sort.h"
115 /* --sort pid */
151 /* --sort tgid */
188 /* --sort simd */ in sort__simd_cmp()
243 /* --sort comm */ in sort__comm_collapse()
284 /* --sort comm_nodigit */ in _sort__dso_cmp()
393 /* --sort dso */ in _hist_entry__sym_snprintf()
457 /* --sort symbol */
585 /* --sort symoff */ in sort__srcline_from_collapse()
631 /* --sort srclin in sort__srcline_to_collapse()
[all...]
/linux/include/linux/ceph/
H A Dceph_frag.h16 * values logically sort.
19 * can't sort encoded frags numerically. However, it does allow you
70 * comparator to sort frags logically, as when traversing the

12345678910>>...32