/linux/drivers/md/dm-vdo/indexer/ |
H A 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 …]
|
H A 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/Documentation/mm/ |
H A 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/tools/perf/ |
H A D | builtin-mem.c | 23 #include "util/sort.h" 329 char sort[128]; in get_sort_order() 332 scnprintf(sort, sizeof(sort), "--sort=%s", mem->sort_key); in get_sort_order() 334 strcpy(sort, "--sort=mem,snoop,tlb,type"); in get_sort_order() 340 strcpy(sort, "--sort=mem,sym,dso,symbol_daddr," in get_sort_order() 343 strcpy(sort, " in get_sort_order() 328 char sort[128]; get_sort_order() local [all...] |
/linux/tools/testing/selftests/ftrace/test.d/trigger/ |
H A 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/scripts/ |
H A D | module.lds.S | 22 __ksymtab 0 : ALIGN(8) { *(SORT(___ksymtab+*)) } 23 __ksymtab_gpl 0 : ALIGN(8) { *(SORT(___ksymtab_gpl+*)) } 24 __kcrctab 0 : ALIGN(4) { *(SORT(___kcrctab+*)) } 25 __kcrctab_gpl 0 : ALIGN(4) { *(SORT(___kcrctab_gpl+*)) } 27 .ctors 0 : ALIGN(8) { *(SORT(.ctors.*)) *(.ctors) } 28 .init_array 0 : ALIGN(8) { *(SORT(.init_array.*)) *(.init_array) }
|
H A D | nsdeps | 17 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 D | diffconfig | 104 # 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/tools/perf/Documentation/ |
H A 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).
|
H A 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 …]
|
H A 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/tools/perf/trace/beauty/tracepoints/ |
H A 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/scripts/coccinelle/api/ |
H A 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/lib/ |
H A 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");
|
H A 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 228 /* called from 'sort' without swap function, let's pick the default */ in sort_r() 260 } else { /* Sort complete */ in sort_r() 298 void sort(void *base, size_t num, size_t size, in sort() 309 EXPORT_SYMBOL(sort); 291 void sort(void *base, size_t num, size_t size, sort() function
|
/linux/tools/perf/util/ |
H A D | generate-cmdlist.sh | 14 sort | 28 sort | 43 sort | 58 sort |
|
/linux/tools/lib/ |
H A D | list_sort.c | 19 /* 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/kernel/ |
H A 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/tools/perf/scripts/perl/Perf-Trace-Util/lib/Perf/Trace/ |
H A 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/drivers/acpi/acpica/ |
H A 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/tools/testing/selftests/ftrace/test.d/event/ |
H A 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/fs/xfs/scrub/ |
H A 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 …]
|
/linux/tools/testing/selftests/ftrace/test.d/trigger/inter-event/ |
H A 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/kernel/trace/ |
H A D | tracing_map.h | 101 * struct tracing_map_sort_key is used to drive the sort at any given 104 * whether the sort currently being performed is a primary or a 105 * secondary sort. 107 * The sort key is very simple, consisting of the field index of the 108 * tracing_map_elt field to sort on (which the user saved when adding 109 * the field), and whether the sort should be done in an ascending or
|
/linux/include/linux/ceph/ |
H A D | ceph_frag.h | 16 * 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
|