Home
last modified time | relevance | path

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

12345678910>>...21

/linux/tools/perf/util/
H A Drb_resort.h
H A Ddsos.h17 * Collection of DSOs as an array for iteration speed, but sorted for O(n)
25 bool sorted; member
H A Dsymbol-elf.c280 u32 *sorted; member
289 idx = ri->sorted ? ri->sorted[idx] : idx; in get_rel_symidx()
324 size_t sz = sizeof(ri->sorted[0]); in sort_rel()
327 ri->sorted = calloc(ri->nr_entries, sz); in sort_rel()
328 if (!ri->sorted) in sort_rel()
331 ri->sorted[i] = i; in sort_rel()
332 qsort_r(ri->sorted, ri->nr_entries, sz, rel_cmp, ri); in sort_rel()
374 zfree(&ri->sorted); in exit_rel()
434 struct rela_dyn *sorted; member
442 zfree(&di->sorted); in exit_rela_dyn()
[all …]
/linux/drivers/md/bcache/
H A Ddebug.c34 struct bset *ondisk, *sorted, *inmemory; in bch_btree_verify() local
44 sorted = b->c->verify_data->keys.set->data; in bch_btree_verify()
57 bch_bio_map(bio, sorted); in bch_btree_verify()
62 memcpy(ondisk, sorted, KEY_SIZE(&v->key) << 9); in bch_btree_verify()
65 sorted = v->keys.set->data; in bch_btree_verify()
67 if (inmemory->keys != sorted->keys || in bch_btree_verify()
69 sorted->start, in bch_btree_verify()
81 bch_dump_bset(&v->keys, sorted, 0); in bch_btree_verify()
95 if (inmemory->d[j] != sorted->d[j]) in bch_btree_verify()
/linux/Documentation/admin-guide/mm/damon/
H A Dlru_sort.rst16 systems, LRU lists are normally not proactively sorted but partially and
17 reactively sorted for special events including specific user requests, system
225 Number of hot memory regions that tried to be LRU-sorted.
230 Total bytes of hot memory regions that tried to be LRU-sorted.
235 Number of hot memory regions that successfully be LRU-sorted.
240 Total bytes of hot memory regions that successfully be LRU-sorted.
250 Number of cold memory regions that tried to be LRU-sorted.
255 Total bytes of cold memory regions that tried to be LRU-sorted.
260 Number of cold memory regions that successfully be LRU-sorted.
265 Total bytes of cold memory regions that successfully be LRU-sorted.
/linux/fs/bcachefs/
H A Dbtree_write_buffer.c233 darray_resize(&wb->sorted, wb->flushing.keys.size); in move_keys_from_inc_to_flushing()
235 if (!wb->flushing.keys.nr && wb->sorted.size >= wb->inc.keys.nr) { in move_keys_from_inc_to_flushing()
241 wb->sorted.size - wb->flushing.keys.nr); in move_keys_from_inc_to_flushing()
267 BUG_ON(wb->sorted.size < wb->flushing.keys.nr); in move_keys_from_inc_to_flushing()
308 wb->sorted.data[i].idx = i; in bch2_btree_write_buffer_flush_locked()
309 wb->sorted.data[i].btree = wb->flushing.keys.data[i].btree; in bch2_btree_write_buffer_flush_locked()
310 memcpy(&wb->sorted.data[i].pos, &wb->flushing.keys.data[i].k.k.p, sizeof(struct bpos)); in bch2_btree_write_buffer_flush_locked()
312 wb->sorted.nr = wb->flushing.keys.nr; in bch2_btree_write_buffer_flush_locked()
316 * then we attempt to flush in sorted btree order, as this is most in bch2_btree_write_buffer_flush_locked()
328 wb_sort(wb->sorted.data, wb->sorted.nr); in bch2_btree_write_buffer_flush_locked()
[all …]
H A Ddisk_groups.c26 struct bch_disk_group *g, *sorted = NULL; in bch2_sb_disk_groups_validate() local
68 sorted = kmalloc_array(nr_groups, sizeof(*sorted), GFP_KERNEL); in bch2_sb_disk_groups_validate()
69 if (!sorted) in bch2_sb_disk_groups_validate()
72 memcpy(sorted, groups->entries, nr_groups * sizeof(*sorted)); in bch2_sb_disk_groups_validate()
73 sort(sorted, nr_groups, sizeof(*sorted), group_cmp, NULL); in bch2_sb_disk_groups_validate()
75 for (g = sorted; g + 1 < sorted + nr_groups; g++) in bch2_sb_disk_groups_validate()
85 kfree(sorted); in bch2_sb_disk_groups_validate()
/linux/include/linux/
H A Dutil_macros.h26 * find_closest - locate the closest element in a sorted array
28 * @a: The array in which to look for the closest element. Must be sorted
56 * find_closest_descending - locate the closest element in a sorted array
58 * @a: The array in which to look for the closest element. Must be sorted
62 * Similar to find_closest() but 'a' is expected to be sorted in descending
/linux/drivers/net/wireless/intel/iwlwifi/mld/
H A Dmld.c145 /* Please keep this array *SORTED* by hex value.
189 /* Please keep this array *SORTED* by hex value.
203 /* Please keep this array *SORTED* by hex value.
214 /* Please keep this array *SORTED* by hex value.
222 /* Please keep this array *SORTED* by hex value.
243 /* Please keep this array *SORTED* by hex value.
261 /* Please keep this array *SORTED* by hex value.
269 /* Please keep this array *SORTED* by hex value.
281 /* Please keep this array *SORTED* by hex value.
289 /* Please keep this array *SORTED* by hex value.
[all …]
/linux/net/ceph/
H A Dstriper.c48 * Return the last extent with given objno (@object_extents is sorted
93 * Map a file extent to a sorted list of object extents.
104 * To keep @object_extents sorted, successive calls to this function
106 * are mapped using the same @object_extents must be sorted).
160 WARN(1, "%s: object_extents list not sorted!\n", in ceph_file_to_extents()
205 * Reverse map an object extent to a sorted list of file extents.
/linux/kernel/kcsan/
H A Ddebugfs.c47 bool sorted; /* if elements are sorted */ member
112 if (!report_filterlist.sorted) { in kcsan_skip_report_debugfs()
115 report_filterlist.sorted = true; in kcsan_skip_report_debugfs()
183 report_filterlist.sorted = false; in insert_report_filterlist()
/linux/tools/mm/
H A Dslabinfo-gnuplot.sh14 # and generate graphs (totals, slabs sorted by size, slabs sorted
152 `cat "$in" | grep -A "$lines" 'Slabs sorted by loss' |\
161 `cat "$in" | grep -A "$lines" 'Slabs sorted by size' |\
/linux/drivers/md/dm-vdo/indexer/
H A Dradix-sort.c17 * keys to be sorted.
71 /* Insert the next unsorted key into an array of sorted keys. */
77 /* Compare the key to the preceding sorted entries, shifting down ones that are larger. */ in insert_key()
242 /* All zero-length keys are identical and therefore already sorted. */ in uds_radix_sort()
264 * onto the stack for each radix-sorted pile. When all tasks and sub-tasks have been in uds_radix_sort()
266 * sorted. in uds_radix_sort()
/linux/lib/
H A Dextable.c46 * The exception table needs to be sorted so that the binary
72 * If the exception table is sorted, any referring to the module init
109 * already sorted.
/linux/Documentation/kbuild/
H A Dkconfig.rst185 When searching, symbols are sorted thus:
187 - first, exact matches, sorted alphabetically (an exact match
189 - then, other matches, sorted alphabetically.
196 of which only ATH5K and ATH9K match exactly and so are sorted
198 sorted in alphabetical order.
/linux/drivers/gpu/drm/i915/gt/uc/
H A Dselftest_guc_multi_lrc.c15 struct intel_engine_cs *sorted[MAX_ENGINE_INSTANCE + 1]; in logical_sort() local
21 sorted[i] = engines[j]; in logical_sort()
26 memcpy(*engines, *sorted, in logical_sort()
/linux/arch/sh/kernel/
H A Dunwinder.c43 * "unwinder_list" is a linked-list of all available unwinders, sorted
81 * Enqueue the stack unwinder sorted by rating.
106 * Install the new stack unwinder on the unwinder list, which is sorted
/linux/drivers/media/usb/
H A DMakefile6 # DVB USB-only drivers. Please keep it alphabetically sorted by directory name
16 # Please keep it alphabetically sorted by Kconfig name
/linux/scripts/
H A Dcheckkconfigsymbols.py162 for symbol in sorted(undefined_b):
165 files = sorted(undefined_b.get(symbol))
169 files = sorted(undefined_b.get(symbol) -
182 for symbol in sorted(undefined):
185 files = sorted(undefined.get(symbol))
362 for symbol in sorted(referenced_symbols):
/linux/drivers/media/v4l2-core/
H A DMakefile16 # Please keep it alphabetically sorted by Kconfig name
24 # Please keep it alphabetically sorted by Kconfig name
/linux/drivers/comedi/drivers/ni_routing/tools/
H A Dconvert_py_to_csv.py23 fieldnames = [value_to_name[i] for i in sorted(D.keys())]
31 S = sorted(S.items(), key = lambda src_destD : src_destD[0])
/linux/drivers/acpi/acpica/
H A Dnsrepair2.c107 * Names that must be packages, but cannot be sorted:
110 * be moved or sorted. These index values are used for _BQC and _BCM.
466 * Entries (subpackages) in the _CST Package must be sorted by the in acpi_ns_repair_CST()
659 * Entries (subpackages) in the _PSS Package must be sorted by power in acpi_ns_repair_PSS()
661 * incorrectly sorted, sort it. We sort by cpu_frequency, since this in acpi_ns_repair_PSS()
672 * We now know the list is correctly sorted by CPU frequency. Check if in acpi_ns_repair_PSS()
754 * RETURN: Status. AE_OK if the list is valid and is sorted correctly or
757 * DESCRIPTION: Check if the package list is valid and sorted correctly by the
827 * The list must be sorted in the specified order. If we detect a in acpi_ns_check_sorted_list()
842 "%s: Repaired unsorted list - now sorted by %s\n", in acpi_ns_check_sorted_list()
/linux/Documentation/mm/
H A Dslub.rst336 - Slabs sorted by size (up to -N <num> slabs, default 1)
337 - Slabs sorted by loss (up to -N <num> slabs, default 1)
362 - Slabs sorted by size: FOO_STATS-slabs-by-size.png
363 - Slabs sorted by loss: FOO_STATS-slabs-by-loss.png
409 allocated objects. The output is sorted by frequency of each trace.
442 time. The output is sorted by frequency of each trace.
/linux/tools/perf/scripts/python/Perf-Trace-Util/lib/Perf/Trace/
H A DCore.py35 for idx in sorted(flag_fields[event_name][field_name]['values']):
52 for idx in sorted(symbolic_fields[event_name][field_name]['values']):
/linux/drivers/media/rc/
H A DMakefile12 # IR decoders - please keep it alphabetically sorted by Kconfig name
27 # sorted by Kconfig name (e. g. LC_ALL=C sort Makefile)

12345678910>>...21