| /linux-6.8/tools/perf/util/ |
| D | rb_resort.h | 15 * fields to be present in each of the entries in the new, sorted, rb_tree.
19 * the rb_tree used as a source for the entries to be sorted:
76 static void __name##_sorted__insert(struct __name##_sorted *sorted, \
79 struct rb_node **p = &sorted->entries.rb_node, *parent = NULL; \
88 rb_insert_color(sorted_nd, &sorted->entries); \
91 static void __name##_sorted__sort(struct __name##_sorted *sorted, \
97 struct __name##_sorted_entry *snd = &sorted->nd[i++]; \
99 __name##_sorted__insert(sorted, &snd->rb_node); \
106 struct __name##_sorted *sorted; \
107 sorted = malloc(sizeof(*sorted) + sizeof(sorted->nd[0]) * nr_entries); \
[all …]
|
| D | symbol-elf.c | 336 u32 *sorted; member
345 idx = ri->sorted ? ri->sorted[idx] : idx; in get_rel_symidx()
380 size_t sz = sizeof(ri->sorted[0]); in sort_rel()
383 ri->sorted = calloc(ri->nr_entries, sz); in sort_rel()
384 if (!ri->sorted) in sort_rel()
387 ri->sorted[i] = i; in sort_rel()
388 qsort_r(ri->sorted, ri->nr_entries, sz, rel_cmp, ri); in sort_rel()
430 zfree(&ri->sorted); in exit_rel()
490 struct rela_dyn *sorted; member
498 zfree(&di->sorted); in exit_rela_dyn()
[all …]
|
| /linux-6.8/include/linux/ |
| D | util_macros.h | 21 * find_closest - locate the closest element in a sorted array
23 * @a: The array in which to look for the closest element. Must be sorted
32 * find_closest_descending - locate the closest element in a sorted array
34 * @a: The array in which to look for the closest element. Must be sorted
38 * Similar to find_closest() but 'a' is expected to be sorted in descending
|
| /linux-6.8/drivers/md/bcache/ |
| D | debug.c | 34 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-6.8/fs/bcachefs/ |
| D | btree_write_buffer.c | 208 darray_resize(&wb->sorted, wb->flushing.keys.size); in move_keys_from_inc_to_flushing()
210 if (!wb->flushing.keys.nr && wb->sorted.size >= wb->inc.keys.nr) { in move_keys_from_inc_to_flushing()
216 wb->sorted.size - wb->flushing.keys.nr); in move_keys_from_inc_to_flushing()
242 BUG_ON(wb->sorted.size < wb->flushing.keys.nr); in move_keys_from_inc_to_flushing()
263 wb->sorted.data[i].idx = i; in bch2_btree_write_buffer_flush_locked()
264 wb->sorted.data[i].btree = wb->flushing.keys.data[i].btree; in bch2_btree_write_buffer_flush_locked()
265 memcpy(&wb->sorted.data[i].pos, &wb->flushing.keys.data[i].k.k.p, sizeof(struct bpos)); in bch2_btree_write_buffer_flush_locked()
267 wb->sorted.nr = wb->flushing.keys.nr; in bch2_btree_write_buffer_flush_locked()
271 * then we attempt to flush in sorted btree order, as this is most in bch2_btree_write_buffer_flush_locked()
283 wb_sort(wb->sorted.data, wb->sorted.nr); in bch2_btree_write_buffer_flush_locked()
[all …]
|
| D | disk_groups.c | 27 struct bch_disk_group *g, *sorted = NULL; in bch2_sb_disk_groups_validate() local
69 sorted = kmalloc_array(nr_groups, sizeof(*sorted), GFP_KERNEL); in bch2_sb_disk_groups_validate()
70 if (!sorted) in bch2_sb_disk_groups_validate()
73 memcpy(sorted, groups->entries, nr_groups * sizeof(*sorted)); in bch2_sb_disk_groups_validate()
74 sort(sorted, nr_groups, sizeof(*sorted), group_cmp, NULL); in bch2_sb_disk_groups_validate()
76 for (g = sorted; g + 1 < sorted + nr_groups; g++) in bch2_sb_disk_groups_validate()
86 kfree(sorted); in bch2_sb_disk_groups_validate()
|
| D | btree_iter.c | 1004 btree_path_idx_t idx = trans->sorted[i]; in bch2_btree_path_traverse_all()
1539 btree_path_idx_t *sorted = p; in btree_paths_realloc() local
1540 memcpy(sorted, trans->sorted, trans->nr_sorted * sizeof(btree_path_idx_t)); in btree_paths_realloc()
1550 rcu_assign_pointer(trans->sorted, sorted); in btree_paths_realloc()
2594 BUG_ON(trans->sorted[path->sorted_idx] != i); in btree_trans_verify_sorted_refs()
2598 unsigned idx = trans->sorted[i]; in btree_trans_verify_sorted_refs()
2638 * mostly sorted. in __bch2_btree_trans_sort_paths()
2646 if (btree_path_cmp(trans->paths + trans->sorted[i], in __bch2_btree_trans_sort_paths()
2647 trans->paths + trans->sorted[i + 1]) > 0) { in __bch2_btree_trans_sort_paths()
2648 swap(trans->sorted[i], trans->sorted[i + 1]); in __bch2_btree_trans_sort_paths()
[all …]
|
| /linux-6.8/Documentation/admin-guide/mm/damon/ |
| D | lru_sort.rst | 16 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-6.8/kernel/kcsan/ |
| D | debugfs.c | 47 bool sorted; /* if elements are sorted */ member
53 .sorted = false,
118 if (!report_filterlist.sorted) { in kcsan_skip_report_debugfs()
121 report_filterlist.sorted = true; in kcsan_skip_report_debugfs()
186 report_filterlist.sorted = false; in insert_report_filterlist()
|
| /linux-6.8/net/ceph/ |
| D | striper.c | 48 * 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-6.8/tools/mm/ |
| D | slabinfo-gnuplot.sh | 14 # 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-6.8/lib/ |
| D | extable.c | 46 * 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-6.8/drivers/media/pci/ |
| D | Makefile | 6 # Please keep it alphabetically sorted by directory
22 # Please keep it alphabetically sorted by Kconfig name
|
| /linux-6.8/drivers/gpu/drm/i915/gt/uc/ |
| D | selftest_guc_multi_lrc.c | 15 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-6.8/drivers/media/platform/ |
| D | Makefile | 6 # Place here, alphabetically sorted by directory
34 # Please keep it alphabetically sorted by Kconfig name
|
| /linux-6.8/drivers/media/usb/ |
| D | Makefile | 6 # DVB USB-only drivers. Please keep it alphabetically sorted by directory name
16 # Please keep it alphabetically sorted by Kconfig name
|
| /linux-6.8/Documentation/devicetree/bindings/spi/ |
| D | spi-sprd.txt | 11 - clocks: List of clock input name strings sorted in the same order
20 sorted in the same order as the dma-names property.
|
| /linux-6.8/arch/sh/kernel/ |
| D | unwinder.c | 43 * "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-6.8/drivers/comedi/drivers/ni_routing/tools/ |
| D | convert_py_to_csv.py | 23 fieldnames = [value_to_name[i] for i in sorted(D.keys())]
31 S = sorted(S.items(), key = lambda src_destD : src_destD[0])
|
| /linux-6.8/drivers/media/v4l2-core/ |
| D | Makefile | 16 # Please keep it alphabetically sorted by Kconfig name
24 # Please keep it alphabetically sorted by Kconfig name
|
| /linux-6.8/scripts/ |
| D | checkkconfigsymbols.py | 162 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-6.8/Documentation/kbuild/ |
| D | kconfig.rst | 209 When searching, symbols are sorted thus:
211 - first, exact matches, sorted alphabetically (an exact match
213 - then, other matches, sorted alphabetically.
220 of which only ATH5K and ATH9K match exactly and so are sorted
222 sorted in alphabetical order.
|
| /linux-6.8/drivers/acpi/acpica/ |
| D | nsrepair2.c | 107 * 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-6.8/tools/perf/scripts/python/Perf-Trace-Util/lib/Perf/Trace/ |
| D | Core.py | 35 for idx in sorted(flag_fields[event_name][field_name]['values']):
52 for idx in sorted(symbolic_fields[event_name][field_name]['values']):
|
| /linux-6.8/Documentation/mm/ |
| D | slub.rst | 327 - Slabs sorted by size (up to -N <num> slabs, default 1)
328 - Slabs sorted by loss (up to -N <num> slabs, default 1)
353 - Slabs sorted by size: FOO_STATS-slabs-by-size.png
354 - Slabs sorted by loss: FOO_STATS-slabs-by-loss.png
400 allocated objects. The output is sorted by frequency of each trace.
433 time. The output is sorted by frequency of each trace.
|