| /Linux-v6.1/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 …]
|
| /Linux-v6.1/include/linux/ |
| D | util_macros.h | 19 * find_closest - locate the closest element in a sorted array
21 * @a: The array in which to look for the closest element. Must be sorted
30 * find_closest_descending - locate the closest element in a sorted array
32 * @a: The array in which to look for the closest element. Must be sorted
36 * Similar to find_closest() but 'a' is expected to be sorted in descending
|
| /Linux-v6.1/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-v6.1/tools/lib/traceevent/Documentation/ |
| D | libtraceevent-event_list.txt | 7 Get list of events, sorted by given criteria.
28 sorted by the _sort_type_ criteria. The last element of the array is NULL.
68 /* Failed to get the events, sorted by ID */
71 /* walk through the list of the events, sorted by ID */
79 /* Failed to get the events, sorted by name */
82 /* walk through the list of the events, sorted by name */
|
| /Linux-v6.1/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-v6.1/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-v6.1/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-v6.1/tools/vm/ |
| 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-v6.1/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-v6.1/drivers/media/platform/ |
| D | Makefile | 6 # Place here, alphabetically sorted by directory
32 # Please keep it alphabetically sorted by Kconfig name
|
| /Linux-v6.1/drivers/media/pci/ |
| D | Makefile | 6 # Please keep it alphabetically sorted by directory
20 # Please keep it alphabetically sorted by Kconfig name
|
| /Linux-v6.1/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-v6.1/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-v6.1/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-v6.1/drivers/gpu/drm/i915/gt/uc/ |
| D | selftest_guc_multi_lrc.c | 14 struct intel_engine_cs *sorted[MAX_ENGINE_INSTANCE + 1]; in logical_sort() local
20 sorted[i] = engines[j]; in logical_sort()
25 memcpy(*engines, *sorted, in logical_sort()
|
| /Linux-v6.1/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-v6.1/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-v6.1/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-v6.1/Documentation/kbuild/ |
| D | kconfig.rst | 198 When searching, symbols are sorted thus:
200 - first, exact matches, sorted alphabetically (an exact match
202 - then, other matches, sorted alphabetically.
209 of which only ATH5K and ATH9K match exactly and so are sorted
211 sorted in alphabetical order.
|
| /Linux-v6.1/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-v6.1/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-v6.1/tools/perf/scripts/python/ |
| D | mem-phys-addr.py | 49 for mem_type, count in sorted(load_mem_type_cnt.most_common(), \
63 #/proc/iomem is sorted
|
| /Linux-v6.1/drivers/media/rc/ |
| D | Makefile | 12 # IR decoders - please keep it alphabetically sorted by Kconfig name
27 # sorted by Kconfig name (e. g. LC_ALL=C sort Makefile)
|
| /Linux-v6.1/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.
|
| /Linux-v6.1/tools/lib/ |
| D | list_sort.c | 83 * already sorted), this loop may run many iterations. in merge_final()
199 * - pending is a prev-linked "list of lists" of sorted in list_sort()
201 * - Each of the sorted sublists is power-of-two in size. in list_sort()
202 * - Sublists are sorted by size and age, smallest & newest at front. in list_sort()
|
