| /linux/tools/net/ynl/ynltool/ |
| H A D | qstats.c | 421 struct netdev_qstats_get_rsp **sorted; in do_balance() local
447 sorted = calloc(count, sizeof(*sorted)); in do_balance()
448 if (!sorted) { in do_balance()
449 p_err("failed to allocate sorted array"); in do_balance()
456 sorted[i++] = qs; in do_balance()
458 qsort(sorted, count, sizeof(*sorted), cmp_ifindex_type); in do_balance()
467 enum netdev_queue_type type = sorted[i]->queue_type; in do_balance()
468 unsigned int ifindex = sorted[i]->ifindex; in do_balance()
474 for (j = i; j < count && sorted[j]->ifindex == ifindex && in do_balance()
475 sorted[j]->queue_type == type; j++) in do_balance()
[all …]
|
| /linux/drivers/md/bcache/ |
| H A 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/Documentation/admin-guide/mm/damon/ |
| H A 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
269 memory and successfully LRU-sorted 32 KiB of the memory in total.
284 Number of hot memory regions that tried to be LRU-sorted.
289 Total bytes of hot memory regions that tried to be LRU-sorted.
294 Number of hot memory regions that successfully be LRU-sorted.
299 Total bytes of hot memory regions that successfully be LRU-sorted.
309 Number of cold memory regions that tried to be LRU-sorted.
314 Total bytes of cold memory regions that tried to be LRU-sorted.
319 Number of cold memory regions that successfully be LRU-sorted.
[all …]
|
| /linux/include/linux/ |
| H A D | util_macros.h | 26 * 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/net/ceph/ |
| H A 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/kernel/kcsan/ |
| H A D | debugfs.c | 47 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/drivers/md/dm-vdo/indexer/ |
| H A D | radix-sort.c | 17 * 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/tools/mm/ |
| H A 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/tools/sched_ext/ |
| H A D | scx_userland.c | 75 * Use a vruntime-sorted list to store tasks. This could easily be extended to
77 * currently elect to use a sorted list to simplify the example for
83 * A vruntime-sorted list of tasks. The head of the list contains the task with
209 * Enqueue the task in a vruntime-sorted list. A more optimal data in vruntime_enqueue()
413 * to the vruntime sorted list. in sched_main_loop()
415 * 2. Dispatch a batch of tasks from the vruntime sorted list in sched_main_loop()
|
| /linux/lib/ |
| H A 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/tools/perf/util/ |
| H A D | maps.c | 20 * under the read lock requiring being sorted. There is a race between sorting
24 * to live lock. Removal of maps doesn't break being sorted.
30 * @maps_by_address: array of maps sorted by their starting address if in DECLARE_RC_STRUCT()
35 * @maps_by_name: optional array of maps sorted by their dso name if in DECLARE_RC_STRUCT()
63 /** @maps_by_address_sorted: is maps_by_address sorted. */ in DECLARE_RC_STRUCT()
65 /** @maps_by_name_sorted: is maps_by_name sorted. */ in DECLARE_RC_STRUCT()
89 /* If addresses are sorted... */ in check_invariants()
509 * Recompute if things are sorted. If things are inserted in a sorted in __maps__insert()
514 /* If there's just 1 entry then maps are sorted. */ in __maps__insert()
518 /* Sorted if maps were already sorted and this map starts after the last one. */ in __maps__insert()
[all …]
|
| H A D | dsos.c | 22 dsos->sorted = true; in dsos__init()
39 dsos->sorted = true; in dsos__purge()
172 if (!dsos->sorted) { in __dsos__find_by_longname_id()
186 dsos->sorted = true; in __dsos__find_by_longname_id()
211 if (!dsos->sorted) { in __dsos__add()
335 * the array isn't sorted. in __dsos__addnew_id()
|
| H A D | dsos.h | 17 * Collection of DSOs as an array for iteration speed, but sorted for O(n)
25 bool sorted; member
|
| H A D | symbol-elf.c | 269 u32 *sorted; member
278 idx = ri->sorted ? ri->sorted[idx] : idx; in get_rel_symidx()
313 size_t sz = sizeof(ri->sorted[0]); in sort_rel()
316 ri->sorted = calloc(ri->nr_entries, sz); in sort_rel()
317 if (!ri->sorted) in sort_rel()
320 ri->sorted[i] = i; in sort_rel()
321 qsort_r(ri->sorted, ri->nr_entries, sz, rel_cmp, ri); in sort_rel()
363 zfree(&ri->sorted); in exit_rel()
423 struct rela_dyn *sorted; member
431 zfree(&di->sorted); in exit_rela_dyn()
[all …]
|
| /linux/Documentation/kbuild/ |
| H A D | kconfig.rst | 185 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 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/tools/verification/rvgen/rvgen/ |
| H A D | ltl2k.py | 31 for label in sorted(node.labels):
84 for a in sorted(self.atoms):
146 for o in sorted(node.outgoing):
158 for o in sorted(node.outgoing):
|
| /linux/arch/sh/kernel/ |
| H A 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/drivers/media/pci/ |
| H A D | Makefile | 6 # Please keep it alphabetically sorted by directory
22 # Please keep it alphabetically sorted by Kconfig name
|
| /linux/drivers/media/usb/ |
| H A 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/scripts/ |
| H A 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/drivers/media/platform/ |
| H A D | Makefile | 6 # Place here, alphabetically sorted by directory
39 # Please keep it alphabetically sorted by Kconfig name
|
| /linux/drivers/comedi/drivers/ni_routing/tools/ |
| H A 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/drivers/media/v4l2-core/ |
| H A D | Makefile | 16 # Please keep it alphabetically sorted by Kconfig name
24 # Please keep it alphabetically sorted by Kconfig name
|
| /linux/drivers/acpi/acpica/ |
| H A 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()
|