| /kernel/linux/linux-5.10/drivers/net/wireless/ath/ath9k/ |
| H A D | calib.c | 27 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()
|
| /kernel/linux/linux-6.6/drivers/net/wireless/ath/ath9k/ |
| H A D | calib.c | 27 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()
|
| /kernel/linux/build/test/moduletest/runtest/bin/mem_debug_t/testcases/bin/ |
| H A D | mem_debug08.sh | 33 local pid=$(cat /proc/ashmem_process_info | awk 'NR>3 && $2!="" {print $2}' | sort -u)
34 local line=$(cat /proc/ashmem_process_info | awk 'NR>3 && $2!="" {print $2}' | sort -u | wc -l)
|
| /kernel/linux/linux-5.10/lib/ |
| H A D | test_sort.c | 2 #include <linux/sort.h>
28 sort(a, TEST_LEN, sizeof(*a), cmpint, NULL); in test_sort_init()
|
| H A D | sort.c | 3 * A fast, small, non-recursive O(n log n) sort for the Linux kernel
17 #include <linux/sort.h>
181 * sort_r - sort an array of elements
182 * @base: pointer to data to sort
266 void sort(void *base, size_t num, size_t size, in sort() function
272 EXPORT_SYMBOL(sort); variable
|
| H A D | extable.c | 11 #include <linux/sort.h>
67 sort(start, finish - start, sizeof(struct exception_table_entry), in sort_extable()
|
| /kernel/linux/linux-6.6/lib/ |
| H A D | test_sort.c | 5 #include <linux/sort.h>
30 sort(a, TEST_LEN, sizeof(*a), cmpint, NULL); in test_sort()
|
| H A D | extable.c | 11 #include <linux/sort.h>
66 sort(start, finish - start, sizeof(struct exception_table_entry), in sort_extable()
|
| /kernel/linux/linux-5.10/tools/testing/selftests/net/forwarding/ |
| H A D | ethtool_lib.sh | 67 <(printf '%s\n' "${dev1_speeds[@]}" | sort -u) \
68 <(printf '%s\n' "${dev2_speeds[@]}" | sort -u)
|
| /kernel/linux/linux-6.6/tools/perf/trace/beauty/ |
| H A D | arch_errno_names.sh | 51 |sort -t, -k2 -nu \
79 for arch in $(find $toolsdir/arch -maxdepth 1 -mindepth 1 -type d -printf "%f\n" | sort -r); do
|
| /kernel/linux/linux-5.10/arch/s390/kernel/syscalls/ |
| H A D | syscalltbl | 100 |sort -k1 -n \
145 |sort -k1 -n \
160 |sort -n \
|
| /kernel/linux/linux-6.6/arch/s390/kernel/syscalls/ |
| H A D | syscalltbl | 100 |sort -k1 -n \
145 |sort -k1 -n \
160 |sort -n \
|
| /kernel/linux/linux-5.10/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()
|
| /kernel/linux/linux-5.10/drivers/gpu/drm/i915/gt/ |
| H A D | selftest_gt_pm.c | 8 #include <linux/sort.h>
60 sort(cycles, 5, sizeof(*cycles), cmp_u32, NULL); in measure_clocks()
63 sort(dt, 5, sizeof(*dt), cmp_u64, NULL); in measure_clocks()
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/i915/gt/ |
| H A D | selftest_gt_pm.c | 6 #include <linux/sort.h>
72 sort(cycles, 5, sizeof(*cycles), cmp_u32, NULL); in measure_clocks()
75 sort(dt, 5, sizeof(*dt), cmp_u64, NULL); in measure_clocks()
|
| /kernel/linux/linux-6.6/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()
|
| /kernel/linux/linux-6.6/rust/alloc/ |
| H A D | slice.rs | 25 use core::slice::sort;
181 /// This sort is stable (i.e., does not reorder equal elements) and *O*(*n* \* log(*n*)) worst-case.
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() functions
218 /// This sort is stable (i.e., does not reorder equal elements) and *O*(*n* \* log(*n*)) worst-case.
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 i
[all...] |
| /kernel/linux/linux-5.10/arch/sparc/prom/ |
| H A D | memory.c | 10 #include <linux/sort.h>
79 sort(sp_banks, num_ents, sizeof(struct sparc_phys_banks), in prom_meminit()
|
| /kernel/linux/linux-6.6/arch/sparc/prom/ |
| H A D | memory.c | 10 #include <linux/sort.h>
79 sort(sp_banks, num_ents, sizeof(struct sparc_phys_banks), in prom_meminit()
|
| /kernel/linux/linux-5.10/tools/perf/trace/beauty/ |
| H A D | arch_errno_names.sh | 63 |sort -t, -k2 -nu \
93 for arch in $(find $toolsdir/arch -maxdepth 1 -mindepth 1 -type d -printf "%f\n" | grep -v x86 | sort); do
|
| /kernel/linux/linux-6.6/tools/perf/tests/shell/lib/ |
| H A D | coresight.sh | 104 uniq | sort | uniq)
110 uniq | sort | uniq)
|
| /kernel/linux/linux-6.6/tools/testing/selftests/net/forwarding/ |
| H A D | ethtool_lib.sh | 101 <(printf '%s\n' "${dev1_speeds[@]}" | sort -u) \
102 <(printf '%s\n' "${dev2_speeds[@]}" | sort -u)
|
| /kernel/linux/linux-6.6/tools/perf/ |
| H A D | builtin-mem.c | 325 char sort[128]; in get_sort_order() local
332 strcpy(sort, "--sort=mem,sym,dso,symbol_daddr," in get_sort_order()
335 strcpy(sort, "--sort=local_weight,mem,sym,dso,symbol_daddr," in get_sort_order()
341 strcat(sort, ",phys_daddr"); in get_sort_order()
344 strcat(sort, ",data_page_size"); in get_sort_order()
346 return strdup(sort); in get_sort_order()
|
| H A D | builtin-kmem.c | 516 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
1686 struct sort_dimension *sort; slab_sort_dimension__add() local
1706 struct sort_dimension *sort; page_sort_dimension__add() local
[all...] |
| /kernel/linux/linux-5.10/tools/perf/ |
| H A D | builtin-kmem.c | 493 struct sort_dimension *sort; in __page_stat__findnew_alloc() local
501 list_for_each_entry(sort, &page_alloc_sort_input, list) { in __page_stat__findnew_alloc()
502 cmp = sort->cmp(pstat, data); in __page_stat__findnew_alloc()
548 struct sort_dimension *sort; in __page_stat__findnew_caller() local
556 list_for_each_entry(sort, &page_caller_sort_input, list) { in __page_stat__findnew_caller()
557 cmp = sort->cmp(pstat, data); in __page_stat__findnew_caller()
1253 struct sort_dimension *sort; in sort_slab_insert() local
1262 list_for_each_entry(sort, sort_list, list) { in sort_slab_insert()
1263 cmp = sort->cmp(data, this); in sort_slab_insert()
1300 struct sort_dimension *sort; in sort_page_insert() local
1664 struct sort_dimension *sort; slab_sort_dimension__add() local
1684 struct sort_dimension *sort; page_sort_dimension__add() local
[all...] |