Home
last modified time | relevance | path

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

12345678910>>...20

/linux/tools/perf/util/
H A Drb_resort.h
H A Dmaps.c20 * 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()
[all...]
H A Ddsos.c21 dsos->sorted = true; in dsos__init()
38 dsos->sorted = true; in dsos__purge()
171 if (!dsos->sorted) { in __dsos__find_by_longname_id()
185 dsos->sorted = true; in __dsos__find_by_longname_id()
213 if (!dsos->sorted) { in __dsos__add()
324 * the array isn't sorted. in dso__set_basename()
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.c269 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()
421 struct rela_dyn *sorted;
423 struct rela_dyn *sorted; global() member
[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/drivers/net/wireless/intel/iwlwifi/mld/
H A Dmld.c145 /* Please keep this array *SORTED* by hex value.
193 /* Please keep this array *SORTED* by hex value.
207 /* Please keep this array *SORTED* by hex value.
218 /* Please keep this array *SORTED* by hex value.
226 /* Please keep this array *SORTED* by hex value.
250 /* Please keep this array *SORTED* by hex value.
270 /* Please keep this array *SORTED* by hex value.
277 /* Please keep this array *SORTED* by hex value.
285 /* Please keep this array *SORTED* by hex value.
297 /* 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/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/tools/sched_ext/
H A Dscx_userland.c75 * 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/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/tools/verification/rvgen/rvgen/
H A Dltl2k.py32 for label in sorted(node.labels):
92 for a in sorted(self.atoms):
154 for o in sorted(node.outgoing):
166 for o in sorted(node.outgoing):
/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/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/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/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/admin-guide/mm/
H A Dslab.rst335 - Slabs sorted by size (up to -N <num> slabs, default 1)
336 - Slabs sorted by loss (up to -N <num> slabs, default 1)
361 - Slabs sorted by size: FOO_STATS-slabs-by-size.png
362 - Slabs sorted by loss: FOO_STATS-slabs-by-loss.png
408 allocated objects. The output is sorted by frequency of each trace.
441 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/tools/lib/python/feat/
H A Dparse_features.py265 sorted_features = sorted(self.data.keys(),
336 for arch in sorted(arch_table.keys()):
392 for name in sorted(self.data.keys(),
418 arch_table = sorted(self.data[name]["table"].items(),
488 for name in sorted(self.data.keys(),
/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)
/linux/fs/smb/client/
H A Dsmb2maperror.c21 * sorted by NT status code (cpu-endian, ascending)
98 /* Check whether the array is sorted in ascending order */ in smb2_init_maperror()
/linux/drivers/md/dm-vdo/
H A Dpacker.h49 * block. The bins are kept in a list sorted by the amount of unused space so the first bin with
79 /* A list of all packer_bins, kept sorted by free_space */

12345678910>>...20